In this paper, we present a generalized and novel load distribution strategy for scheduling divisible loads on linear networks, when speeds of the computing nodes and the communication links are unknown a priori. This strategy, which is referred to as Wait and Compute Strategy (WCS), uses a portion of the total load to estimate speed parameters and then use processors in an iterative manner in phases to minimize the overall processing time. We present an analysis of this strategy with respect to time performance and compare its performance with the previous works both analytically and through simulation studies under several influencing parameters. From our findings, we will show that the proposed generalized strategy achieves a better performance in most cases. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Veeravalli, B., & Jia, J. (2008). Design, analysis, and performance evaluation of an efficient resource unaware scheduling strategy for processing divisible loads on distributed linear daisy chain networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5374 LNCS, pp. 390–401). Springer Verlag. https://doi.org/10.1007/978-3-540-89894-8_35
Mendeley helps you to discover research relevant for your work.