• Publication
  • 1998
  • Issue No. 5 - May
  • Abstract - Collection-Aware Optimum Sequencing of Operations and Closed-Form Solutions for the Distribution of a Divisible Load on Arbitrary Processor Trees
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Collection-Aware Optimum Sequencing of Operations and Closed-Form Solutions for the Distribution of a Divisible Load on Arbitrary Processor Trees
May 1998 (vol. 9 no. 5)
pp. 429-441

Abstract—The problem of optimally distributing a divisible load to the nodes of an arbitrary processor tree is tackled in this paper. The rigorous mathematical foundation presented allows the derivation of the sequence of operations that is necessary to obtain the minimum processing time, along with closed-form expressions that yield the solution in time O(NP), where P is the number of tree nodes and N their maximum degree. The main contributions of this work are: (1) both load distribution and result collection overheads are considered, thus providing better resource utilization, and (2) arbitrary processor trees are examined in contrast with previous approaches that examined either complete homogeneous trees, or single level trees. Additionally, approximate algorithms for solving the problem of specifying the optimum subset of active processors for a given load, are presented and evaluated.

[1] V.D. Agrawal and S.T. Chakradhar, "Performance Analysis of Synchronized Iterative Algorithms on Multiprocessor Systems," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 6, pp. 739-746, Nov. 1992.
[2] G.D. Barlas, "Compression Algorithms for One-Dimensional Semiperiodical Biomedical Signals and Methods for Their Parallelization," PhD thesis, Nat'l Technical Univ. of Athens, 1996.
[3] G.D. Barlas, G. Frangakis, and E. Skordalakis, "TFGS: A Transputer File and Graphics System for PC-Hosted Machines," Microprocessors and Microsystems, vol. 16, pp. 453-462, 1992.
[4] S. Bataineh, T. Hsiung, and T.G. Robertazzi, Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job IEEE Trans. Computers, vol. 43, no. 10, pp. 1184-1196, Oct. 1994.
[5] V. Bharadwaj, D. Ghose, and V. Mani, "Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 9, pp. 968-976, Sept. 1994.
[6] V. Bharadwaj, D. Ghose, V. Mani, and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems.Los Alamitos, Calif.: IEEE CS Press, 1996.
[7] J. Blazewicz and M. Drozdowski, "Scheduling Divisible Jobs on Hypercubes," Parallel Computing, vol. 21, pp. 1,945-1,956, 1995.
[8] Y.C. Cheng and T.G. Robertazzi, Distributed Computation with Communication Delays IEEE Trans. Aerospace and Electronic Systems, vol. 24, no. 6, pp. 700-712, Nov. 1988.
[9] Y.C. Cheng and T.G. Robertazzi, "Distributed Computation for a Tree Network with Communication Delays," IEEE Trans. Aerospace and Electronic Systems, vol. 26, no. 3, pp. 511-516, May 1990.
[10] D. Gerogiannis and S.C. Orphanoudakis, "Load Balancing Requirements in Parallel Implementations of Image Feature Extraction Tasks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 9, pp. 994-1,013, Sept. 1993.
[11] G. Ghiola and G. Ciaccio, "GAMMA: A Low-Cost Network of Workstations Based on Active Messages," Proc. PDP '97,London, Jan. 1997. Also available fromhttp://www.disi.unige.it/projectgamma/.
[12] M. Kaddoura, C.W. Qu, and S. Ranka, “Partitioning Unstructured Computational Graphs for Nonuniform and Adaptive Environments,” IEEE Parallel and Distributed Technology, pp. 63–69, 1995.
[13] C.-T. King, W.-H. Chou, and L.M. Ni, "Pipelined Data-Parallel Algorithms: Part I-Concept and Modeling," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 4, pp. 470-485, Oct. 1990.
[14] C.-T. King, W.-H. Chou, and L.M. Ni, "Pipelined Data-Parallel Algorithms: Part II-Design," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 4, pp. 486-499, Oct. 1990.
[15] K. Konstantinides, R.T. Kaneshiro, and J.R. Tani, "Task Allocation and Scheduling Models for Multiprocessor Digital Signal Processing," IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 38, no. 12, pp. 2,151-2,161, Dec. 1990.
[16] S.Y. Kung, VLSI Array Processors. Prentice Hall, 1988.
[17] S.-K. Lee and H.-A. Choi, "Embedding of Complete Binary Trees into Meshes with Row-Column Routing," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 5, pp. 493-497, May 1996.
[18] D. Reed, C. Catlett, A. Choudhary, D. Korz, and M. Snir, "Parallel I/O: Getting Ready for Prime Time," edited transcript from ICPP94, IEEE Parallel and Distributed Technology, vol. 3, no. 2, pp. 64-71, Summer 1995.
[19] D. Ridge, D. Becker, P. Merkey, and T. Sterling, "Beowulf: Harnessing the Power of Parallelism in a Pile-of-PCs," Proc. IEEE Aerospace, 1997. Also available fromhttp://cesdis.gsfc.nasa.gov/beowulfpapers.html .
[20] T.G. Robertazzi, "Processor Equivalence for a Linear Daisy Chain of Load Sharing Processors," IEEE Trans. Aerospace and Electronic Systems, vol. 29, no. 4, pp. 1,216-1,221, Oct. 1993.
[21] S. Selvakumar and C.S.R. Murthy, "Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 3, pp. 328-336, Mar. 1994.
[22] W. Shang and J.A.B. Fortes, "On Time Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 350-363, May 1992.
[23] O. Sharp, "The Grand Challenges," BYTE, vol. 20, no. 2, pp. 65-72, Feb. 1995.
[24] W.L. Winston, Introduction to Mathematical Programming-Applications and Algorithms, second ed., chapter 9. Duxbury Press, 1995.

Index Terms:
Optimum load distribution, optimum distribution and collection sequencing, data-parallel applications, arbitrary processor trees, collection-aware load distribution.
Citation:
Gerassimos D. Barlas, "Collection-Aware Optimum Sequencing of Operations and Closed-Form Solutions for the Distribution of a Divisible Load on Arbitrary Processor Trees," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 5, pp. 429-441, May 1998, doi:10.1109/71.679214
Usage of this product signifies your acceptance of the Terms of Use.