Locking in pfair-scheduled multiprocessor systems

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2002, Pages 149-158

  Holman, Philip ^a   Anderson, James H ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK PROTOCOLS; OPTIMIZATION; RESOURCE ALLOCATION; SCHEDULING; SERVERS; SYNCHRONIZATION;

LOCKING SYNCHRONIZATION PROTOCOLS; PFAIR-SCHEDULED MULTIPROCESSOR SYSTEMS;

MULTIPROCESSING SYSTEMS;

EID: 0036997149     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. J. Anderson and S. Ramamurthy. A framework for implementing objects and scheduling tasks in lock-free real-time systems. In Proc. of the 17th IEEE Real-Time Systems Symp., pp 92-105, 1996.
2. J. Anderson, S. Ramamurthy, and K. Jeffay. Real-time computing with lock-free objects. ACM Transactions on Computer Systems, 15(6):388-395, 1997.
3. T. Baker. Stack-based scheduling of real-time processes. Real-Time Systems, 3(1):67-99, 1991.
4. S. Baruah, N. Cohen, C.G. Plaxton, and D. Varvel. Proportionate progress: A notion of fairness in resource allocation. Algorithmica, 15:600-625, 1996.
5. S. Baruah, J. Gehrke, and C. G. Plaxton, Fast scheduling of periodic tasks on multiple resources. In Proc. of the 9th Int'l Parallel Processing Symp., pp 280-288, 1995.
6. A. Chandra, M. Adler, P. Goyal, and P. Shenoy, Surplus fair scheduling: A proportional-share cpu scheduling algorithm for symmetric multiprocessors. In Proc. of the 4th Symp. on Operating System Design and Implementation, 2000.
7. D. de Niz, L. Abeni, S. Saewong, and R. Rajkumar. Resource sharing in reservation-based systems. In Proc. of the 22nd IEEE Real-Time Systems Symp., pp 171-180, 2001.
8. P. Gai, G. Lipari, and M. di Natale. Minimizing memory utilization of real-time task sets in single and multi-process or systems-on-a-chip. In Proc. of the 22nd IEEE Real-Time Systems Symp., pp 73-83, 2001.
9. P. Holman and J. Anderson. Guaranteeing pfair supertasks by reweighting. In Proc. of the 22nd IEEE Real-time Systems Symp., pp 203-212, 2001.
10. P. Holman and J. Anderson. Object sharing in pfair-scheduled multiprocessor systems. In Proc. of the 13th Euromicro Conf. on Real-Time Systems, pp 111-122, 2002.
11. P. Holman and J. Anderson. Locking in pfair-scheduled multiprocessor systems (full version). Available at http://www.cs.unc.edu/~anderson/papers.html.
12. G. Lamastra, G. Lipari, and Luca Abeni. A bandwidth inheritance algorithm for real-time task synchronization in open systems. In Proc. of the 22nd IEEE Real-Time Systems Symp., pp 151-160, 2001.
13. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM, 30:46-61, 1973.
14. M. Caccamo and L. Sha. Aperiodic servers with resource constraints. In Proc. of the 22nd IEEE Real-Time Systems Symp., pp 161-170, 2001.
15. M. Moir and S. Ramamurthy. Pfair scheduling of fixed and migrating periodic tasks on multiple resources. In Proc. of the 20th IEEE Real-Time Systems Symp., pp 294-303, 1999.
16. R. Rajkumar. Synchronization in real-time systems - A priority inheritance approach. Kluwer, 1991.
17. R. Rajkumar, L. Sha, and J. Lehoczky. Real-time synchronization protocols for multiprocessors. In Proc. of the 9th IEEE Real-Time Systems Symp., pp. 259-269, 1988.
18. S. Ramamurthy. A lock-free approach to object sharing in real-time systems. Dissertation, University of North Carolina at Chapel Hill, 1997.
19. A. Srinivasan and J. Anderson. Optimal rate-based scheduling on multiprocessors. In Proc. of the 34th Annual ACM Symp. on Theory of Computing, pp 189-198, 2002.
20. A. Srinivasan and J. Anderson. Fair on-line scheduling of dynamic task systems on multiprocessors. In submission. 2002.