Abstract
We consider a benefit model for on-line preemptive scheduling. In this model jobs arrive to the on-line scheduler at their release time. Each job arrives with its own execution time and its benefit function. The flow time of a job is the time that passes from its release to its completion. The benefit function specifies the benefit gained for any given flow time. A scheduler’s goal is to maximize the total gained benefit. We present a constant competitive ratio algorithm for that model in the uniprocessor case for benefit functions that do not decrease too fast.We also extend the algorithm to the multiprocessor case while maintaining constant competitiveness. The multiprocessor algorithm does not use migration, i.e., preempted jobs continue their execution on the same processor on which they were originally processed.
Supported by Air Force Contract TNDGAFOSR-86-0078, ARPA/Army contract DABT63-93-C-0038, ARO contract DAAL03-86-K-0171, NSF contract 9114440- CCR, DARPA contract N00014-J-92-1799, and a special grant from IBM.
Research supported in part by the Israel Science Foundation and by the US-Israel Binational Science Foundation (BSF).
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.
References
B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In ACM Symposium on Theory of Computing (STOC), 1999.
K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.
S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang. On the competitiveness of on-line real-time task scheduling. In IEEE Real-Time Systems Symposium, pages 106–115, 1991.
S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha. Online scheduling in the presence of overload. In 32nd IEEE Annual Symposium on Foundations of Computer Science, pages 100–110, San Juan, Puerto Rico, 1991.
J. Du, J. Y. T. Leung, and G. H. Young. Minimizing mean flow time with release time constraint. Theoretical Computer Science, 75(3):347–355, 1990.
B. Kalyanasundaram and K. Pruhs. Real-time scheduling with fault-tolerance. Technical report, Computer Science Dept. University of Pittsburgh.
G. Koren and D. Shasha. Dover: An optimal on-line scheduling algorithm for overloaded real-time systems. IEEE Real-time Systems Symposium, pages 290–299, 1992.
G. Koren and D. Shasha. MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling. Theoretical Computer Science, 128(1-2):75–97, 1994.
S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 110–119, El Paso, Texas, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Awerbuch, B., Azar, Y., Regev, O. (2000). Maximizing Job Benefits On-Line. In: Jansen, K., Khuller, S. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol 1913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44436-X_6
Download citation
DOI: https://doi.org/10.1007/3-540-44436-X_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67996-7
Online ISBN: 978-3-540-44436-7
eBook Packages: Springer Book Archive