IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Parallel and Distributed 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)
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
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 proportional share resource allocation algorithm for real-time, time-shared 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
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
Optimizing the migration of virtual computers
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On-Line Scheduling on Uniform Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
Journal of Computer and System Sciences
Supporting Dynamic QoS in Linux
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Fair scheduling of dynamic task systems on multiprocessors
Journal of Systems and Software - Special issue: Parallel and distributed real-time systems
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
Journal of Scheduling
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
Frame-Based Proportional Round-Robin
IEEE Transactions on Computers
Multiprocessor fixed-priority scheduling with restricted interprocessor migrations
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
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
Future Generation Computer Systems
| Hi-index | 0.00 |
Proportionate fair schedulers provide an effective methodology for scheduling recurrent real-time tasks on multiprocessors. However, a drawback in these schedulers is that they ignore a task's affinity towards the processor where it was executed last, causing frequent inter-processor task migrations which ultimately results in increased execution times. This paper presents Partition Oriented Frame Based Fair Scheduler (POFBFS), an efficient proportional fair scheduler for periodic firm and soft real-time tasks that ensures a bounded number of task migrations. Experimental results reveal that POFBFS can achieve 3 to 100 times reduction in the number of migrations suffered with respect to the General-ERfair algorithm (for a set of 25 to 100 tasks running on 2 to 8 processors) while simultaneously maintaining high fairness accuracy.