SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analysis of task migration in shared-memory multiprocessor scheduling
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Benefits of cache-affinity scheduling in shared-memory multiprocessors: a summary
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Using Processor-Cache Affinity Information in Shared-Memory Multiprocessor Scheduling
IEEE Transactions on Parallel and Distributed Systems
Fast scheduling of periodic tasks on multiple resources
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Rate-Based Resource Allocation Models for Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
A Theory of Rate-Based Execution
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
The Case for Fair Multiprocessor Scheduling
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
On-Line Scheduling on Uniform Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Accurate estimation of cache-related preemption delay
Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
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
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
Journal of Scheduling
StatCache: a probabilistic approach to efficient and accurate data locality analysis
ISPASS '04 Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software
The Partitioned Multiprocessor Scheduling of Deadline-Constrained Sporadic Task Systems
IEEE Transactions on Computers
Accuracy versus Migration Overhead in Real-Time Multiprocessor Reweighting Algorithms
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Multiprocessor Scheduling with Few Preemptions
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Sporadic Multiprocessor Scheduling with Few Preemptions
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Work-Conserving Optimal Real-Time Scheduling on Multiprocessors
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
| Hi-index | 0.00 |
A drawback of current proportional fair schedulers is that they ignore task-to-processor mutual affinities, thereby causing frequent inter-processor task migrations and cache misses. This paper presents the Sticky-ERfair Scheduler, an Early-Release Fair (ERfair) scheduler that attempts to minimize task migrations and preemptions. Given any processor V i , Sticky-ERfair allocates to it the most recently executed ready task that previously executed on V i (thus restricting migrations and preemptions) in such a way that this allocation does not cause any ERfairness violations in the system at any time during the schedule length. Experimental results reveal that Sticky-ERfair can achieve upto over 40 times reduction both in the number of migrations and preemptions suffered with respect to Basic-ERfair (for a set of 25 to 100 tasks running on 2 to 10 processors) while simultaneously guaranteeing ERfairness at each time slot.