Stack-based scheduling for realtime processes
Real-Time Systems
Real-time computing with lock-free shared objects
ACM Transactions on Computer Systems (TOCS)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Fast scheduling of periodic tasks on multiple resources
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Object Sharing in Pfair-scheduled Multiprocessor Systems
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Pfair scheduling: beyond periodic task systems
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
A framework for implementing objects and scheduling tasks in lock-free real-time systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Locking in Pfair-Scheduled Multiprocessor Systems
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Guaranteeing Pfair Supertasks by Reweighting
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Resource Sharing in Reservation-Based Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Aperiodic Servers with Resource Constraints
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
A Bandwidth Inheritance Algorithm for Real-Time Task Synchronization in Open Systems
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
A lock-free approach to object sharing in real-time systems
A lock-free approach to object sharing in real-time systems
Implementing Pfairness on a Symmetric Multiprocessor
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
On the implementation of pfair-scheduled multiprocessor systems
On the implementation of pfair-scheduled multiprocessor systems
Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Locking under Pfair scheduling
ACM Transactions on Computer Systems (TOCS)
On Scalable Synchronization for Distributed Embedded Real-Time Systems
SEUS '08 Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems
Response time analysis of software transactional memory-based distributed real-time systems
Proceedings of the 2009 ACM symposium on Applied Computing
Proceedings of the Conference on Design, Automation and Test in Europe
Hi-index | 0.00 |
We consider the use of lock-free techniques for implementing shared objects in real-time Pfair-scheduled multiprocessor systems. Lock-free objects are more economical than locking techniques when implementing relatively simple objects such as buffers, stacks, queues, and lists. However, the use of such objects on real-time multiprocessors is generally considered impractical due to the need for analytical real-time guarantees. In this paper, we explain how the quantum-based nature of Pfair scheduling enables the effective use of such objects on real-time multiprocessors and present analysis specific to Pfair-scheduled systems. In addition, we show that analytical improvements can be obtained by using such objects in conjunction with group-based scheduling techniques. In this approach, a group of tasks is scheduled as a single entity (called a supertask in the Pfair literature). Such grouping prevents tasks from executing simultaneously, and hence from executing in parallel. Consequently, grouping tasks can improve the worst-case scenario with respect to object contention. Grouping also enables the use of less costly uniprocessor algorithms when all tasks sharing an object reside within the same group. We illustrate these optimizations with a case study that focuses on shared queues. Finally, we present and experimentally evaluate a simple heuristic for grouping tasks in order to reduce object contention. Though the analysis presented herein focuses specifically on Pfair-scheduled systems, the observations and techniques should be applicable to other quantum-scheduled systems as well.