The periodic polytope and its applications to a scheduling problem - A Static Perspective
| dc.contributor.author | Subramani, K. | en_US |
| dc.contributor.author | Agrawala, A. | en_US |
| dc.date.accessioned | 2004-05-31T23:03:39Z | |
| dc.date.available | 2004-05-31T23:03:39Z | |
| dc.date.created | 2000-05 | en_US |
| dc.date.issued | 2000-05-09 | en_US |
| dc.description.abstract | Parameter variability and the existence of complex constraints between tasks are assured features of real-time scheduling. {\em Periodicity} of task sets is an additional feature that needs to be accomodated. Traditional scheduling models ignore the complexities involved in real-time scheduling by making simplistic assumptions about task interactions. In this paper, we present a model that captures the issues that we deem central to real-time scheduling in periodic task sets and demonstrate the existence of efficient and easily implementable algorithms for addressing schedulability queries in this model. Our model is very general and applicable to diverse areas ranging from real-time process scheduling in operating systems and avionics to manufacturing and traffic control. (Also cross-referenced as UMIACS-TR-2000-25) | en_US |
| dc.format.extent | 198850 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/1070 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-4132 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-2000-25 | en_US |
| dc.title | The periodic polytope and its applications to a scheduling problem - A Static Perspective | en_US |
| dc.type | Technical Report | en_US |