This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment
November 2007 (vol. 18 no. 11)
pp. 1618-1629
In the divisible load distribution, the classic methods on linear arrays divide the computation and communication processes into multiple time intervals in a pipelined fashion. Li (2003) has proposed a set of improved algorithms for linear arrays which can be generalized to k-dimensional meshes. In this paper, we first propose the algorithm M (multi-installment) that employs the multi-installment technique to improve the best algorithm Q proposed by Li. Second, we propose the algorithm S (start-up cost) that includes the computation and communication start-up costs in the design. While the asymptotic speedups of our algorithms M and S derived from the closed-form solutions are the same as algorithm Q, our algorithms approach the optimal speedups considerably faster than algorithm Q as the number of processors increases. Finally, we combine algorithms M and S and propose the algorithm MS. While algorithm MS has the same the asymptotic performance as algorithms Q and S, it achieves a better speedup when the load to be processed is very large and the number of processors is fixed or when the load to be processed is fixed and the number of processors is small.

[1] D. Altilar and Y. Paker, “Optimal Scheduling Algorithms for Communication Constrained Parallel Processing,” Proc. Eighth Int'l Euro-Par Conf. (Euro-Par '02), pp. 197-206, 2002.
[2] V. Bharadwaj and H.M. Wong, “Scheduling Divisible Loads on Heterogeneous Linear Daisy Chain Networks with Arbitrary Processor Release Times,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 3, pp. 273-288, Mar. 2004.
[3] V. Bharadwaj, D. Ghose, and V. Mani, “Multi-Installment Load Distribution in Tree Networks with Delays,” IEEE Trans. Aerospace and Electronic Systems, vol. 31, no. 2, pp. 555-567, 1995.
[4] V. Bharadwaj, D. Ghose, V. Mani, and T.G. Robertazzi, Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE CS Press, 1996.
[5] V. Bharadwaj, D. Ghose, and T. Robertazzi, “Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems,” Cluster Computing, vol. 6, no. 1, pp. 7-17, 2003.
[6] V. Bharadwaj and H.M. Wong, “Scheduling Divisible Loads on Heterogeneous Linear Daisy Chain Networks with Arbitrary Processor Release Times,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 3, 273-288, Mar. 2004.
[7] J. Blazewicz, M. Drozdowski, and M. Markiewicz, “Divisible Task Scheduling—Concept and Verification,” Parallel Computing, vol. 25, pp. 87-98, 1999.
[8] J. Blazewicz, M. Drozdowski, F. Guinand, and D. Trystram, “Scheduling a Divisible Task in a 2-Dimensional Mesh,” Discrete Applied Math., vol. 94, nos. 1-3, pp. 35-50, 1999.
[9] S. Chan, V. Bharadwaj, and D. Ghose, “Large Matrix-Vector Products on Distributed Bus Networks with Communication Delays Using the Divisible Load Paradigm: Performance and Simulation,” Math. and Computers in Simulation, vol. 58, pp. 71-92, 2001.
[10] S. Charcranoon, T.G. Robertazzi, and S. Luryi, “Parallel Processor Configuration Design with Processing/Transmission Costs,” IEEE Trans. Computers, vol. 49, no. 9, pp. 987-991, Sept. 2000.
[11] 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.
[12] M. Drozdowski, Selected Problems of Scheduling Tasks in Multiprocessor Computing Systems. Poznan Univ. of Technology Press, 1997.
[13] M. Drozdowski and W. Glazek, “Scheduling Divisible Loads in a Three-Dimensional Mesh of Processors,” Parallel Computing, vol. 25, no. 4, pp. 381-404, 1999.
[14] M. Drozdowski and P. Wolniewicz, “Out-of-Core Divisible Load Processing,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 10, pp. 1048-1056, Oct. 2003.
[15] M. Drozdowski and P. Wolniewicz, “Performance Limits of Divisible Load Processing in Systems with Limited Communication Buffers,” J. Parallel and Distributed Computing, vol. 64, no. 8, pp. 960-973, 2004.
[16] D. Ghose and H.J. Kim, “Computing BLAS Level-2 Operations on Workstation Clusters Using the Divisible Load Paradigm,” Math. and Computer Modelling, vol. 41, no. 1, pp. 49-70, Jan. 2005.
[17] W. Glazek, “Distributed Computation in a Three-Dimensional Mesh with Communication Delays,” Proc. Sixth Euromicro Workshop Parallel and Distributed Processing, pp. 38-42, Jan. 1998.
[18] J. Guo, J. Yao, and L.N. Bhuyan, “An Efficient Packet Scheduling Algorithm in Network Processors,” Proc. INFOCOM, Mar. 2005.
[19] C. Lee and M. Hamdi, “Parallel Image Processing Applications on a Network of Workstations,” Parallel Computing, vol. 21, pp. 137-160, 1995.
[20] K. Li, “Managing Divisible Load on Partitionable Networks,” High Performance Computing Systems and Applications, J. Schaeffer, ed., pp. 217-228, Kluwer Academic Publishers, 1998.
[21] K. Li, “Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Pipelined Communications,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 12, pp. 1250-1261, Dec. 2003.
[22] K. Li, “Accelerating Divisible Load Distribution on Tree and Pyramid Networks Using Pipelined Communications,” Proc. 18th Int'l Parallel and Distributed Processing Symp. (IPDPS '04), p. 228, Apr. 2004.
[23] X. Li, B. Veeravalli, and C.C. Ko, “Divisible Load Scheduling on a Hypercube Cluster with Finite-Size Buffers and Granularity Constraints,” Proc. First IEEE/ACM Int'l Symp. Cluster Computing and the Grid (CCGrid '01), pp. 660-667, May 2001.
[24] X. Li, V. Bharadwaj, and C.C. Ko, “Distributed Image Processing on a Network of Workstations,” Int'l J. Computers and Applications, vol. 25, no. 2, pp. 1-10, 2003.
[25] T.G. Robertazzi, “Ten Reasons to Use Divisible Load Theory,” Computer, pp. 63-68, May 2003.
[26] B. Veeravalli, X. Li, and C.C. Ko, “On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 12, pp. 1288-1305, Dec. 2000.
[27] R. Wang, A. Krishnamurthy, R. Martin, T. Anderson, and D. Culler, “Modeling Communication Pipeline Latency,” Proc. Joint Int'l Conf. Measurement and Modeling of Computer Systems (SIGMETRICS '98/PERFORMANCE '98), pp. 22-32, 1998.
[28] Y. Yang, K.V.D. Raadt, and H. Casanova, “Multiround Algorithms for Scheduling Divisible Loads,” IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 11, pp. 1092-1102, Nov. 2005.

Index Terms:
Divisible load theory, linear array, k-dimensional mesh, multi-installment
Citation:
Yeim-Kuan Chang, Jia-Hwa Wu, Chi-Yeh Chen, Chih-Ping Chu, "Improved Methods for Divisible Load Distribution on k-Dimensional Meshes Using Multi-Installment," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 11, pp. 1618-1629, Nov. 2007, doi:10.1109/TPDS.2007.1103
Usage of this product signifies your acceptance of the Terms of Use.