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 queuebased spin locks and a second based on lock-free algorithms.
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program perf...
In this paper we propose a synchronization protocol for resource sharing among independently-develop...
Embedded systems are widely used in the industry and are typically resource constrained, i.e., resou...
We consider coordinating accesses to shared data structures in multiprocessor real-time systems sche...
For resource-constrained embedded real-time systems, resource-efficient approaches are very importan...
In the multi-core and multiprocessor research community, considerable work has been done on real-tim...
This paper revisits lightweight synchronization under partitioned earliest-deadline first (P-EDF) sc...
We consider various techniques for implementing shared objects and for accounting for object-sharing...
We study the problem of executing a collection of independently designed and validated task systems ...
Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-mem...
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program perf...
Efficient synchronization is important for achieving good performance in parallel programs, especial...
[[abstract]]A fundamental issue that any control-based synchronization should address is how to mini...
Various approaches can be utilized upon resource locking for mutually exclusive resource access in m...
This thesis investigates aspects of synchronization and coordination in concurrent systems. In such ...
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program perf...
In this paper we propose a synchronization protocol for resource sharing among independently-develop...
Embedded systems are widely used in the industry and are typically resource constrained, i.e., resou...
We consider coordinating accesses to shared data structures in multiprocessor real-time systems sche...
For resource-constrained embedded real-time systems, resource-efficient approaches are very importan...
In the multi-core and multiprocessor research community, considerable work has been done on real-tim...
This paper revisits lightweight synchronization under partitioned earliest-deadline first (P-EDF) sc...
We consider various techniques for implementing shared objects and for accounting for object-sharing...
We study the problem of executing a collection of independently designed and validated task systems ...
Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-mem...
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program perf...
Efficient synchronization is important for achieving good performance in parallel programs, especial...
[[abstract]]A fundamental issue that any control-based synchronization should address is how to mini...
Various approaches can be utilized upon resource locking for mutually exclusive resource access in m...
This thesis investigates aspects of synchronization and coordination in concurrent systems. In such ...
Scalable busy-wait synchronization algorithms are essential for achieving good parallel program perf...
In this paper we propose a synchronization protocol for resource sharing among independently-develop...
Embedded systems are widely used in the industry and are typically resource constrained, i.e., resou...