Abstract
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.
This research was supported in part by an IBM faculty partnership award, and an IRCAF award from SUNY Buffalo.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akcoglu, K., Aspnes, J., DasGupta, B., Kao, M.-Y.: Opportunity cost algorithms for combinatorial auctions. In: Applied Optimization: Computational Methods in Decision-Making, Economics and Finance, pp. 455–479. Kluwer Academic Publishers, Dordrecht (2002)
Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. In: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 735–744. ACM Press, New York (2000)
Berman, P., DasGupta, B.: Improvements in throughout maximization for real-time scheduling. In: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 680–687. ACM Press, New York (2000)
Berman, P., DasGupta, B., Muthukrishnan, S.: Simple approximation algorithm for nonoverlapping local alignments. In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 677–678 (2002)
Chuzhoy, J., Ostrovsky, R., Rabani, Y.: Approximation algorithms for the job interval selection problem and related scheduling problems. In: IEEE Symposium on Foundations of Computer Science, pp. 348–356 (2001)
DasGupta, B., Palis, M.A.: A Palis. Online real-time preemptive scheduling of jobs with deadlines on multiple machines. Journal of Scheduling 4(6), 297–312 (2001)
Erlebach, T., Spieksma, F.C.R.: Simple algorithms for a weighted interval selection problem. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 228–240. Springer, Heidelberg (2000)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: practical and theoretical results. Journal of the ACM 34, 144–162 (1987)
Kontogiannis, S.: Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines. In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 124–133. ACM Press, New York (2002)
Lipton, R.J., Tomkins, A.: Online interval scheduling. In: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, pp. 302–311. ACM Press, New York (1994)
Qiao, C., Yoo, M.: Optical burst switching(obs) - a new paradigm for an optical internet. Journal High Speed Networks 8, 69–84 (1999)
Turner, J.: Terabit burst switching. Journal High Speed Networks 8, 3–16 (1999)
Xiong, Y., Vandenhoute, M., Cankaya, H.C.: Control architecture in optical burst-switched wdm networks. IEEE Journal On Selected Areas in Communications 18, 1838–1851 (2000)
Xu, J., Qiao, C., Li, J., Xu, G.: Efficient channel scheduling algorithms in optical burst switched networks. In: INFOCOM 2003, 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Francisco (March 2003)
Yoo, M., Qiao, C.: A high speed protocol for bursty traffic in optical networks. SPIE’s All-Optical Communication Systems:Architecture, Control and Protocol Issues 3230, 79–90 (1997)
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
Chen, Z., Singh, V., Xu, J. (2004). Efficient Job Scheduling Algorithms with Multi-type Contentions. In: Fleischer, R., Trippen, G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30551-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-30551-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24131-7
Online ISBN: 978-3-540-30551-4
eBook Packages: Computer ScienceComputer Science (R0)