Stack-based scheduling for realtime processes
Real-Time Systems
The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments
IEEE Transactions on Computers
Allocating fixed-priority periodic tasks on multiprocessor systems
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
High Performance Cluster Computing: Programming and Applications
High Performance Cluster Computing: Programming and Applications
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
Scheduling algorithms for distributed Web servers
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments
ICECCS '97 Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems
| Hi-index | 0.00 |
This paper presents an algorithm to schedule aperiodic jobs on a cluster system. A cluster consists of one dispatcher and multiple schedulers. The algorithm is optimal for the response time of each aperiodic job. Aperiodic jobs are partitioned into phases and assigned deadlines by the dispatcher. With the deadline, the aperiodic jobs can be scheduled uniformly under EDF (Earliest Deadline First) together with periodic jobs. With rigorous theoretical analysis and proof, we have that even if the dispatcher has no scheduling information, the algorithm can still dispatch the aperiodic jobs onto the proper scheduler to achieve optimal response time and also guarantee the deadline requirements of periodic jobs.