Multiprocessor feasibility analysis of recurrent task systems with specified processor affinities

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2013, Pages 160-169

  Baruah, Sanjoy ^a   Brandenburg, Björn ^b  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84894334341     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2013.24     Document Type: Conference Paper

References (15)

1. S. Baruah. Feasibility analysis of preemptive real-time systems upon heterogeneous multiprocessor platforms. In Proceedings of the 25th IEEE Real-Time Systems Symposium, RTSS 2004, pages 37-46, Lisbon, Portugal, December 2004. IEEE Computer Society Press.
2. G. B. Dantzig. Linear Programming and Extensions. Princeton University Press, 1963.
3. A. Foong, J. Fung, and D. Newell. An in-depth analysis of the impact of processor affinity on network performance. In Proceedings of the 12th IEEE Conference on Networks, ICON 2004, pages 244-250, 2004.
4. A. Gujarati, F. Cerqueira, and B. Brandenburg. Schedulability analysis of the Linux Push and Pull Scheduler with arbitrary processor affinities. In Proceedings of the 2013 25th Euromicro Conference on Real-Time Systems, ECRTS '13, Paris (France), 2013. IEEE Computer Society Press.
5. P. Hall. On representation of subsets. Journal of the London Mathematical Society, 10:26-30, 1935.
6. N. Karmakar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373-395, 1984.
7. L. Khachiyan. A polynomial algorithm in linear programming. Dokklady Akademiia Nauk SSSR, 244:1093-1096, 1979.
8. E. Lawler and J. Labetoulle. On preemptive scheduling of unrelated parallel processors by linear programming. Journal of the ACM, 25(4):612-619, Oct. 1978.
9. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 20(1):46-61, 1973.
10. A. Mok. Task management techniques for enforcing ED scheduling on a periodic task set. In Proceedings of the 5th IEEE Workshop on Real-Time Software and Operating Systems, pages 42-46, Washington D.C., May 1988.
11. G. Nelissen and J. Goossens. A counter-example to: Sticky-ERfair: a task-processor affinity aware proportional fair scheduler. Real-Time Systems, 47(4):378-381, July 2011.
12. V. Salmani, M. Naghibzadeh, and M. Kahani. Deadline scheduling with processor affinity and feasibility check on uniform parallel machines. In Proceedings of the 7th IEEE International Conference on Computer and Information Technology, CIT 2007, pages 793-798, 2007.
13. A. Sarkar, S. Ghose, and P. P. Chakrabarti. Sticky-ERfair: a taskprocessor affinity aware proportional fair scheduler. Real-Time Systems, 47(4):356-377, July 2011.
14. A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, 1986.
15. D. B. West. Introduction to Graph Theory (2nd Edition). Prenctice Hall, 2001.