Locking under pfair scheduling

ACM Transactions on Computer Systems

Volumn 24, Issue 2, 2006, Pages 140-174

  Holman, Philip ^a,b   Anderson, James H ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b Brooks Computer Science Building   (United States)

Author keywords

Locking; Multiprocessor; Pfairness; Real time; Scheduling; Semaphore; Supertask; Synchronization

Indexed keywords

LOCKING; PFAIRNESS; SEMAPHORE; SUPERTASK;

CLIENT SERVER COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; QUANTUM THEORY; SYNCHRONIZATION;

SCHEDULING;

EID: 33745187321     PISSN: 07342071     EISSN: 07342071     Source Type: Journal    
DOI: 10.1145/1132026.1132028     Document Type: Article

References (31)

1. ANDERSON, J., BLOCK, A., AND SRINIVASAN, A. 2003. Quick-release fair scheduling. In Proceedings of the 24th IEEE Real-time Systems Symposium. 130-141.
2. ANDERSON, J., RAMAMURTHY, S., AND JEFFAY, K. 1997. Real-time computing with lock-free objects. ACM Trans. Comput. Syst. 15, 6 (May), 388-395.
3. ANDERSON, J. AND SRINIVASAN, A. 2000a. Early-release fair scheduling. In Proceedings of the 12th Euromicro Conference on Real-time Systems. 35-43.
4. ANDERSON, J. AND SRINIVASAN, A. 2000b. Pfair scheduling: Beyond periodic task systems. In Proceedings of the Seventh International Conference on Real-time Computing Systems and Applications. 297-306.
5. ANDERSON, J. AND SHINIVASAN, A. 2001. Mixed Pfair/ERfair scheduling of asynchronous periodic tasks. In Proceedings of the 13th Euromicro Conference on Real-time Systems. 76-85.
6. BAKER, T. 1991. Stack-based scheduling of real-time processes. Real-time Syst. 3, 1 (Mar.), 67-99.
7. BARUAH, S., COHEN, N., PLAXTON, C., AND VARVEL, D. 1996. Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15, 600-625.
8. BARUAH, S., GEHRKE, J., AND PLAXTON, C. G. 1995. Fast scheduling of periodic tasks on multiple resources. In Proceedings of the 9th International Parallel Processing Symposium. 280-288.
9. BLOCK, A., ANDERSON, J., AND BISHOP, G. 2005. Fine-grained task reweighting on multiprocessors. In Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, August, 429-435.
10. CACCAMO, M. AND SHA, L. 2001. Aperiodic servers with resource constraints. In Proceedings of the 22nd IEEE Real-time Systems Symposium. 161-170.
11. CHANDHA, A., ADLER, M., GOYAL, P., AND SHENOY, P. 2000. Surplus fair scheduling: A proportional-share cpu scheduling algorithm for symmetric multiprocessors. In Proceedings of the Fourth Symposium on Operating System Design and Implementation.
12. DE NIZ, D., ABENI, L., SAEWONG, S., AND RAJKUMAR, R. 2001. Resource sharing in reservation-based systems. In Proceedings of the 22nd IEEE Real-time Systems Symposium. 171-180.
13. GAI, P., LIPARI, G., AND DI NATALE, M. 2001. Minimizing memory utilization of real-time task sets in single and multi-process or systems-on-a-chip. In Proceedings of the 22nd IEEE Real-time Systems Symposium. 73-83.
14. HOLMAN, P. 2004. On the implementation of Pfair-scheduled multiprocessor systems. Ph.D. thesis, University of North Carolina at Chapel Hill.
15. HOLMAN, P. AND ANDERSON, J. 2002a. Locking in Pfair-scheduled multiprocessor systems. In Proceedings of the 23rd IEEE Real-time Systems Symposium. 149-158.
16. HOLMAN, P. AND ANDERSON, J. 2002b. Object sharing in Pfair-scheduled multiprocessor systems. In Proceedings of the 14th Euromicro Conference on Real-time Systems. 111-120.
17. HOLMAN, P. AND ANDERSON, J. 2003. Using hierarchal scheduling to improve resource utilization in multiprocessor real-time systems. In Proceedings of the 15th Euromicro Conference on Real-time Systems. 41-50.
18. HOLMAN, P. AND ANDERSON, J. 2005. Supporting lock-free synchronization in Pfair-scheduled systems. J. Parallel Distrib. Comput. 66, 1 (January), 47-67.
19. LAMASTRA.G., LIPARI, G., AND ABENI, L. 2001. A bandwidth inheritance algorithm for real-time task synchronization in open systems. In. Proceedings of the 22nd IEEE Real-time Systems Symposium. 151-160.
20. LIU, C. AND LAYLAND, J. 1973. Scheduling algorithms for multiprogramming in a hard real-time environment. J. ACM 30, 46-61.
21. LYNX REAL-TIME SYSTEMS. 1993. LynxOS application writer's guide. Lynx Real-time Systems, Inc.
22. MOIR, M. AND RAMAMURTHY, S. 1999. Pfair scheduling of fixed and migrating periodic tasks on multiple resources. In Proceedings of the Twentieth IEEE Real-time Systems Symposium. 294-303.
23. MOK, A. 1983. Fundamental design problems for the hard real-time environment. Ph.D. thesis, Massachusetts Institute of Technology.
24. RAJKUMAR, R. 1990. Real-time synchronization protocols for shared memory multiprocessors. In Proceedings of the International Conference on Distributed Computing Systems. 116-123.
25. RAJKUMAR, R. 1991. Synchronization in real-time systems-A priority inheritance approach. Kluwer Academic Publishers, Boston, Mass.
26. RAJKUMAR, R., SHA, L., AND LEHOCZKY, J. 1988. Real-time synchronization protocols for multiprocessors. In Proceedings of the Ninth IEEE Real-time Systems Symposium. 259-269.
27. RAMAMURTHY, S. 1997. A lock-free approach to object sharing in real-time systems. Ph.D. thesis, University of North Carolina at Chapel Hill.
28. SHA, L., RAJKUMAR, R., AND LEHOCZKY, J. 1990. Priority inheritance protocols: An approach to real-time system synchronization. IEEE Trans. Comput. 39, 9, 1175-1185.
29. SRINIVASAN, A. AND ANDERSON, J. 2002. Optimal rate-based scheduling on multiprocessors. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. 189-198.
30. SRINIVASAN, A. AND ANDERSON, J. 2003a. Efficient scheduling of soft real-time applications on multiprocessors. In Proceedings of the 15th Euromicro Conference on Real-time Systems, 51-59.
31. SRINIVASAN, A. AND ANDERSON, J. 2003b. Fair scheduling of dynamic task systems on multiprocessors. In 11th International Workshop on Parallel and Distributed Real-time Systems (on CD-ROM).