Bibliography

1

I. J. B. F. Adan.
A compensation approach for queueing problems.
PhD thesis, Eindhoven University of Technology, 1991.

2

I. J. B. F. Adan and J. Wessels.
Analysis of the symmetric shortest queue problem.
Communications in Statistics - Stochastic Models, 6(4):691-713, 1990.

3

I. J. B. F. Adan, J. Wessels, and W. H. M. Zijm.
A compensation approach for two-dimensional Markov processes.
Advances in Applied Probability, 25(4):783-817, 1993.

4

H.-S. Ahn, I. Duenyas, and R. Q. Zhang.
Optimal control of a flexible server.
Advances in Applied Probability, 36(1):139-170, 2004.

5

D. Aldous and L. Shepp.
The least variable phase type distribution is Erlang.
Communications in Statistics - Stochastic Models, 3(3):467-473, 1987.

6

T. Altiok.
On the phase-type approximations of general distributions.
IIE Transactions, 17(2):110-116, 1985.

7

A. T. Andersen, M. F. Neuts, and B. F. Nielsen.
On the time reversal of Markovian arrival processes.
Communications in Statistics - Stochastic Models, 20(2):237-260, 2004.

8

J. Anton.
The past, present and future of customer access centers.
International Journal of Service Industry Management, 11(2):120-130, 2000.

9

K. Appleby, S. Fakhouri, L. Fong, G. Goldszmidt, M. Kalantar, and S. Krishnakumar.
Oceano - SLA based management of a computing utility.
In Proceedings of the IFIP/IEEE Symposium on Integrated Network Management, pages 855-868, May 2001.

10

M. Arlitt and T. Jin.
A workload characterization study of the 1998 World Cup web site.
IEEE Network, 14(3):30-37, 2000.

11

Y. Artsy and R. Finkel.
Designing a process migration facility: The Charlotte experience.
IEEE Computer, 22(9):47-56, 1989.

12

S. Asmussen and G. Koole.
Marked point processes as limits of Markovian arrival streams.
Journal of Applied Probability, 30(2):365-372, 1993.

13

B. Awerbuch, Y. Azar, A. Fiat, and T. Leighton.
Making commitments in the face of uncertainty: How to pick a winner almost every time.
In Proceedings of the ACM STOC, pages 519-530, May 1996.

14

M. Baker, R. Buyya, and D. Laforenza.
Grids and grid technologies for wide-area distributed computing.
Journal of Software: Practice and Experience, 32(15):1437-1466, 2002.

15

J. E. Baldeschwieler, R. D. Blumofe, and E. A. Brewer.
ATLAS: An infrastructure for global computing.
In Proceedings of the ACM SIGOPS European workshop: Systems support for worldwide applications, pages 165-172, September 1996.

16

F. Baskett, K. M. Chandy, R. Muntz, and F. Palacios-Gomez.
Open, closed and mixed networks of queues with different classes of customers.
Journal of the ACM, 22(2):248-260, 1975.

17

S. L. Bell and R. J. Williams.
Dynamic scheduling of a system with two parallel servers in heavy traffic with complete resource pooling: Asymptotic optimality of a continuous review threshold policy.
Annals of Applied Probability, 11(3):608-649, 2001.

18

F. Berman and R. Wolski.
The AppLeS project: A status report.
In Proceedings of the NEC Research Symposium, May 1997.

19

D. Bertsimas and D. Nakazato.
The distributional Little's law and its applications.
Operations Research, 43(2):298-310, 1995.

20

S. N. Bhatt, F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg.
On optimal strategies for cycle-stealing in networks of workstations.
IEEE Transactions on Computers, 46(5):545-557, 1997.

21

J. P. C. Blanc.
Performance analysis and optimization with the power-series algorithm.
In Performance Evaluation of Computer and Communication Systems (Lecture Notes in Computer Science, Vol. 729), pages 53-80, 1993.

22

A. Bobbio, A. Horváth, and M. Telek.
Matching three moments with minimal acyclic phase type distributions.
Communications in Statistics - Stochastic Models, to appear.

23

A. B. Bondi and J. P. Buzen.
The response times of priority classes under preemptive resume in M/G/$m$ queues.
In Proceedings of the ACM SIGMETRICS, pages 195-201, August 1984.

24

F. Bonomi and A. Kumar.
Adaptive optimal load balancing in a nonhomogeneous multiserver system with a central job scheduler.
IEEE Transactions on Computers, 39(10):1232-1250, October 1990.

25

S. Borst, O. Boxma, and M. van Uitert.
The asymptotic workload behavior of two coupled queues.
Queueing Systems: Theory and Applications, 43(1-2):81-102, 2003.

26

S. Borst, O. J. Boxma, and P. Jelenkovic.
Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows.
Queueing Systems: Theory and Applications, 43(4):273-306, 2003.

27

O. J. Boxma, J. W. Cohen, and H. Huffels.
Approximations of the mean waiting time in an M/G/$s$ queueing system.
Operations Research, 27(6):1115-1127, 1979.

28

L. W. Bright and P. G. Taylor.
Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes.
Communications in Statistics - Stochastic Models, 11(3):497-514, 1995.

29

L. Brown, N. Gans, A. Mandelbaum, A. Sakov, H. Shen, S. Zeltyn, and L. Zhao.
Statistical analysis of a telephone call center: A queueing-science perspective.
Journal of the American Statistical Association, 100(469):36-50, 2005.

30

R. G. Brown.
Smoothing, Forecasting and Prediction of Discrete Time Series.
Prentice-Hall, 1963.

31

S. L. Brumelle.
Some inequalities for parallel-server queues.
Operations Research, 19:402-413, 1971.

32

S. L. Brumelle.
A generalization of $L = \lambda W$ to moments of queue length and waiting times.
Operations Research, 20:1127-1136, 1972.

33

J. P. Buzen and A. B. Bondi.
The response times of priority classes under preemptive resume in M/M/$m$ queues.
Operations Research, 31(3):456-465, 1983.

34

J. M. Calabrese.
Optimal workload allocation in open queueing networks in multiserver queues.
Management Science, 38(12):1792-1802, 1992.

35

M. Calzarossa and G. Serazzi.
A characterization of the variation in time of workload arrival patterns.
IEEE Transactions on Computers, c-34(2):156-162, 1985.

36

N. Carriero, E. Freeman, D. Gelernter, and D. Kaminsky.
Adaptive parallelism and Piranha.
IEEE Computer, 28(1):40-49, 1995.

37

X. Chao and C. Scott.
Several results on the design of queueing systems.
Operations Research, 48(6):965-970, 2000.

38

J. Chase, L. Grit, D. Irwin, J. Moore, and S. Sprenkle.
Dynamic virtual clusters in a grid site manager.
In Proceedings of the International Symposium on High Performance Distributed Computing, pages 90-103, June 2003.

39

J. S. Chase, D. C. Anderson, P. N. Thankar, and A. M. Vahdat.
Managing energy and server resources in hosting centers.
In Proceedings of the ACM Symposium on Operating Systems Principles, pages 103-116, October 2001.

40

M. Chetty and R. Buyya.
Weaving computational grids: How analogous are they with electrical grids?
IEEE Computing in Science and Engineering, 4(4):61-71, 2002.

41

B. Christiansen, P. Cappello, M. F. Ionescu, M. O. Neary, K. Schauser, and D. Wu.
Javelin: Internet-based parallel computing using Java.
Concurrency: Practice and Experience, 9(11):1139-1160, 1997.

42

J. W. Cohen.
Boundary value problems in queueing theory.
Queueing Systems: Theory and Applications, 3(2):97-128, 1988.

43

J. W. Cohen.
Two-dimensional nearest-neighbor queueing models, a review and an example.
In F. Baccelli, A. Jean-Marie, and I. Mitrani, editors, Quantitative Methods in Parallel Systems, pages 141-152. Springer-Verlag, 1995.

44

J. W. Cohen and O. J. Boxma.
Boundary Value Problems in Queueing System Analysis.
North-Holland Publ. Cy., 1983.

45

D. R. Cox and W. L. Smith.
Queues.
Kluwer Academic Publishers, 1971.

46

M. E. Crovella and A. Bestavros.
Self-similarity in World Wide Web traffic: Evidence and possible causes.
IEEE/ACM Transactions on Networking, 5(6):835-846, December 1997.

47

M. E. Crovella, M. S. Taqqu, and A. Bestavros.
Heavy-tailed probability distributions in the World Wide Web.
In A Practical Guide To Heavy Tails, chapter 1, pages 1-23. Chapman & Hall, New York, 1998.

48

F. Douglis and J. Ousterhout.
Transparent process migration: Design alternatives and the Sprite implementation.
Software: Practice and Experience, 21(8):757-785, 1991.

49

A. Ephremides, P. Varaiya, and J. Walrand.
A simple dynamic routing problem.
IEEE Transactions on Automatic Control, AC-25(4):690-693, 1980.

50

A. K. Erlang.
Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges.
Elektrotkeknikeren, 13:5-13, 1917.

51

G. Fayolle and R. Iasnogorodski.
Two coupled processors: The reduction to a Riemann-Hilbert problem.
Zeitschrift fur Wahrscheinlichkeitstheorie und vervandte Gebiete, 47(3):325-351, 1979.

52

D. Feitelson, L. Rudolph, U. Schwiegelshohn, K. Sevcik, and P. Wong.
Theory and practice in parallel job scheduling.
In Proceedings of IPPS/SPDP '97 Workshop. Lecture Notes in Computer Science, vol. 1291, pages 1-34, April 1997.

53

D. G. Feitelson and B. Nitzberg.
Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860.
In Proceedings of IPPS '95 Workshop on Job Scheduling Strategies for Parallel Processing, pages 215-227, April 1995.

54

R. E. Felderman, E. M. Schooler, and L. Kleinrock.
The Benevolent Bandit Laboratory: A testbed for distributed algorithms.
IEEE Journal on Selected Areas in Communications, 7(2):303-311, 1989.

55

A. Feldmann and W. Whitt.
Fitting mixtures of exponentials to long-tail distributions to analyze network performance models.
Performance Evaluation, 32(4):245-279, 1998.

56

I. Foster, C. Kesselman, and S. Tuecke.
The anatomy of the grid: Enabling scalable virtual organizations.
International Journal of Supercomputer Applications, 15(3), 2001.

57

S. W. Fuhrmann and R. B. Cooper.
Stochastic decompositions in the M/G/1 queue with generalized vacations.
Operations Research, 33(5):1117-1129, 1985.

58

N. Gans, G. Koole, and A. Mandelbaum.
Telephone call centers: Tutorial, review, and research prospects.
Manufacturing and Service Operations Management, 5(2):79-141, 2003.

59

J. Gehring and A. Streit.
Robust resource management for metacomputers.
In Proceedings of the International Symposium on High-Performance Distributed Computing, pages 105-111, August 2000.

60

D. Green.
Lag correlations of approximating departure process for MAP/PH/1 queues.
In Proceedings of the Third International Conference on Matrix Analytic Methods in Stochastic Models, pages 135-151, 2000.

61

L. Green.
A queueing system with general use and limited use servers.
Operations Research, 33(1):168-182, 1985.

62

A. S. Grimshaw and W. A. Wulf.
The legion vision of a worldwide virtual computer.
Communications of the ACM, 40(1):39-45, 1997.

63

R. Haji and G. Newell.
A relation between stationary queue and waiting time distributions.
Journal of Applied Probability, 8(3):617-620, 1971.

64

M. Harchol-Balter.
Task assignment with unknown duration.
Journal of the ACM, 49(2):260-288, 2002.

65

M. Harchol-Balter, M. Crovella, and C. Murta.
On choosing a task assignment policy for a distributed server system.
IEEE Journal of Parallel and Distributed Computing, 59(2):204-228, 1999.

66

M. Harchol-Balter and A. Downey.
Exploiting process lifetime distributions for dynamic load balancing.
ACM Transactions on Computer Systems, 15(3):253-285, 1997.

67

M. Harchol-Balter, C. Li, T. Osogami, A. Scheller-Wolf, and M. S. Squillante.
Task assignment with cycle stealing under central queue.
In Proceedings of the IEEE International Conference on Distributed Computing Systems, pages 628-637, May 2003.

68

M. Harchol-Balter, C. Li, T. Osogami, A. Scheller-Wolf, and M. S. Squillante.
Task assignment with cycle stealing under immediate dispatch.
In Proceedings of the Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures, pages 274-285, June 2003.

69

M. Harchol-Balter, T. Osogami, and A. Scheller-Wolf.
Robustness of threshold policies for beneficiary-donor model.
ACM SIGMETRICS Performance Evaluation Review, 2005 (to appear).

70

M. Harchol-Balter, T. Osogami, A. Scheller-Wolf, and A. Wierman.
Multi-server queueing systems with multiple priority classes.
Queueing Systems: Theory and Applications, (accepted for publication).

71

J. M. Harrison.
Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete review policies.
Annals of Applied Probability, 8(3):822-848, 1998.

72

A. Heindl, K. Mitchell, and A. van de Liefvoort.
The correlation region of second-order MAPs with application to queueing network decomposition.
In Proceedings of the Performance TOOLS (Lecture Notes in Computer Science, Vol. 2794), pages 237-254, September 2003.

73

A. Heindl and M. Telek.
Output models of MAP/PH/1(/$K$) queues for an efficient network decomposition.
Performance Evaluation, 49(1-4):321-339, 2002.

74

A. Heindl, Q. Zhang, and E. Smirni.
ETAQA truncation models for the MAP/MAP/1 departure process.
In Proceedings of the First International Conference on the Quantitative Evaluation of Systems, pages 100-109, September 2004.

75

G. Hooghiemstra, M. Keane, and S. van de Ree.
Power series for stationary distributions of coupled processor models.
SIAM Journal on Applied Mathematics, 48(5):1159-1166, 1988.

76

A. Horv ${\rm\acute{a}}$th and M. Telek.
Approximating heavy tailed behavior with phase type distributions.
In Advances in Matrix-Analytic Methods for Stochastic Models, pages 191-214. Notable Publications, July 2000.

77

A. Horv ${\rm\acute{a}}$th and M. Telek.
PhFit: A general phase-type fitting tool.
In Proceedings of Performance TOOLS 2002, pages 82-91, April 2002.

78

S. Hotovy, D. Schneider, and T. J. O'Donnell.
Analysis of the early workload on the Cornell Theory Center IBM SP2.
In Proceedings of the ACM SIGMETRICS, pages 272-273, May 1996.

79

D. L. Iglehart and W. Whitt.
Multiple channel queues in heavy traffic, I.
Advances in Applied Probability, 2:150-177, 1970.

80

A. Iyengar, E. MacNair, M. S. Squillante, and L. Zhang.
A general methodology for characterizing access patterns and analyzing web server performance.
In Proceedings of the IEEE/ACM MASCOTS, pages 167-174, July 1998.

81

A. Iyengar, M. S. Squillante, and L. Zhang.
Analysis and characterization of large-scale web server access patterns and performance.
World Wide Web, 2(1-2):85-100, 1999.

82

V. S. Iyengar, L. H. Trevillyan, and P. Bose.
Representative traces for processor models with infinite cache.
In Proceedings of the International Symposium on High-Performance Computer Architecture (HPCA), pages 62-72, February 1996.

83

J. R. Jackson.
Networks of waiting lines.
Operations Research, 5(4):518-521, 1957.

84

J. R. Jackson.
Jobshop-like queueing systems.
Management Science, 10(1):131-142, 1963.

85

R. Jain.
The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Mesurement, Simulation, and Modeling.
John Wiley & Sons, 1991.

86

M. A. Johnson.
Selecting parameters of phase distributions: Combining nonlinear programming, heuristics, and Erlang distributions.
ORSA Journal on Computing, 5(1):69-83, 1993.

87

M. A. Johnson and M. F. Taaffe.
An investigation of phase-distribution moment-matching algorithms for use in queueing models.
Queueing Systems: Theory and Applications, 8(2):129-147, 1991.

88

M. A. Johnson and M. R. Taaffe.
Matching moments to phase distributions: Mixtures of Erlang distributions of common order.
Communications in Statistics - Stochastic Models, 5(4):711-743, 1989.

89

M. A. Johnson and M. R. Taaffe.
Matching moments to phase distributions: Density function shapes.
Communications in Statistics - Stochastic Models, 6(2):283-306, 1990.

90

M. A. Johnson and M. R. Taaffe.
Matching moments to phase distributions: Nonlinear programming approaches.
Communications in Statistics - Stochastic Models, 6(2):259-281, 1990.

91

E. Jul, H. Levy, N. Hutchinson, and A. Black.
Fine-grained mobility in the Emerald system.
ACM Transactions on Computer Systems, 6(1):109-133, 1988.

92

S. H. Kang, Y. H. Kim, D. K. Sung, and B. D. Choi.
An application of Markovian arrival process (MAP) to modeling superposed ATM cell streams.
IEEE Transactions on Communications, 50(4):633-642, 2002.

93

E. P. C. Kao and K. S. Narayanan.
Computing steady-state probabilities of a nonpreemptive priority multiserver queue.
Journal on Computing, 2(3):211-218, 1990.

94

E. P. C. Kao and K. S. Narayanan.
Modelling a multiprocessor system with preemptive priorities.
Management Science, 37(2):185-197, 1991.

95

E. P. C. Kao and S. D. Wilson.
Analysis of nonpreemptive priority queues with multiple servers and two priority classes.
European Journal of Operational Research, 118(1):181-193, 1999.

96

S. Karlin and W. J. Studden.
Tchebycheff Systems: With Applications in Analysis and Statistics.
John Wiley and Sons, 1966.

97

F. P. Kelly.
Reversibility and Stochastic Networks.
Wiley, 1979.

98

R. E. A. Khayari, R. Sadre, and B. Haverkort.
Fitting World-Wide Web request traces with the EM-algorithm.
Performance Evaluation, 52(3):175-191, 2003.

99

J. F. C. Kingman.
The single server queue in heavy traffic.
Proceedings of the Cambridge Philosophical Society, 57:902-904, 1961.

100

J. F. C. Kingman.
Two similar queues in parallel.
Annals of Mathematical Statistics, 32:1314-1323, 1961.

101

L. Kleinrock.
Queueing Systems, Volume II: Computer Applications.
A Wiley-Interscience Publication, 1976.

102

L. Kleinrock.
Creating a mathematical theory of computer networks.
Operations Research, 50(1):125-131, 2002.

103

A. Konheim, I. Meilijson, and A. Melkman.
Processor-sharing of two parallel lines.
Journal of Applied Probability, 18(4):952-956, 1981.

104

G. Koole.
On the power series algorithm.
In O. J. Boxma and G. M. Koole, editors, Performance Evaluation of Computer and Communication Systems -- Solution Methods, CWI Tract 105, pages 139-155, 1998.

105

G. Koole and A. Mandelbaum.
Queueing models of call centers: An introduction.
Annals of Operations Research, 113:41-59, 2002.

106

G. Koole, P. D. Sparaggis, and D. Towsley.
Minimizing response times and queue lengths in systems of parallel queues.
Journal of Applied Probability, 36(4):1185-1193, 1999.

107

B. Krishnamurthy, C. Wills, and Y. Zhang.
On the use and performance of content distribution network.
In Proceedings of the ACM SIGCOMM, pages 169-182, November 2001.

108

D. P. Kroese, W. R. W. Scheinhardt, and P. G. Taylor.
Spectral properties of the tandem Jackson network, seen as a quasi-birth-and-death process.
Annals of Applied Probability, 14(4):2057-2089, 2004.

109

P. Krueger and R. Chawla.
The stealth distributed scheduler.
In Proceedings of the IEEE International Conference on Distributed Computing Systems, pages 336-343, May 1991.

110

M. Krunz and S. K. Tripathi.
On the characteristics of VBR MPEG steams.
In Proceedings of the ACM SIGMETRICS, pages 192-202, June 1997.

111

G. Latouche and V. Ramaswami.
Introduction to Matrix Analytic Methods in Stochastic Modeling.
ASA-SIAM, Philadelphia, 1999.

112

H. Leemans.
The Two-Class Two-Server Queue with Nonpreemptive Heterogeneous Priority Structures.
PhD thesis, K.U.Leuven, 1998.

113

W. E. Leland and T. J. Ott.
Load-balancing heuristics and process behavior.
In Proceedings of the Performance and ACM SIGMETRICS, pages 54-69, 1986.

114

W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson.
On the self-similar nature of Ethernet traffic (extended version).
IEEE/ACM Transactions on Networking, 2(1):1-15, 1994.

115

M. Litzkow, M. Livny, and M. W. Mutka.
Condor -- A hunter of idle workstations.
In Proceedings of the IEEE International Conference on Distributed Computing Systems, pages 104-111, June 1988.

116

M. Litzkow and M. Solomon.
Supporting checkpointing and process migration outside the UNIX kernel.
In Proceedings of the USENIX Winter Conference, pages 283-290, January 1992.

117

D. M. Lucantoni, K. S. Meier-Hellstern, and M. F. Neuts.
A single-server queue with server vacations and a class of non-renewal arrival processes.
Advances in Applied Probability, 22(3):676-705, 1990.

118

S. Makridakis, S. C. Wheelwright, and R. J. Hyndman.
Forecasting: Methods and Applications.
John Wiley & Sons, 1998.

119

A. Mandelbaum.
Call centers (centres): Research bibliography with abstracts, version 6, December 2004.

120

A. Mandelbaum and M. I. Reiman.
On pooling in queueing networks.
Management Science, 44(7):971-981, 1998.

121

A. Mandelbaum and A. Stolyar.
Scheduling flexible servers with convex delay costs: Heavy traffic optimality of the generalized $c\mu$-rule.
Operations Research, 52(6):836-855, 2004.

122

R. Marie.
Calculating equilibrium probabilities for $\lambda(n)/c_k/1/n$ queues.
In Proceedings of the Performance, pages 117-125, 1980.

123

V. Mehrotra.
Ringing up big business.
OR/MS Today, 24(4):18-24, 1997.

124

R. Menich and R. F. Serfozo.
Optimality of routing and servicing in dependent parallel processing systems.
Queueing Systems: Theory and Applications, 9(4):403-418, 1991.

125

S. Meyn.
Sequencing and routing in multiclass queueing networks part I: Feedback regulation.
SIAM Journal on Control Optimization, 40(3):741-776, 2001.

126

J. A. V. Mieghem.
Dynamic scheduling with convex delay costs: The generalized $c\mu$ rule.
Annals of Applied Probability, 5(3):809-833, 1995.

127

D. R. Miller.
Steady-state algorithmic analysis of M/M/$c$ two-priority queues with heterogeneous servers.
In R. L. Disney and T. J. Ott, editors, Applied probability - Computer science, The Interface, volume II, pages 207-222. Birkhauser, 1992.

128

D. S. Milojicic, W. Zint, A. Dangel, and P. Giese.
Task migration on the top of the Mach migration.
In Proceedings of the USENIX Mach Symposium, pages 273-290, April 1992.

129

I. Mitrani and P. J. B. King.
Multiprocessor systems with preemptive priorities.
Performance Evaluation, 1(2):118-125, 1981.

130

P. Molinero-Fernandez, K. Psounis, and B. Prabhakar.
Systems with multiple servers under heavy-tailed workloads.
Technical Report CENG-2004-02, University of Southern California, March 2004.

131

P. Morse.
Queues, Inventories, and Maintenance.
John Wiley and Sons, 1958.

132

R. Nelson.
Probability, Stochastic Processes, and Queueing Theory.
Springer-Verlag, 1995.

133

M. F. Neuts.
Probability distributions of phase type.
In Liber Amicorum Professor Emeritus H. Florin, University of Louvain, Belgium, pages 173-206, 1975.

134

M. F. Neuts.
Moment formulas for the Markov renewal branching process.
Advances in Applied Probability, 8:690-711, 1978.

135

M. F. Neuts.
A versatile Markovian point process.
Journal of Applied Probability, 16(4):764-779, 1979.

136

M. F. Neuts.
Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach.
The Johns Hopkins University Press, 1981.

137

M. F. Neuts.
Structured Stochastic Matrices of M/G/1 Type and Their Applications.
Marcel Dekker, 1989.

138

B. Ngo and H. Lee.
Analysis of a pre-emptive priority M/M/$c$ model with two types of customers and restriction.
Electronics Letters, 26(15):1190-1192, 1990.

139

D. Nichols.
Using idle workstations in a shared computing environment.
In Proceedings of the ACM Symposium on Operating Systems Principles, pages 5-12, November 1987.

140

T. Nishida.
Approximate analysis for heterogeneous multiprocessor systems with priority jobs.
Performance Evaluation, 15(2):77-88, 1992.

141

S. Nozaki and R. Ross.
Approximations in finite capacity multiserver queues with Poisson arrivals.
Journal of Applied Probability, 15(4):826-834, 1978.

142

C. A. O'Cinneide.
Phase-type distributions and majorization.
Annals of Applied Probability, 1(3):219 - 227, 1991.

143

T. Osogami.
Analysis of a QBD process that depends on background QBD processes.
Technical Report CMU-CS-04-163, School of Computer Science, Carnegie Mellon University, 2004.

144

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, 2002.

145

T. Osogami and M. Harchol-Balter.
A closed-form solution for mapping general distributions to minimal PH distributions.
In Proceedings of the Performance TOOLS (Lecture Notes in Computer Science, Vol. 2794), pages 200-217, September 2003.

146

T. Osogami and M. Harchol-Balter.
A closed-form solution for mapping general distributions to minimal PH distributions.
Technical Report CMU-CS-03-114, School of Computer Science, Carnegie Mellon University, 2003.

147

T. Osogami and M. Harchol-Balter.
Necessary and sufficient conditions for representing general distributions by Coxians.
In Proceedings of the Performance TOOLS (Lecture Notes in Computer Science, Vol. 2794), pages 182-199, September 2003.

148

T. Osogami and M. Harchol-Balter.
Closed form solutions for mapping general distributions to quasi-minimal PH distributions.
Performance Evaluation, 2005 (to appear).

149

T. Osogami, M. Harchol-Balter, and A. Scheller-Wolf.
Robustness and performance of threshold-based resource allocation policies.
Working paper.

150

T. Osogami, M. Harchol-Balter, and A. Scheller-Wolf.
Analysis of cycle stealing with switching cost.
Technical Report CMU-CS-02-192, School of Computer Science, Carnegie Mellon University, October 2002.

151

T. Osogami, M. Harchol-Balter, and A. Scheller-Wolf.
Analysis of cycle stealing with switching cost.
In Proceedings of the ACM SIGMETRICS, pages 184-195, June 2003.

152

T. Osogami, M. Harchol-Balter, and A. Scheller-Wolf.
Analysis of cycle stealing with switching times and thresholds.
Performance Evaluation, 2005 (to appear).

153

T. Osogami, M. Harchol-Balter, A. Scheller-Wolf, and L. Zhang.
Exploring threshold-based policies for load sharing.
In Proceedings of the 42nd Annual Allerton Conference on Communication, Control, and Computing, September 2004.

154

T. Osogami and H. Imai.
Classification of various neighborhood operations for the nurse scheduling problem (extended abstract).
Lecture Notes in Computer Science (Proceedings of the 11th Annual International Symposium on Algorithms And Computation (ISAAC 2000)), 1969:72-83, December 2000.

155

T. Osogami, A. Wierman, M. Harchol-Balter, and A. Scheller-Wolf.
How many servers are best in a dual-priority FCFS system?
Technical Report CMU-CS-03-213, School of Computer Science, Carnegie Mellon University, 2004.

156

T. Osogami, A. Wierman, M. Harchol-Balter, and A. Scheller-Wolf.
A recursive analysis technique for multi-dimensionally infinite Markov chains.
ACM SIGMETRICS Performance Evaluation Review, 32(2):3-5, 2004.

157

E. W. Parsons and K. C. Sevcik.
Implementing multiprocessor scheduling disciplines.
In Proceedings of IPPS/SPDP '97 Workshop. Lecture Notes in Computer Science, vol. 1459, pages 166-182, April 1997.

158

V. Paxson and S. Floyd.
Wide-area traffic: The failure of Poisson modeling.
IEEE/ACM Transactions on Networking, 3(3):226-244, 1995.

159

M. L. Puterman.
Markov Decision Processes: Discrete Stochastic Dynamic Programming.
Wiley Series in Probability and Statistics, 1994.

160

B. M. Rao and M. J. M. Posner.
Parallel exponential queues with dependent service rates.
Computers and Operations Research, 13(6):681-692, 1986.

161

M. I. Reiman and B. Simon.
Open queueing systems in light traffic.
Mathematics of Operations Research, 14(1):26-59, 1989.

162

A. Riska, V. Diev, and E. Smirni.
An EM-based technique for approximating long-tailed data sets with PH distributions.
Performance Evaluation, 55(1-2):147-164, 2004.

163

A. L. Rosenberg.
Guidelines for data-parallel cycle-stealing in network of workstations, I. On maximizing expected output.
Journal of Parallel and Distributed Computing, 59(1):31-53, 1999.

164

A. L. Rosenberg.
Guidelines for data-parallel cycle-stealing in network of workstations, II: On maximizing guranteed output.
International Journal of Foundations of Computer Science, 11(1):183-204, 2000.

165

A. L. Rosenberg.
Optimal schedules for cycle-stealing in a network of workstations with a bag-of-tasks workload.
IEEE Transactions on Parallel and Distributed Systems, 13(2):179-191, 2002.

166

K. W. Ross and D. D. Yao.
Optimal load balancing and scheduling in a distributed computer system.
Journal of the ACM, 38(3):676-690, July 1991.

167

S. M. Ross.
Stochastic Processes.
John Wiley & Sons, Inc., second edition, 1996.

168

S. M. Ross.
Simulation.
Academic Press, 1997.

169

S. M. Ross.
Introduction to Probability Models.
Academic Press, seventh edition, 2000.

170

K. D. Ryu, J. K. Hollingsworth, and P. J. Keleher.
Mechanisms and policies for supporting fine-grained cycle stealing.
In Proceedings of the ACM/IEEE Conference on Supercomputing, pages CD-ROM, May 1999.

171

C. H. Sauer and K. M. Chandy.
Approximate analysis of central server models.
IBM Journal of Research and Development, 19(3):301-313, 1975.

172

A. Scheller-Wolf.
Necessary and sufficient conditions for delay moments in FIFO multiserver queues with an application comparing $s$ slow servers with one fast one.
Operations Research, 51(5):748-758, 2003.

173

L. Schmickler.
MEDA: Mixed Erlang distributions as phase-type representations of empirical distribution functions.
Communications in Statistics - Stochastic Models, 8(1):131-156, 1992.

174

B. Schroeder and M. Harchol-Balter.
Evaluation of task assignment policies for supercomputing servers: The case for load unbalancing and fairness.
In Proceedings of the Ninth IEEE International Symposium on High Performance Distributed Computing, pages 211-219, 2000.

175

G. H. Shahkar and H. R. Tareghian.
Designing a production line through optimization of M/G/$c$ using simulation.
Mathematical Engineering in Industry, 8(2):123-126, 2001.

176

R. Shumsky.
Approximation and analysis of a call center with flexible and specialized servers.
OR Spectrum, 26(3):307-330, 2004.

177

A. Sleptchenko.
Multi-class, multi-server queues with non-preemptive priorities.
Technical Report 2003-016, EURANDOM, Eindhoven University of Technology, 2003.

178

A. Sleptchenko, A. van Harten, and M. van der Heijden.
An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities, 2003 - Manuscript.

179

P. Smith and N. C. Hutchinson.
Heterogeneous process migration: The Tui system.
Software: Practice and Experience, 28(6):611-638, 1998.

180

M. S. Squillante and R. D. Nelson.
Analysis of task migration in shared-memory multiprocessors.
In Proceedings of the ACM SIGMETRICS, pages 143-155, May 1991.

181

M. S. Squillante, C. H. Xia, D. D. Yao, and L. Zhang.
Threshold-based priority policies for parallel-server systems with affinity scheduling.
In Proceedings of the IEEE American Control Conference, pages 2992-2999, June 2001.

182

M. S. Squillante, C. H. Xia, and L. Zhang.
Optimal scheduling in queuing network models of high-volume commercial web sites.
Performance Evaluation, 47(4):223-242, 2002.

183

M. S. Squillante, D. D. Yao, and L. Zhang.
Analysis of job arrival patterns and parallel scheduling performance.
Performance Evaluation, 36-37(1-4):137-163, 1999.

184

M. S. Squillante, D. D. Yao, and L. Zhang.
Web traffic modeling and web server performance analysis.
In Proceedings of the IEEE Conference on Decision and Control, December 1999.

185

D. A. Stanford and W. K. Grassmann.
The bilingual server system: A queueing model featuring fully and partially qualified servers.
INFOR, 31(4):261-277, 1993.

186

D. A. Stanford and W. K. Grassmann.
Bilingual server call centers.
In D. McDonald and S. Turner, editors, Analysis of Communication Networks: Call Centers, Traffic and Performance. American Mathematical Society, 2000.

187

D. Starobinski and M. Sidi.
Modeling and analysis of power-tail distributions via classical teletraffic methods.
Queueing Systems: Theory and Applications, 36(1-3):243-267, 2000.

188

S. Stidham.
On the optimality of single-server queueing systems.
Operations Research, 18(4):708-732, 1970.

189

S. Stidham.
Analysis, design, and control of queueing systems.
Operations Research, 50(1):197-216, 2002.

190

M. Telek and A. Heindl.
Matching moments for acyclic discrete and continuous phase-type distributions of second order.
International Journal of Simulation, 3(3-4):47-57, 2003.

191

G. Thiel.
Locus operating systems, a transparent system.
Computer Communications, 16(6):336-346, 1991.

192

D. Towsley, P. D. Sparaggis, and C. G. Cassandras.
Optimal routing and buffer allocation for a class of finite capacity queueing systems.
IEEE Transactions on Automatic Control, 37(9):1447-1451, 1992.

193

K. S. Trivedi.
Probability & Statistics with Reliability, Queueing, and Computer Science Applications.
Prentice Hall, 1982.

194

M. van der Heijden, A. van Harten, and A. Sleptchenko.
Approximations for Markovian multi-class queues with preemptive priorities.
Operations Research Letters, 32(3):273-282, 2004.

195

N. M. van Dijk.
Queueing Networks and Product Forms: A Systems Approach.
Wiley, 1993.

196

G. J. van Houtum.
New approaches for multi-dimensional queueing systems.
PhD thesis, Eindhoven University of Technology, 1995.

197

G. J. van Houtum and W. H. M. Zijm.
Computational procedures for stochastic multi-echelon production systems.
International Journal of Production Economics, 23:223-237, 1991.

198

G. J. van Houtum and W. H. M. Zijm.
Incomplete convolutions in production and inventory models.
OR Spektrum, 19(2):97-107, 1997.

199

L. A. Wald and S. Schwarz.
The 1999 southern California seismic network bulletin.
Seismological Research Letters, 71(4), 2000.

200

W. Whitt.
Approximating a point process by a renewal process: Two basic methods.
Operations Research, 30(1):125-147, 1982.

201

W. Whitt.
Deciding which queue to join: Some counterexamples.
Operations Research, 34(1):226-244, 1986.

202

W. Whitt.
A review of $L = \lambda W$ and extensions.
Queueing Systems: Theory and Applications, 9(3):235-268, 1991.

203

W. Whitt.
The impact of a heavy-tailed service-time distribution upon the M/GI/$s$ waiting-time distribution.
Queueing Systems: Theory and Applications, 36(1-3):71-87, 2000.

204

A. Wierman, T. Osogami, M. Harchol-Balter, and A. Scheller-Wolf.
Analyzing the effect of prioritized background tasks in multiserver systems.
Technical Report CMU-CS-03-213, School of Computer Science, Carnegie Mellon University, 2004.

205

R. J. Williams.
On dynamic scheduling of a parallel server system with complete resource pooling.
In D. McDonald and S. Turner, editors, Analysis of Communication Networks: Call Centers, Traffic and Performance. American Mathematical Society, 2000.

206

W. Willinger, M. S. Taqqu, W. E. Leland, and D. V. Wilson.
Self-similarity in high-speed packet traffic: Analysis and modeling of Ethernet traffic measurements.
Statistical Science, 10(1):67-85, 1995.

207

W. Willinger, M. S. Taqqu, R. Sherman, and D. V. Wilson.
Self-similarity through high-variability: Statistical analysis of Ethernet LAN traffic at the source level.
IEEE/ACM Transactions on Networking, 5(1):71-86, 1997.

208

K. Windisch, V. Lo, B. Nitzberg, D. Feitelson, and R. Moore.
A comparison of workload traces from two production parallel machines.
In Proceedings of the Symposium on the Frontiers of Massively Parallel Computation, pages 319-326, May 1996.

209

W. Winston.
Optimality of the shortest line discipline.
Journal of Applied Probability, 14(1):181-189, 1977.

210

R. W. Wolff.
Stochastic Modeling and the Theory of Queues.
Prentice Hall, 1989.

211

E. Zayas.
Attacking the process migration bottleneck.
In Proceedings of the ACM Symposium on Operating Systems Principles, pages 13-24, November 1987.