Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Optimal rate-based scheduling on multiprocessors
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Fast scheduling of periodic tasks on multiple resources
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Pfair scheduling: beyond periodic task systems
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
A proportional share resource allocation algorithm for real-time, time-shared systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Design and Evaluation of a Feedback Control EDF Scheduling Algorithm
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Whisper: a spread spectrum approach to occlusion in acoustic tracking
Whisper: a spread spectrum approach to occlusion in acoustic tracking
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
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Avoiding unbounded priority inversion in barrier protocols using gang priority management
Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems
| Hi-index | 0.00 |
We consider the problem of task reweighting in fair-scheduled multiprocessor systems wherein each task's processor share is specified using a weight. The responsiveness of a reweighting scheme can be assessed by comparing its allocations to those of an ideal scheduler that instantly reweights tasks. A reweighting scheme is fine-grained if the per-task "error" (in comparison to an ideal allocation) caused by a reweighting event is constant, and coarsegrained, otherwise. When the number of tasks N is larger than the number of processorsM, the worst-case time complexity for fine-grained reweighting, 驴(NlogN), is larger than that of coarse-grained reweighting, 驴(MlogN). In this paper, we construct two new reweighting algorithms that are hybrids of fine- and coarse-grained reweighting that have time complexity less than 驴(NlogN), and produce less error than current coarse-grained techniques. We also present experiments to compare relative advantages of all schemes.