Abstract
The following scheduling problem is studied: We are given a set of tasks with release times, deadlines, and profit rates. The objective is to determine a 1-processor preemptive schedule of the given tasks that maximizes the overall profit. In the standard model, each completed task brings profit, while non-completed tasks do not. In the metered model, a task brings profit proportional to the execution time even if not completed. For the metered task model, we present an efficient offline algorithm and improve both the lower and upper bounds on the competitive ratio of online algorithms. Furthermore, we prove three lower bound results concerning resource augmentation in both models.
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.
Similar content being viewed by others
References
Sanjoy Baruah, Gilad Koren, Decao Mao, Bud Mishra, Arvind Raghunathan, Louis Rosier, Dennis Shasha, and Fuxing Wang. On the competitiveness of on-line realtime task scheduling. Real-Time Systems, 4:125–144, 1992.
Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
Ee-Chien Chang and Chee Yap. Competitive online scheduling with level of service. In Proc. 7th Annual International Computing and Combinatorics Conference, volume 2108 of Lecture Notes in Computer Science, pages 453–462. Springer, 2001.
Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):214–221, 2000.
Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan, and Kar-Keung To. On-line scheduling with tight deadlines. In Proc. 26th Symp. on Mathematical Foundations of Computer Science, volume 2136 of Lecture Notes in Computer Science, pages 464–473, 2001.
G. Koren and D. Shasha. d over: an optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM Journal on Computing, 24:318–339, 1995.
Tak-Wah Lam, Tsuen-Wan Ngan, and Ker-Keung To. On the speed requirement for optimal deadline scheduling in overloaded systems. In Proc. 15th International Parallel and Distributed Processing Symposium, page 202, 2001.
Tak-Wah Lam and Ker-Keung To. Trade-offs between speed and processor in hard-deadline scheduling. In Proc. 10th Symp. on Discrete Algorithms, pages 755–764, 1999.
Jiří Sgall. Online scheduling. In Online Algorithms: The State of Art, pages 196–227. Springer-Verlag, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chrobak, M. et al. (2002). Preemptive Scheduling in Overloaded Systems. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_68
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_68
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive