Scheduling Communication Requests Traversing a Switch: Complexity and Algorithms

In this paper, we study the problem of scheduling file transfers through a switch. This problem is at the heart of a model often used for large grid computations, where the switch represents the core of the network interconnecting the various clusters that compose the grid. We establish several complexity results, and we introduce and analyze various algorithms, from both a theoretical and a practical perspective

[1]  Henri Casanova,et al.  A realistic network/application model for scheduling divisible loads on large-scale platforms , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[2]  Philippe Baptiste,et al.  Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times , 1999 .

[3]  Yves Robert,et al.  Scheduling network requests with transmission window , 2005 .

[4]  Tak Wah Lam,et al.  Performance guarantee for EDF under overload , 2004, J. Algorithms.

[5]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[6]  15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP 2007), 7-9 February 2007, Naples, Italy , 2007, PDP.

[7]  Pascale Vicat-Blanc Primet,et al.  A Flexible Bandwidth Reservation Framework for Bulk Data Transfers in Grid Networks , 2006, ArXiv.

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[10]  D. Coudert,et al.  Lightpath assignment for multifibers wdm optical networks with wavelength translators , 2002 .

[11]  Frédéric Vivien,et al.  Minimizing the stretch when scheduling flows of biological requests , 2006, SPAA '06.

[12]  Philippe Baptiste,et al.  An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1999, Oper. Res. Lett..

[13]  E. L. Lawler,et al.  A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1991 .

[14]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[15]  Yves Robert,et al.  Optimizing network resource sharing in grids , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[16]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..