design, analysis, and performance evaluation of an efficient resource unaware scheduling strategy for processing divisible loads on distributed linear daisy chain networks
In this paper, we present a generalized and novel load distributionstrategy for scheduling divisible loads on linear networks, whenspeeds of the computing nodes and the communication links are unknowna priori. This strategy, which is referred to as Wait and ComputeStrategy (WCS), uses a portion of the total load to estimate speedparameters and then use processors in an iterative manner in phasesto minimize the overall processing time. We present an analysis of thisstrategy with respect to time performance and compare its performancewith the previous works both analytically and through simulation studiesunder several influencing parameters. From our findings, we will showthat the proposed generalized strategy achieves a better performance inmost cases.
divisible loads linear networks processing time communication delays