Scalable Schesuling for Cluster and Grids using Cut Through Switching

J.T. Hung and T.G. Robertazzi


Cut-through switching, divisible load scheduling, scalability, multi-level tree network, simultaneous distribution


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.

Important Links:

Go Back