Abstract
We study the problem of scheduling a divisible load in a three-dimensional mesh of processors. The objective is to find partition of a load into shares and distribution of load shares among processors which minimize load processing time subject to communication delays involved in sending load from one processor to another. We propose a new scheduling algorithm which distributes load in a sequence of stages across the network, each stage brings load to a set of processors located at the same distance from the load source. A key feature of our solution is that sets of processors receive load in the order of decreasing processing capacities. We call this scheduling strategy Largest Layer First. A theorem about the processing time attained by the algorithm is stated. Performance of the algorithm is compared to earlier results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B.A. Shirazi, A.R. Hurson and K.M. Kavi (eds.), Scheduling and Load Balancing in Parallel and Distributed Systems (IEEE Computer Society Press, Los Alamitos, CA 1995).
J. Błazewicz, M. Drabowski and J. Weglarz, Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers 35(5) (1986) 389–398.
V. Bharadwaj, D. Ghose, V. Mani and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems (IEEE Computer Society Press, Los Alamitos, CA, 1996).
Y.C. Cheng and T.G. Robertazzi, Distributed computation with communication delay, IEEE Transactions on Aerospace and Electronic Systems 24(6) (1988) 700–712.
Y.C. Cheng and T.G. Robertazzi, Distributed computation for a tree network with communication delay, IEEE Transactions on Aerospace and Electronic Systems 26(3) (1990) 511–516.
S. Bataineh and T.G. Robertazzi, Bus-oriented load sharing for a network of sensor driven processors, IEEE Transactions on Systems, Man and Cybernetics 21(5) (1991) 1202–1205.
J. Błazewicz and M. Drozdowski, The performance limits of a twodimensional network of load-sharing processors, Foundations of Computing and Decision Sciences 21(1) (1996) 3–15.
V. Bharadwaj, D. Ghose and V. Mani, Multi-installment load distribution in tree networks with delays, IEEE Transactions on Aerospace and Electronic Systems 31(2) (1995) 555–567.
V. Bharadwaj, D. Ghose and V. Mani, An efficient load distribution strategy for a distributed linear network of processors with communication delays, Computer and Mathematics with Applications 29(9) (1995) 95–112.
J. Błazewicz, M. Drozdowski, F. Guinand and D. Trystram, Scheduling a divisible task in a 2-dimensional mesh, Discrete Applied Mathematics 94(1–3) (1999) 35–50.
M. Drozdowski, Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems (Poznań University of Technology Press, Poznań, 1997).
M. Drozdowski and W. Głazek, Scheduling divisible loads in a threedimensional mesh of processors, Parallel Computing 25 (1999) 381–404.
L.M. Ni and P.K. McKinley, A survey of wormhole routing techniques in direct networks, Computer 26(2) (1993) 62–76.
J.G. Peters and M. Syska, Circuit-switched broadcasting in torus networks, IEEE Transactions on Parallel and Distributed Systems 7(3) (1996) 246–255.
P. Fraigniaud, S. Miguet and Y. Robert, Complexity of scattering on a ring of processors, Parallel Computing 13 (1990) 377–383.
J.L. Park and H. Choi, Circuit switched broadcasting in torus mesh networks, IEEE Transactions on Parallel and Distributed Systems 7(2) (1996) 184–190.
The T9000 transputer products overview manual, INMOS Ltd., 1991.
Cray T3D technical summary, Cray Research Inc. 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Głazek, W. A Multistage Load Distribution Strategy for Three-Dimensional Meshes. Cluster Computing 6, 31–39 (2003). https://doi.org/10.1023/A:1020962916217
Issue Date:
DOI: https://doi.org/10.1023/A:1020962916217