Locking under Pfair scheduling

We present several locking synchronization protocols for Pfair-scheduled multiprocessor systems. We focus on two classes of protocols. The first class is only applicable in systems in which all critical sections are short relative to the length of the scheduling quantum. In this case, efficient synchronization can be achieved by ensuring that all locks have been released before tasks are preempted. This is accomplished by exploiting the quantum-based nature of Pfair scheduling, which provides a priori knowledge of all possible preemption points. The second and more general protocol class is applicable to any system. For this class, we consider the use of a client-server model. We also discuss the viability of inheritance-based protocols in Pfair-scheduled systems.

[1]  Theodore P. Baker,et al.  Stack-based scheduling of realtime processes , 1991, Real-Time Systems.

[2]  Luca Abeni,et al.  Resource sharing in reservation-based systems , 2001, Proceedings Seventh IEEE Real-Time Technology and Applications Symposium.

[3]  James H. Anderson,et al.  A lock-free approach to object sharing in real-time systems , 1997 .

[4]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[5]  Mark Moir,et al.  Pfair scheduling of fixed and migrating periodic tasks on multiple resources , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[6]  James H. Anderson,et al.  Pfair scheduling: beyond periodic task systems , 2000, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications.

[7]  James H. Anderson,et al.  On the implementation of pfair-scheduled multiprocessor systems , 2004 .

[8]  James H. Anderson,et al.  Efficient scheduling of soft real-time applications on multiprocessors , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[9]  James H. Anderson,et al.  Mixed Pfair/ERfair scheduling of asynchronous periodic tasks , 2001, Proceedings 13th Euromicro Conference on Real-Time Systems.

[10]  Giuseppe Lipari,et al.  Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[11]  Giuseppe Lipari,et al.  A bandwidth inheritance algorithm for real-time task synchronization in open systems , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[12]  James H. Anderson,et al.  Locking in pfair-scheduled multiprocessor systems , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[13]  James H. Anderson,et al.  Object sharing in Pfair-scheduled multiprocessor systems , 2002, Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002.

[14]  Ragunathan Rajkumar,et al.  Synchronization in Real-Time Systems: A Priority Inheritance Approach , 1991 .

[15]  R. Rajkumar.  Real-time synchronization protocols for shared memory multiprocessors , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[16]  Prashant J. Shenoy,et al.  Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors , 2000, OSDI.

[17]  James H. Anderson,et al.  Optimal rate-based scheduling on multiprocessors , 2002, STOC '02.

[18]  James H. Anderson,et al.  Fair scheduling of dynamic task systems on multiprocessors , 2005, J. Syst. Softw..

[19]  James H. Anderson,et al.  Fine-grained task reweighting on multiprocessors , 2005, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05).

[20]  Lui Sha,et al.  Real-time synchronization protocols for multiprocessors , 1988, Proceedings. Real-Time Systems Symposium.

[21]  James H. Anderson,et al.  Supporting Lock-free Synchronization in Pfair-scheduled Systems ? , 2004 .

[22]  Sanjoy K. Baruah,et al.  Fast scheduling of periodic tasks on multiple resources , 1995, Proceedings of 9th International Parallel Processing Symposium.

[23]  Marco Caccamo,et al.  Aperiodic servers with resource constraints , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[24]  James H. Anderson,et al.  Early-release fair scheduling , 2000, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000.

[25]  James H. Anderson,et al.  Supporting lock-free synchronization in Pfair-scheduled real-time systems , 2006, J. Parallel Distributed Comput..

[26]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[27]  Ozalp Babaoglu,et al.  ACM Transactions on Computer Systems , 2007 .

[28]  James H. Anderson,et al.  Real-time computing with lock-free shared objects , 1997, TOCS.

[29]  James H. Anderson,et al.  Quick-release fair scheduling , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[30]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.