Abstract
A new scalable scheduling strategy using cut-through switching is proposed. Recursive and closed-form expressions for speedup are found in heterogeneous single-level trees and in homogeneous multilevel trees, respectively. The ratio of speedup using cut-through switching to that using store-and-forward switching is presented so as to illustrate the amount of improvement in speedup between these two techniques.
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computers and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
