Tardiness bounds under global EDF scheduling on a multiprocessor
Real-Time Systems
LFTHREADS: a lock-free thread library
ACM SIGARCH Computer Architecture News
System level performance analysis for real-time automotive multicore and network architectures
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Overview of Multicore Requirements towards Real-Time Communication
SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
Lock-free synchronization for dynamic embedded real-time systems
ACM Transactions on Embedded Computing Systems (TECS)
Generalized tardiness bounds for global multiprocessor scheduling
Real-Time Systems
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
LFTHREADS: a lock-free thread library
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Proceedings of the Conference on Design, Automation and Test in Europe
Partitioning real-time systems on multiprocessors with shared resources
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Sharing resources among independently-developed systems on multi-cores
ACM SIGBED Review
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
STM concurrency control for embedded real-time software with tighter time bounds
Proceedings of the 49th Annual Design Automation Conference
STM concurrency control for multicore embedded real-time software: time bounds and tradeoffs
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
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 lockfree algorithms.