Fast scheduling of periodic tasks on multiple resources (1995) [83 citations — 13 self]
Download:
|
|
by Sanjoy K. Baruah, Johannes E. Gehrke, C. Greg Plaxton
In Proceedings of the 9th International Parallel Processing Symposium
http://www.cs.cornell.edu/johannes/papers/tr95-02.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Baruah95fastscheduling,author = {Sanjoy K. Baruah and Johannes E. Gehrke and C. Greg Plaxton},
title = {Fast scheduling of periodic tasks on multiple resources},
booktitle = {In Proceedings of the 9th International Parallel Processing Symposium},
year = {1995},
pages = {280--288}
}
Years of Citing Articles
Abstract:
Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of the periodic scheduling problem, and runs in O(minfm lg n; ng) time per slot scheduled. 1
Citations
| 2168 | Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment – Liu, Layland - 1973 |
| 281 | Expected time bounds for selection – Floyd, Rivest - 1975 |
| 140 | Proportionate progress: A notion of fairness in resource allocation – Baruah, Cohen, et al. - 1996 |
| 89 | Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor – Baruah, Rosier, et al. - 1990 |
| 52 | Some simple scheduling algorithms – Horn - 1974 |
| 27 | Scheduling algorithms for multiprocessors in a hard real-time environment – Liu - 1969 |
| 1 | Programs Summary 37--60, vol – Space - 1969 |
