Online Scheduling of Parallel Communications with Individual Deadlines
We consider the online competitiveness for scheduling a set of communication jobs (best described in terms of a weighted graph where nodes denote the communication agents and edges denote com- munication jobs and three weights associated with each edge denote its length, release time, and deadline, respectively), where each node can only send or receive one message at a time. A job is accepted if it is scheduled without interruption in the time interval corresponding to its length between release time and deadline. We want to maximize the sum of the length of the accepted jobs. When an algorithm is not able to preempt (i.e., abort) jobs in service in order to make room for better jobs, previous lower bound shows that no algorithm can guarantee any constant competitive ratio. We examine a natural variant in which jobs can be aborted and each aborted job can be rescheduled from start (cal- led restart). We present simple algorithms under the assumptions on job length: 2-competitive algorithm for unit jobs under the discrete model of time and \( (6 + 4 \cdot \sqrt 2 \approx 11.656) \) -competitive algorithm for jobs of arbitrary length. These upper bounds are compensated by the lower bounds 1.5, 8−ε, respectively.
KeywordsSchedule Problem Release Time Competitive Ratio Online Algorithm Maximum Match
Unable to display preview. Download preview PDF.
- 1.Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, and Adi Rosen. Time-constrained scheduling of weighted packets on trees and meshes. In Proc. of 11th SPAA, pages 1–12, 1999.Google Scholar
- 2.Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, and Walter Unger. Scheduling time-constrained communication in linear networks. In Proc. of 10th SPAA, pages 269–278, 1998.Google Scholar
- 3.Petra Berenbrink, Marco Riedel, and Christian Scheideler. Simple competitive request scheduling strategies. In Proc. of 11th SPAA, pages 33–42, 1999.Google Scholar
- 4.P. Crescenzi, X. Deng, and Ch. Papadimitriou. On approximating a scheduling problem. In Proc. of Approx98, 1998.Google Scholar
- 5.M. Goldwasser. Patience is a virtue: the effect of slack on competitiveness for admission control. In Proc. of 10th ACM-SIAM SODA, pages 396–405, 1999.Google Scholar
- 7.S. Irani and V. Leung. Scheduling with conflicts and applications to traffic signal control. In Proc. of 7th ACM-SIAM SODA, pages 85–94, 1996.Google Scholar
- 8.R. Jain. Scheduling data transfers in parallel computer and communication systems. PhD thesis, Department of Computer Science, University of Texas Austin, 1992.Google Scholar
- 10.R. Jain, K. Somalwar, J. Werth, and J.C. Browne. Heuristics for scheduling i/o operations. IEEE Trans. on Parallel and Distributed Systems, 8(3), 1997.Google Scholar
- 11.R.J. Lipton and A. Tomkins. Online interval scheduling. In Proc. of 5-th ACM SODA, pages 302–305, 1994.Google Scholar
- 12.J. Sgall. Online scheduling. In Online Algorithms: The State of the Art, eds. A. Fiat and G. J. Woeginger, Lecture Notes in Comput. Sci. 1442, Springer Verlag, pages 196–231, 1998.Google Scholar