Scalable scheduling for clusters and grids using cut through switching

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.