Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Evaluation of Process Scheduling Mechanism for a Web Server Based on Its Behavior while Executing
APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling
IEEE Transactions on Computers
Real-time Scheduling in Heterogeneous Dual-core Architectures
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 2
Practical algorithms for scheduling video data in a local area network environment
The Journal of Supercomputing
Efficient scheduling for periodic aggregation queries in multihop sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
The deadline of a request is the time instant at which its execution must complete. The deadline of the request in any period of a job with deferred deadline is some time instant after the end of the period. The authors describe a semi-static priority-driven algorithm for scheduling periodic jobs with deferred deadlines: each job is assigned two priorities, the higher one for old requests and the lower one for the current request. This algorithm is called the modified rate-monotonic algorithm and is based on the well-known rate-monotonic algorithm. It is shown that the modified rate-monotonic algorithm is optimal when the deadline of every job is deferred by max (1, gamma -1) periods or more, where gamma is the ratio between the longest period and the shortest period. When the deadline of each job is deferred by one period of the job, any set of n independent jobs whose total utilization is equal to or less than (1+n(2/sup 1/n/-1))/2 can be feasibly scheduled by this algorithm. This bound approaches 0.845 when n approaches infinity.