Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Efficient Synchronization under Global EDF Scheduling on Multiprocessors
 

Summary: Efficient Synchronization under Global EDF Scheduling on
Multiprocessors
UmaMaheswari C. Devi, Hennadiy Leontyev, and James H. Anderson
Department of Computer Science, The University of North Carolina at Chapel Hill
Abstract
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 con-
sidering simple shared objects, such as queues, stacks, and linked
lists. In many applications, the predominate use of synchroniza-
tion 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 Introduction
In work on real-time systems, multiprocessor platforms (SMPs)
are of growing importance. This is due to both hardware trends
such as the emergence of multicore technologies and the preva-
lence of computationally-intensive applications for which single-

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences