Analysis of cycle stealing with switching times and thresholds

Authors:
Takayuki Osogami;Mor Harchol-Balter;Alan Scheller-Wolf
Affiliations:
Computer Science Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA;Computer Science Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA;Tepper School of Business, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA
Venue:
Performance Evaluation
Year:
2005

Citing 5
Cited 8

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
Analysis of cycle stealing with switching cost

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Multi-Server Queueing Systems with Multiple Priority Classes

Queueing Systems: Theory and Applications
How many servers are best in a dual-priority M/PH/k system?

Performance Evaluation
Beyond processor sharing

ACM SIGMETRICS Performance Evaluation Review
Stochastic analysis of multiserver systems

ACM SIGMETRICS Performance Evaluation Review
A survey of autonomic computing—degrees, models, and applications

ACM Computing Surveys (CSUR)
Efficient management of idleness in storage systems

ACM Transactions on Storage (TOS)
Asymptotically optimal parallel resource assignment with interference

Queueing Systems: Theory and Applications
Power series approximations for two-class generalized processor sharing systems

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider two processors, each serving its own M/GI/1 queue, where one of the processors (the ''donor'') can help the other processor (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. There is a switching time required for the donor processor to start working on the beneficiary jobs, as well as a switching back time. We also allow for threshold constraints on both the beneficiary and donor sides, whereby the decision to help is based not only on idleness but also on satisfying threshold criteria in the number of jobs. 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 principles on the general benefits of cycle stealing and the design of cycle stealing policies.