On-line scheduling in the presence of overload

S. Baruah, G. Koren, Bhubaneswar Mishra, A. Raghunathan, L. Rosier, Dennis Shasha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The preemptive scheduling of sporadic tasks on a uniprocessor is considered. A task may arrive at any time, and is characterized by a value that reflects its importance, an execution time that is the amount of processor time needed to completely execute the task, and a deadline by which the task is to complete execution. The goal is to maximize the sum of the values of the completed tasks. An online scheduling algorithm that achieves optimal performance when the system is underloaded and provides a nontrivial performance guarantee when the system is overloaded is designed. The algorithm is implemented using simple data structures to run at a cost of O(log n) time per task, where n bounds the number of tasks in the system at any instant. Upper bounds on the best performance guarantee obtainable by an online algorithm in a variety of settings are derived.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherPubl by IEEE
Pages100-110
Number of pages11
ISBN (Print)0818624450
StatePublished - Dec 1991
EventProceedings of the 32nd Annual Symposium on Foundations of Computer Science - San Juan, PR, USA
Duration: Oct 1 1991Oct 4 1991

Other

OtherProceedings of the 32nd Annual Symposium on Foundations of Computer Science
CitySan Juan, PR, USA
Period10/1/9110/4/91

Fingerprint

Scheduling
Scheduling algorithms
Data structures
Costs

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Baruah, S., Koren, G., Mishra, B., Raghunathan, A., Rosier, L., & Shasha, D. (1991). On-line scheduling in the presence of overload. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 100-110). Publ by IEEE.

On-line scheduling in the presence of overload. / Baruah, S.; Koren, G.; Mishra, Bhubaneswar; Raghunathan, A.; Rosier, L.; Shasha, Dennis.

Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, 1991. p. 100-110.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Baruah, S, Koren, G, Mishra, B, Raghunathan, A, Rosier, L & Shasha, D 1991, On-line scheduling in the presence of overload. in Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, pp. 100-110, Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, San Juan, PR, USA, 10/1/91.
Baruah S, Koren G, Mishra B, Raghunathan A, Rosier L, Shasha D. On-line scheduling in the presence of overload. In Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE. 1991. p. 100-110
Baruah, S. ; Koren, G. ; Mishra, Bhubaneswar ; Raghunathan, A. ; Rosier, L. ; Shasha, Dennis. / On-line scheduling in the presence of overload. Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, 1991. pp. 100-110
@inproceedings{274add03672545b081d1dc1b2d9f903f,
title = "On-line scheduling in the presence of overload",
abstract = "The preemptive scheduling of sporadic tasks on a uniprocessor is considered. A task may arrive at any time, and is characterized by a value that reflects its importance, an execution time that is the amount of processor time needed to completely execute the task, and a deadline by which the task is to complete execution. The goal is to maximize the sum of the values of the completed tasks. An online scheduling algorithm that achieves optimal performance when the system is underloaded and provides a nontrivial performance guarantee when the system is overloaded is designed. The algorithm is implemented using simple data structures to run at a cost of O(log n) time per task, where n bounds the number of tasks in the system at any instant. Upper bounds on the best performance guarantee obtainable by an online algorithm in a variety of settings are derived.",
author = "S. Baruah and G. Koren and Bhubaneswar Mishra and A. Raghunathan and L. Rosier and Dennis Shasha",
year = "1991",
month = "12",
language = "English (US)",
isbn = "0818624450",
pages = "100--110",
booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - On-line scheduling in the presence of overload

AU - Baruah, S.

AU - Koren, G.

AU - Mishra, Bhubaneswar

AU - Raghunathan, A.

AU - Rosier, L.

AU - Shasha, Dennis

PY - 1991/12

Y1 - 1991/12

N2 - The preemptive scheduling of sporadic tasks on a uniprocessor is considered. A task may arrive at any time, and is characterized by a value that reflects its importance, an execution time that is the amount of processor time needed to completely execute the task, and a deadline by which the task is to complete execution. The goal is to maximize the sum of the values of the completed tasks. An online scheduling algorithm that achieves optimal performance when the system is underloaded and provides a nontrivial performance guarantee when the system is overloaded is designed. The algorithm is implemented using simple data structures to run at a cost of O(log n) time per task, where n bounds the number of tasks in the system at any instant. Upper bounds on the best performance guarantee obtainable by an online algorithm in a variety of settings are derived.

AB - The preemptive scheduling of sporadic tasks on a uniprocessor is considered. A task may arrive at any time, and is characterized by a value that reflects its importance, an execution time that is the amount of processor time needed to completely execute the task, and a deadline by which the task is to complete execution. The goal is to maximize the sum of the values of the completed tasks. An online scheduling algorithm that achieves optimal performance when the system is underloaded and provides a nontrivial performance guarantee when the system is overloaded is designed. The algorithm is implemented using simple data structures to run at a cost of O(log n) time per task, where n bounds the number of tasks in the system at any instant. Upper bounds on the best performance guarantee obtainable by an online algorithm in a variety of settings are derived.

UR - http://www.scopus.com/inward/record.url?scp=0026383255&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026383255&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818624450

SP - 100

EP - 110

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - Publ by IEEE

ER -