Efficient Job Scheduling Algorithms with Multi-type Contentions

In this paper, we consider an interesting generalization of the classic job scheduling problem in which each job needs to compete for not only machines but also other types of resources The contentions among jobs for machines and resources could interfere with each other, which complicates the problem dramatically We present a family of approximation algorithms for solving several variants of the problem by using a generic algorithmic framework Our algorithms achieve a constant approximation ratio (i.e., 3) if there is only one type of resources or certain dependency relation exists among multiple types of resources For the case that r unrelated resources are given, the approximation ratio of our algorithm becomes k + 2, where k ≤ r is a constant depending on the problem instance As an application, we also show that our techniques can be easily applied to optical burst switching (OBS) networks for deriving more efficient wavelength scheduling algorithms.

[1]  Toshihide Ibaraki,et al.  A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times , 1978, Oper. Res..

[2]  Akcoglu Karhan,et al.  Opportunity Cost Algorithms for Combinatorial Auctions , 2000 .

[3]  Bhaskar Das Gupta,et al.  Online real-time preemptive scheduling of jobs with deadlines , 2000, APPROX.

[4]  Angelika Steger,et al.  A new average case analysis for completion time scheduling , 2002, STOC '02.

[5]  Spyros C. Kontogiannis,et al.  Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines , 2002, STOC '02.

[6]  Richard J. Lipton,et al.  Online interval scheduling , 1994, SODA '94.

[7]  Reuven Bar-Yehuda,et al.  A unified approach to approximating resource allocation and scheduling , 2000, STOC '00.

[8]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: practical and theoretical results , 1987 .

[9]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[10]  Esther M. Arkin,et al.  Scheduling jobs with fixed start and end times , 1987, Discret. Appl. Math..

[11]  P. Berman,et al.  A Simple Approximation Algorithm for Nonoverlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles) , 2002 .

[12]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[13]  Randeep Bhatia,et al.  Book review: Approximation Algorithms for NP-hard Problems. Edited by Dorit S. Hochbaum (PWS, 1997) , 1998, SIGA.

[14]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[15]  Piotr Berman,et al.  Improvements in throughout maximization for real-time scheduling , 2000, STOC '00.

[16]  Jong-Dug Shin,et al.  Group-scheduling for optical burst switched (OBS) networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[17]  Frits C. R. Spieksma,et al.  Simple Algorithms for a Weighted Interval Selection Problem , 2000, ISAAC.

[18]  Jonathan S. Turner,et al.  Terabit burst switching , 1999, J. High Speed Networks.

[19]  Susanne Albers,et al.  On randomized online scheduling , 2002, STOC '02.

[20]  Chunming Qiao,et al.  Efficient channel scheduling algorithms in optical burst switched networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[21]  Piotr Berman,et al.  Simple approximation algorithm for nonoverlapping local alignments , 2002, SODA '02.

[22]  Chunming Qiao,et al.  Optical burst switching (OBS) - a new paradigm for an Optical Internet^{1} , 1999, J. High Speed Networks.

[23]  Rafail Ostrovsky,et al.  Approximation algorithms for the job interval selection problem and related scheduling problems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[24]  Chunming Qiao,et al.  High-speed protocol for bursty traffic in optical networks , 1997, Other Conferences.

[25]  Yijun Xiong,et al.  Control architecture in optical burst-switched WDM networks , 2000, IEEE Journal on Selected Areas in Communications.

[26]  Chang-Soo Park,et al.  Efficient channel-scheduling algorithm in optical burst switching architecture , 2002, Workshop on High Performance Switching and Routing, Merging Optical and IP Technologie.