Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Anomalous behavior in bin packing algorithms
Discrete Applied Mathematics
Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
On-Line Scheduling of Real-Time Tasks
IEEE Transactions on Computers
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)
Deadline-based scheduling of periodic task systems on multiprocessors
Information Processing Letters
Utilization Bounds for Multiprocessor Rate-Monotonic Scheduling
Real-Time Systems
Partitioned Aperiodic Scheduling on Multiprocessors
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A Hyperbolic Bound for the Rate Monotonic Algorithm
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling
IEEE Transactions on Computers
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Multiprocessor fixed-priority scheduling with restricted interprocessor migrations
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
How Hard is Partitioning for the Sporadic Task Model?
ICPPW '09 Proceedings of the 2009 International Conference on Parallel Processing Workshops
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
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling
Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
The Art of Computer Programming: Combinatorial Algorithms, Part 1
The Art of Computer Programming: Combinatorial Algorithms, Part 1
Hi-index | 0.00 |
In this work, we consider the scheduling of real-time periodic tasks on multiprocessors under a restricted-migration constraint (tasks are allowed to migrate whereas jobs are not). We first propose a technique, (offline) job partitioning, which statically assigns jobs to processors before execution. We show that (offline) job partitioning strictly dominates both partitioned and restricted-migration scheduling. We then consider r-RM, a restricted-migration variant of global RM, we design a sufficient schedulability test and we provide a speedup factor for the scheduler.