
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 11631175, October, 2006.  
BibTex  x  
@article{ 10.1109/TPDS.2006.141, author = {Johanne Cohen and Emmanuel Jeannot and Nicolas Padoy and Fr?d?ric Wagner}, title = {Messages Scheduling for Parallel Data Redistribution between Clusters}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {17}, number = {10}, issn = {10459219}, year = {2006}, pages = {11631175}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.141}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Messages Scheduling for Parallel Data Redistribution between Clusters IS  10 SN  10459219 SP1163 EP1175 EPD  11631175 A1  Johanne Cohen, A1  Emmanuel Jeannot, A1  Nicolas Padoy, A1  Fr?d?ric Wagner, PY  2006 KW  Message scheduling KW  data redistribution KW  grid computing KW  approximation algorithm KW  code coupling. VL  17 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We study the problem of redistributing data between clusters interconnected by a backbone. We suppose that at most
[1] F.N. Afrati, T. Aslanidis, E. Bampis, and I. Milis, “Scheduling in Switching Networks with SetUp Delays,” J. Combinatorial Optimization, vol. 9, no. 1, pp. 4957, 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. 721726, 1981.
[5] V. Boudet, F. Desprez, and F. Suter, “OneStep 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 NetworkEnabled Server for Solving Computational Science Problems,” Int'l J. Supercomputer Applications and High Performance Computing, vol. 11, no. 3, pp. 212213, 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. 913920, 1996.
[8] P. Crescenzi, D. Xiaotie, and C.H. Papadimitriou, “On Approximating a Scheduling Problem,” J. Combinatorial Optimization, vol. 5, pp. 287297, 2001.
[9] B. DelFabbro, 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. 315322, 2005.
[10] F. Desprez, J. Dongarra, A. Petitet, C. Randriamaro, and Y. Robert, “Scheduling BlockCyclic Array Redistribution,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 2, pp. 192205, 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. 691703, 1976.
[13] A. Ganz and Y. Gao, “A TimeWavelength Assignment Algorithm for WDM Star Network,” Proc. IEEE INFOCOM Conf., pp. 21442150, 1992.
[14] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. 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. 24752481, 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. 243265, 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. 649658, 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. 743757, 2001.
[20] The Hydrogrid Project, http://wwwrocq.inria.fr/kern/Hydro Grid HydroGriden.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. 1727, 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 BlockCyclic Array Redistribution between Processor Sets,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 12, pp. 12171239, 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 BroadcastandSelect 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. 12171224, 1996.
[29] A. Rubini, “Linux Module for Network Shaping,” http://ar.linux.it/software\#rshaper, 2005.
[30] C. Szyperski, Component Software: Beyond ObjectOriented 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. 323332, 1992.