Fixed priority scheduling of periodic task sets with arbitrary deadlines Export

@inproceedings{lehockzy90deadlines, abstract = {Consideration is given to the problem of fixed priority scheduling of period tasks with arbitrary deadlines. A general criterion for the schedulability of such a task set is given. Worst case bounds are given which generalize the C.L. Liu and J.W. Layland (1973) bound. The results are shown to provide a basis for developing predictable distributed real-time systems}, author = {Lehoczky, J. P.}, booktitle = {Proceedings of the 11th Real-Time Systems Symposium}, citeulike-article-id = {4872018}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/REAL.1990.128748}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=128748}, doi = {10.1109/REAL.1990.128748}, journal = {Proceedings of the 11th Real-Time Systems Symposium}, keywords = {fixed-priority, scheduling}, pages = {201--209}, posted-at = {2009-06-16 17:09:03}, priority = {2}, title = {Fixed priority scheduling of periodic task sets with arbitrary deadlines}, url = {http://dx.doi.org/10.1109/REAL.1990.128748}, year = {1990} }

TY - CONF ID - lehockzy90deadlines L3 - citeulike-article-id:4872018 N2 - Consideration is given to the problem of fixed priority scheduling of period tasks with arbitrary deadlines. A general criterion for the schedulability of such a task set is given. Worst case bounds are given which generalize the C.L. Liu and J.W. Layland (1973) bound. The results are shown to provide a basis for developing predictable distributed real-time systems JF - Proceedings of the 11th Real-Time Systems Symposium EP - 209 TI - Fixed priority scheduling of periodic task sets with arbitrary deadlines T2 - Proceedings of the 11th Real-Time Systems Symposium SP - 201 KW - fixed-priority KW - scheduling AU - Lehoczky, JP PY - 1990/// UR - http://dx.doi.org/10.1109/REAL.1990.128748 ER -