Optimal rate-based scheduling on multiprocessors
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal Quantization of Periodic Task Requests on Multiple Identical Processors
IEEE Transactions on Parallel and Distributed Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
Journal of Computer and System Sciences
Real-Time Systems
The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors
Real-Time Systems
Locking under Pfair scheduling
ACM Transactions on Computer Systems (TOCS)
Supporting lock-free synchronization in Pfair-scheduled real-time systems
Journal of Parallel and Distributed Computing
Adapting Pfair scheduling for symmetric multiprocessors
Journal of Embedded Computing - Cache exploitation in embedded systems
Push-assisted migration of real-time tasks in multi-core processors
Proceedings of the 2009 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Predictable task migration for locked caches in multi-core systems
Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
A technique to reduce preemption overhead in real-time multiprocessor task scheduling
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
What to make of multicore processors for reliable real-time systems?
Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
Exploring the design space of multiprocessor synchronization protocols for real-time systems
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
Abstract: In this paper, we prove that a simplified variant of the PD Pfair algorithm, called PD2, is optimal for scheduling any mix of early-release and non-early-release asynchronous tasks on a multiprocessor. This result breaks new ground by incorporating both early-release and non-early-release tasks under a common framework. In addition, all prior work on optimal multiprocessor Pfair scheduling algorithms has been limited to synchronous periodic task systems.