Abstract
In this paper we study the general problem of parallel data redistribution over a network. Given a set of communications between two parallel machines interconnected by a backbone, we wish to minimize the total time required for the completion of all communications assuming that communications can be preempted and that preemption comes with an extra cost. Our problem, called k-Preemptive bipartite scheduling (KPBS) is proven to be NP-Complete. Moreover we prove that approximating KPBS problem within a ratio number smaller that \(\frac{4}{3}\) is impossible unless P=NP. In spite of this negative result, we study a lower bound on the cost of KPBS problem in terms of its parameters, and we propose an approximation algorithm with ratio 2 and fast heuristics.
This work is partially supported by the ARC INRIA redGRID
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Labs, O.R.N.: Mxn, http://www.csm.ornl.gov/cca/mxn
Geist, G.A., Kohl, J.A., Papadopoulos, P.M.: CUMULVS: Providing Fault- Tolerance, Visualization and Steering of Parallel Applications. International Journal of High Performance Computing Applications 11, 224–236 (1997)
Choi, H., Choi, H.A., Azizoglu, M.: Efficient Scheduling of Transmissions in Optical Broadcast Networks. IEEE/ACM Transaction on Networking 4, 913–920 (1996)
Ganz, A., Gao, Y.: A Time-Wavelength Assignment Algorithm for WDM Star Network. In: IEEE INFOCOM 1992, 2144–2150 (1992)
Mishra, M., Sivalingam, K.: Scheduling in WDM Networks with Tunable Transmitter and Tunable Receiver Architecture. In: NetWorld+Interop Engineers Conference, Las Vegas, NJ (1999)
Pieris, G.R.: Scheduling Transmission in WDM Broadcast-and-Select Networks. IEEE/ACM Transaction on Networking 2 (1994)
Rouskas, N., Sivaraman, V.: On the Design of Optimal TDM Schedules for Broadcast WDM Networks with Arbitrary Transceiver Tuning Latencies. In: IEEE INFOCOM 1996, pp. 1217–1224 (1996)
Bongiovanni, G., Coppersmith, D., Wong, C.K.: An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of Transponders. IEEE Transactions on Communications 29, 721–726 (1981)
Gopal, I.S., Bongiovanni, G., Bonuccelli, M.A., Tang, D.T., Wong, C.K.: An Optimal Switching Algorithm for Multibean Satellite Systems with Variable Bandwidth Beams. IEEE Transactions on Communications COM-30, 2475–2481 (1982)
Gopal, I., Wong, C.: Minimizing the Number of Switching in an SS/TDMA System. IEEE Transactions on Communications (1985)
Afrati, F., Aslanidis, T., Bampis, E., Milis, I.: Scheduling in switching networks with set-up delays. In: AlgoTel 2002, Mèze, France (2002)
Crescenzi, P., Xiaotie, D., Papadimitriou, C.H.: On Approximating a Scheduling Problem. Journal of Combinatorial Optimization 5, 287–297 (2001)
Desprez, F., Dongarra, J., Petitet, A., Randriamaro, C., Robert, Y.: Scheduling Block-Cyclic Array Redistribution. IEEE Transaction on Parallel and Distributed Systems 9, 192–205 (1998)
Bhat, P.B., Prasanna, V.K., Raghavendra, C.S.: Block Cyclic Redistribution over Heterogeneous Networks. In: 11th International Conference on Parallel and Distributed Computing Systems, PDCS 1998 (1998)
Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problem. SIAM J. Comput. 5, 691–703 (1976)
Cohen, J., Jeannot, E., Padoy, N.: Parallel Data Redistribution Over a Backbone. Technical Report RR-4725, INRIA (2003)
Padoy, N.: Redistribution de données entre deux grappes d’ordinateurs. Rapport de stage, de l’École Normale Supérieure de Lyon (2002)
Berge, C.: Graphs. North-Holland, Amsterdam (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cohen, J., Jeannot, E., Padoy, N. (2004). Messages Scheduling for Data Redistribution between Clusters. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_116
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_116
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive