Semi-partitioned fixed-priority scheduling on multiprocessors

Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS

Volumn , Issue , 2009, Pages 23-32

  Kato, Shinpei ^a   Yamasaki, Nobuyuki ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

PRIORITY ALGORITHMS; PRIORITY SCHEDULING; SCHEDULABILITY; SCHEDULING POLICIES; SIMULATION RESULT; SPORADIC TASK SYSTEMS;

MULTIPROCESSING SYSTEMS;

SCHEDULING ALGORITHMS;

EID: 67650272812     PISSN: 15453421     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTAS.2009.9     Document Type: Conference Paper

References (26)

1. J. Anderson, V. Bud, and U.C. Devi. An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems. In Proceedings of the Euromicro Conference on Real-Time Systems, pages 199-208, 2005.
2. B. Andersson. Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%. In Proceedings of the International Conference on Principles of Distributed Systems, pages 73-88, 2008.
3. B. Andersson, S. Baruah, and J. Jonsson. Static-priority Scheduling on Multiprocessors. In Proceedings of the IEEE Real-Time Systems Symposium, pages 193-202, 2001.
4. B. Andersson and K. Bletsas. Sporadic Multiprocessor Scheduling with Few Preemptions. In Proceedings of the Euromicro Conference on Real-Time Systems, pages 243-252, 2008.
5. B. Andersson, K. Bletsas, and S. Baruah. Scheduling Arbitrary-Deadline Sporadic Task Systems Multiprocessors. In Proceedings of the IEEE Real-Time Systems Symposium, pages 385-394, 2008.
6. B. Andersson and J. Jonsson. The Utilization Bounds of Partitioned and Pfair Static-Priority Scheduling on Multiprocessors are 50%. In Proceedings of the Euromicro Conference on Real-Time Systems, pages 33-40, 2003.
7. B. Andersson and E. Tovar. Multiprocessor Scheduling with Few Preemptions. In Proceedings of the IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pages 322-334, 2006.
8. T.P. Baker. An Analysis of Fixed-Priority Schedulability on a Multiprocessor. Real-Time Systems, 32:49-71, 2006.
9. S. Baruah, N. Cohen, C.G. Plaxton, and D. Varvel. Proportionate Progress: A Notion of Fairness in Resource Allocation. Algorithmica, 15:600-625, 1996.
10. S. Baruah, J. Gehrke, and C.G. Plaxton. Fast Scheduling of Periodic Tasks on Multiple Resources. In Proceedings of the International Parallel Processing Symposium, pages 280-288, 1995.
11. G.C. Buttazzo. HARD REAL-TIME COMPUTING SYSTEMS: Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers, 1997.
12. H. Cho, B. Ravindran, and E.D. Jensen. An Optimal Real-Time Scheduling Algorithm for Multiprocessors. In Proceedings of the IEEE Real-Time Systems Symposium, pages 101-110, 2006.
13. S. K. Dhall and C. L. Liu. On a Real-Time Scheduling Problem. Operations Research, 26:127-140, 1978.
14. N. Fisher, S. Baruah, and T. Baker. The Partitioned Multiprocessor Scheduling of Sporadic Task Systems according to Static Priorities. In Proceedings of the Euromicro Conference on Real-Time Systems, pages 118-127, 2006.
15. S. Kato and N. Yamasaki. Real-Time Scheduling with Task Splitting onMultiprocessors. In Proceedings of the IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pages 441-450, 2007.
16. S. Kato and N. Yamasaki. Portioned EDF-based Scheduling on Multiprocessors. In Proceedings of the ACM International Conference on Embedded Software, 2008.
17. S. Kato and N. Yamasaki. Portioned Static-Priority Scheduling on Multiprocessors. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2008.
18. S. Lauzac, R. Melhem, and D. Mosses. An Efficient RMS Admission Control and Its Application to Multiprocessor Scheduling. In Proceedings of the IEEE International Parallel Processing Symposium, pages 511-518, 1998.
19. J.P. Lehoczky, L. Sha, and Y. Ding. The Rate Monotonic Scheduling Algorithm: Exact Charaterization and Average Case Behavior. In Proceedings of the IEEE Real-Time Systems Symposium, pages 166-171, 1989.
20. J. Leung and J. Whitehead. On the Complexity of Fixed-Priority Scheduling of Periodic Real-Time Tasks. Performance Evaluation, Elsevier Science, 22:237-250, 1982.
21. C. L. Liu and J. W. Layland. Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment. Journal of the ACM, 20:46-61, 1973.
22. J.M. Lopez, J.L. Diaz, and D.F. Garcia. Minimum and Maximum Utilization Bounds forMultiprocessor Rate-Monotonic Scheduling. IEEE Transactions on Parallel and Distributed Systems, 28:39-68, 2004.
23. J.M. Lopez, M. Garcia, J.L. Diaz, and D.F. Garcia. Utlization Bounds forMultiprocessor Rate-Monotonic Scheduling. Real-Time Systems, 24:5-28, 2003.
24. D. Oh and T. Baker. Utlization Bounds for N-Processor Rate Monotonic Scheduling with Static Processor Assignment. Real-Time Systems, 15:183-192, 1998.
25. Y. Oh and S. Son. Allocating Fixed-Priority Periodic Tasks on Multiprocessor Systems. Real-Time Systems, 9:207-239, 1995.
26. S. Ramamurthy and M. Moir. Static-Priority Periodic Scheduling on Multiprocessors. In Proceedings of the IEEE Real-Time Systems Symposium, pages 69-78, 2000.