Efficient synchronization under global EDF scheduling on multiprocessors

We consider coordinating accesses to shared data structures in multiprocessor real-time systems scheduled under preemptive global EDF. To our knowledge, prior work on global EDF has focused only on systems of independent tasks. We take an initial step here towards a generic resource-sharing framework by considering simple shared objects, such as queues, stacks, and linked lists. In many applications, the predominate use of synchronization constructs is for sharing such simple objects. We analyze two synchronization methods for such objects, one based on queue-based spin locks and a second based on lock-free algorithms

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

[2]  Sanjoy K. Baruah,et al.  Proportionate progress: A notion of fairness in resource allocation , 1993, Algorithmica.

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

[4]  Theodore Johnson,et al.  A Prioritized Multiprocessor Spin Lock , 1997, IEEE Trans. Parallel Distributed Syst..

[5]  Leslie Lamport,et al.  A fast mutual exclusion algorithm , 1987, TOCS.

[6]  Satish K. Tripathi,et al.  Multiprocessor priority ceiling based protocols , 1994 .

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

[8]  Sanjoy K. Baruah,et al.  A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms , 2004, Handbook of Scheduling.

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

[10]  Yi Zhang,et al.  Integrating non-blocking synchronisation in parallel applications: performance advantages and methodologies , 2002, WOSP '02.

[11]  Victor Yodaiken,et al.  Against priority inheritance , 2004 .

[12]  Sanjoy K. Baruah,et al.  Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors , 2003, Real-Time Systems.

[13]  Yi Zhang,et al.  Evaluating the performance of non-blocking synchronization on shared-memory multiprocessors , 2001, SIGMETRICS '01.

[14]  Michael L. Scott,et al.  Algorithms for scalable synchronization on shared-memory multiprocessors , 1991, TOCS.

[15]  Giuseppe Lipari,et al.  Improved schedulability analysis of EDF on multiprocessor platforms , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

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

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

[18]  Giuseppe Lipari,et al.  An upper bound to the lateness of soft real-time tasks scheduled by EDF on multiprocessors , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[19]  Ken Sakamura,et al.  A novel approach to multiprogrammed multiprocessor synchronization for real-time kernels , 1997, Proceedings Real-Time Systems Symposium.

[20]  Theodore P. Baker,et al.  Multiprocessor EDF and deadline monotonic schedulability analysis , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[21]  Anoop Gupta,et al.  The SPLASH-2 programs: characterization and methodological considerations , 1995, ISCA.

[22]  David R. O'Hallaron.  Spark98: Sparse Matrix Kernels for Shared Memory and Message Passing Systems , 1997 .

[23]  Kang G. Shin,et al.  Semaphore Queue Priority Assignment for Real-Time Multiprocessor Synchronization , 1995, IEEE Trans. Software Eng..

[24]  James H. Anderson,et al.  Tardiness bounds under global EDF scheduling on a multiprocessor , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).