Analysis of cycle stealing with switching cost

Performance Evaluation Review

Volumn 31, Issue 1, 2003, Pages 183-195

  Osogami, Takayuki ^a   Harchol Balter, Mor ^a   Scheller Wolf, Alan ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Cycle stealing; Distributed system; Load sharing; Matrix analytic; Server farm; Starvation; Supercomputing; Task assignment; Unfairness

Indexed keywords

COMPUTER SCIENCE; COMPUTER SIMULATION; CONSTRAINT THEORY; COSTS; DISTRIBUTED PARAMETER CONTROL SYSTEMS; SERVERS;

CYCLE STEALING; DISTRIBUTED SYSTEMS; LOAD SHARING; MATRIX ANALYTIC; SERVER FARMS; STARVATION; SUPERCOMPUTING; TASK ASSIGNMENT; UNFAIRNESS;

PROGRAM PROCESSORS;

EID: 33646185030     PISSN: 01635999     EISSN: 01635999     Source Type: Journal    
DOI: 10.1145/885651.781050     Document Type: Conference Paper

References (12)

1. S. Borst, O. Boxma, and P. Jelenkovic. Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows. Queueing Systems, (to appear).
2. S. Borst, O. Boxma, and M. van Uitert. The asymptotic workload behavior of two coupled queues, Queueing Systems, 43:81-102, 2003.
3. J. Cohen and O. Boxma. Boundary Value Problems in Queueing System Analysis. North-Holland Publ. Cy., 1983.
4. G. Fayolle and R. Iasnogorodski. Two coupled processors: the reduction to a Riemann-Hilbert problem. Zeitschrift fur Wahrscheinlichkeitstheorie und verwandte Gebiete, 47:325-351, 1979.
5. M. Harchol-Balter, C. Li, T. Osogami, A. Sheller-Wolf, and M. S. Squillante. Cycle stealing under immediate dispatch task assignment. In Proceedings of the Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), June 2003 (to appear).
6. A. Konheim, I. Meilijson, and A. Melkman. Processor-sharing of two parallel lines. Journal of Applied Probability, 18:952-956, 1981.
7. G. Latouche and V. Ramaswami. Introduction to Matrix Analytic Methods in Stochastic Modeling. ASA-SIAM, Philadelphia, 1999.
8. M. F. Neuts. Matrix-Geometric Solutions in Stochastic Models. Johns Hopkins University Press, 1981.
9. T. Osogami and M. Harchol-Balter. Necessary and sufficient conditions for representing general distributions by Coxians. Technical Report CMU-CS-02-178, School of Computer Science, Carnegie Mellon University, September 2002.
10. T. Osogami, M. Harchol-Balter, and A. Sheller-Wolf. Analysis of cycle stealing with switching cost. Technical Report CMU-CS-02-192, School of Computer Science, Carnegie Mellon University, October 2002.
11. M. S. Squillante and R. D. Nelson. Analysis of task migration in shared-memory multiprocessors. In Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pages 143-155, May 1991.
12. H. Takagi. Queueing Analysis - A Foundation of Performance Evaluation, volume 1: Vacation and Priority Systems, Part 1. North Holland, 1991.