This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Messages Scheduling for Parallel Data Redistribution between Clusters
October 2006 (vol. 17 no. 10)
pp. 1163-1175

Abstract—We study the problem of redistributing data between clusters interconnected by a backbone. We suppose that at most k communications can be performed at the same time (the value of k depending on the characteristics of the platform). Given a set of messages, we aim at minimizing the total communication time assuming that communications can be preempted and that preemption comes with an extra cost. Our problem, called k{\hbox{-}}Preemptive Bipartite Scheduling (KPBS) is proven to be NP-hard. We study its lower bound. We propose two {\frac{8}{3}}{\hbox{-}}{\rm{approximation}} algorithms with low complexity and fast heuristics. Simulation results show that both algorithms perform very well compared to the optimal solution and to the heuristics. Experimental results, based on an MPI implementation of these algorithms, show that both algorithms outperform a brute-force TCP-based solution, where no scheduling of the messages is performed.

[1] F.N. Afrati, T. Aslanidis, E. Bampis, and I. Milis, “Scheduling in Switching Networks with Set-Up Delays,” J. Combinatorial Optimization, vol. 9, no. 1, pp. 49-57, 2005.
[2] F. Bertrand, R. Bramley, D. Bernholdt, J.A. Kohl, A. Sussman, J.W. Larson, and K. Damevski, “Data Redistribution and Remote Method Invocation in Parallel Component Architectures,” Proc. Int'l Parallel and Distributed Processing Symp., 2005.
[3] P.B. Bhat, V.K. Prasanna, and C.S. Raghavendra, “Block Cyclic Redistribution over Heterogeneous Networks,” Proc. 11th Int'l Conf. Parallel and Distrinuted Computing Systems (PDCS '98), 1998.
[4] G. Bongiovanni, D. Coppersmith, and C.K. Wong, “An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders,” IEEE Trans. Comm., vol. 29, no. 5, pp. 721-726, 1981.
[5] V. Boudet, F. Desprez, and F. Suter, “One-Step Algorithm for Mixed Data and Task Parallel Scheduling without Data Replication,” Proc. Int'l Parallel and Distributed Processing Symp., p. 41, 2003.
[6] H. Casanova and J. Dongarra, “NetSolve: A Network-Enabled Server for Solving Computational Science Problems,” Int'l J. Supercomputer Applications and High Performance Computing, vol. 11, no. 3, pp. 212-213, Fall 1997.
[7] H. Choi, H.-A. Choi, and M. Azizoglu, “Efficient Scheduling of Transmissions in Optical Broadcast Networks,” IEEE/ACM Trans. Networking, vol. 4, no. 6, pp. 913-920, 1996.
[8] P. Crescenzi, D. Xiaotie, and C.H. Papadimitriou, “On Approximating a Scheduling Problem,” J. Combinatorial Optimization, vol. 5, pp. 287-297, 2001.
[9] B. Del-Fabbro, D. Laiymani, J.-M. Nicod, and L. Philippe, “Data Management in Grid Applications Providers,” Proc. Int'l Conf. Distributed Frameworks for Multimedia Applications (DFMA), pp. 315-322, 2005.
[10] F. Desprez, J. Dongarra, A. Petitet, C. Randriamaro, and Y. Robert, “Scheduling Block-Cyclic Array Redistribution,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 2, pp. 192-205, Feb. 1998.
[11] F. Desprez and E. Jeannot, “Improving the GridRPC Model with Data Persistence and Redistribution,” Proc. Third Int'l Symp. Parallel and Distributed Computing (ISPDC), July 2004.
[12] S. Even, A. Itai, and A. Shamir, “On the Complexity of Timetable and Multicommodity Flow Problem,” SIAM J. Computers, vol. 5, pp. 691-703, 1976.
[13] A. Ganz and Y. Gao, “A Time-Wavelength Assignment Algorithm for WDM Star Network,” Proc. IEEE INFOCOM Conf., pp. 2144-2150, 1992.
[14] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
[15] I.S. Gopal, G. Bongiovanni, M.A. Bonuccelli, D.T. Tang, and C.K. Wong, “An Optimal Switching Algorithm for Multibean Satellite Systems with Variable Bandwidth Beams,” IEEE Trans. Comm., vol. 30, no. 11, pp. 2475-2481, Nov. 1982.
[16] I.S. Gopal and C.K. Wong, “Minimizing the Number of Switching in an SS/TDMA System,” IEEE Trans. Comm., 1985.
[17] M. Guo and I. Nakata, “A Framework for Efficient Data Redistribution on Distributed Memory Multicomputers,” The J. Supercomputing, vol. 20, no. 3, pp. 243-265, 2001.
[18] S. Sekiguchi, H. Nakada, and M. Sato, “Design and Implementations of Ninf: Towards a Global Computing Infrastructure,” Future Generation Computing Systems, vol. 15, pp. 649-658, 1999.
[19] C.-H. Hsu, Y.-C. Chung, D.-L. Yang, and C.-R. Dow, “A Generalized Processor Mapping Technique for Array Redistribution,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 7, pp. 743-757, 2001.
[20] The Hydrogrid Project, http://www-rocq.inria.fr/kern/Hydro Grid HydroGrid-en.html, 2006.
[21] Oak Ridge National Labs, Mxn, http://www.csm.ornl.gov/ccamxn, 2006.
[22] S. Micali and V.V. Vazirani, “An $o(\sqrt(v)e)$ Algorithm for Finding a Maximum Matching in General Graphs,” Proc. 21st Ann IEEE Symp. Foundations of Computer Science, pp. 17-27, 1980.
[23] M. Mishra and K. Sivalingam, “Scheduling in WDM Networks with Tunable Transmitter and Tunable Receiver Architecture,” Proc. NetWorld + Interop Eng. Conf., May 1999.
[24] N. Park, V.K. Prasanna, and C.S. Raghavendra, “Efficient Algorithms for Block-Cyclic Array Redistribution between Processor Sets,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 12, pp. 1217-1239, Dec. 1999.
[25] C. Pérez, T. Priol, and A. Ribes, “A Parallel Corba Component Model for Numerical Code Coupling,” Proc. Third Int'l Workshop Grid Computing, Nov. 2002.
[26] G.R. Pieris and G.H. Sasaki, “Scheduling Transmission in WDM Broadcast-and-Select Networks,” IEEE/ACM Trans. Networking, vol. 2, no. 2, Apr. 1994.
[27] A. Radulescu, C. Nicolescu, A.J.C. van Gemund, and P. Jonker, “CPR: Mixed Task and Data Parallel Scheduling for Distributed Systems,” Proc. Int'l Parallel and Distributed Processing Symp., p. 39, 2001.
[28] N. Rouskas and V. Sivaraman, “On the Design of Optimal TDM Schedules for Broadcast WDM Networks with Arbitrary Transceiver Tuning Latencies,” Proc. IEEE INFOCOM Conf., pp. 1217-1224, 1996.
[29] A. Rubini, “Linux Module for Network Shaping,” http://ar.linux.it/software\#rshaper, 2005.
[30] C. Szyperski, Component Software: Beyond Object-Oriented Programming. ACM Press, 1999.
[31] J. Turek, J. Wolf, and P. Yu, “Approximate Algorithms Scheduling Parallelizable Tasks,” Proc. Fourth Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '92), pp. 323-332, 1992.

Index Terms:
Message scheduling, data redistribution, grid computing, approximation algorithm, code coupling.
Citation:
Johanne Cohen, Emmanuel Jeannot, Nicolas Padoy, Fr?d?ric Wagner, "Messages Scheduling for Parallel Data Redistribution between Clusters," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 10, pp. 1163-1175, Oct. 2006, doi:10.1109/TPDS.2006.141
Usage of this product signifies your acceptance of the Terms of Use.