Analysis of task migration in shared-memory multiprocessor scheduling
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
The Asymptotic Workload Behavior of Two Coupled Queues
Queueing Systems: Theory and Applications
Reduced-Load Equivalence and Induced Burstiness in GPS Queues with Long-Tailed Traffic Flows
Queueing Systems: Theory and Applications
Cycle stealing under immediate dispatch task assignment
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Cycle stealing under immediate dispatch task assignment
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A recursive analysis technique for multi-dimensionally infinite Markov chains
ACM SIGMETRICS Performance Evaluation Review
Analysis of cycle stealing with switching times and thresholds
Performance Evaluation
Stochastic analysis of multiserver systems
ACM SIGMETRICS Performance Evaluation Review
Distributed oblivious load balancing using prioritized job replication
Proceedings of the 8th International Conference on Network and Service Management
| Hi-index | 0.00 |
We consider the scenario of two processors, each serving its own workload, where one of the processors (known as the "donor") can help the other processor (known as the "beneficiary") with its jobs, during times when the donor processor is idle. That is the beneficiary processor "steals idle cycles" from the donor processor. We assume that both donor jobs and beneficiary jobs may have generally-distributed service requirements. We assume that there is a switching cost required for the donor processor to start working on the beneficiary jobs, as well as a switching cost required for the donor processor to return to working on its own jobs. We also allow for threshold constraints, whereby the donor processor only initiates helping the beneficiary if both the donor is idle and the number of jobs at the beneficiary exceeds a certain threshold.We analyze the mean response time for the donor and beneficiary processors. Our analysis is approximate, but can be made as accurate as desired, and is validated via simulation. Results of the analysis illuminate several interesting principles with respect to the general benefits of cycle stealing and the design of cycle stealing policies.