Analysis of job arrival patterns and parallel scheduling performance

Performance Evaluation

Volumn 36-37, Issue , 1999, Pages 137-163

  Squillante, Mark S ^a   Yao, David D ^b   Zhang, Li ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

PERFORMANCE; QUEUEING THEORY; SCHEDULING; TIME SHARING SYSTEMS;

HEAVY TAIL DISTRIBUTIONS; JOB ARRIVAL PATTERNS; PARALLEL SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 0033169492     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(99)00035-8     Document Type: Article

References (29)

1. S. Asmussen, Phase-type distributions and related point processes: Fitting and recent advances, in: S.R. Chakravarthy, A.S. Alfa (Eds.), Matrix-Analytic Methods in Stochastic Models, Marcel Dekker, Boston, 1997, pp. 137-149.
2. P.J. Brockwell, R.A. Davis, Time Series: Theory and Methods, Springer, Berlin, 1987.
3. S.L. Brumelle, Some inequalities for parallel-server queues, Oper. Res. 19 (1971) 402-413.
4. S.-H. Chiang, R.K. Mansharamani, M.K. Vernon, Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies, in: Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, May 1994, pp. 33-44.
5. L.W. Dowdy, M.R. Leuze, On modeling partitioned multiprocessor systems, Int. J. High Speed Comput. 6 (1) (1994).
6. D.G. Feitelson, B. Nitzberg, Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860, in: D.G. Feitelson, L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 949, Springer, Berlin, 1995, pp. 337-360.
7. D.G. Feitelson, L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vols. 949, 1162, 1291, 1459, Springer, Berlin, 1995-1998.
8. A. Feldmann, W. Whitt, Fitting mixtures of exponentials to long-tail distributions to analyze network performance models, Performance Evaluation 31 (1998) 245-279.
9. S.G. Hotovy, Workload evolution on the Cornell Theory Center IBM SP2, in: D.G. Feitelson, L. Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, vol. 1162, Springer, Berlin, 1996, pp. 27-40.
10. S.G. Hotovy, D.J. Schneider, T. O'Donnell, Analysis of the early workload on the Cornell Theory Center IBM SP2, in: Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, May 1996, pp. 272-273.
11. A.K. Iyengar, M.S. Squillante, L. Zhang, Analysis and characterization of large-scale web server access patterns and performance, World Wide Web, 1999.
12. M.A. Johnson, M.F. Taaffe, An investigation of phase-distribution moment-matching algorithms for use in queueing models, Queueing Systems 8 (1991) 129-147.
13. M. Kendall, J. Ord, Time Series, Oxford University Press, Oxford, 1990.
14. A. Lang, J.L. Arthur, Parameter approximation for phase-type distributions, in: S.R. Chakravarthy, A.S. Alfa (Eds), Matrix-Analytic Methods in Stochastic Models, Marcel Dekker, Boston, 1997, pp. 151-206.
15. C. McCann, J. Zahorjan, Processor allocation policies for message-passing parallel computers, in: Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, May 1994, pp. 19-32.
16. C. McCann, J. Zahorjan, Scheduling memory constrained jobs on distributed memory parallel computers, in: Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, May 1995, pp. 208-219.
17. M.F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach, The Johns Hopkins University Press, Baltimore, MD, 1981.
18. E.W. Parsons, K.C. Sevcik, Benefits of speedup knowledge in memory-constrained multiprocessor scheduling, Performance Evaluation 27/28 (1996) 253-272.
19. E.W. Parsons, K.C. Sevcik, Coordinated allocation of memory and processors in multiprocessors, in: Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, May 1996, pp. 57-67.
20. V.G. Peris, M.S. Squillante, V.K. Naik, Analysis of the impact of memory in distributed parallel processing systems, in: Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, May 1994, pp. 5-18.
21. S.M. Ross, Stochastic Processes 2nd ed., Wiley, New York, 1997.
22. E. Rosti, G. Serazzi, E. Smirni, M.S. Squillante, The impact of I/O on program behavior and parallel scheduling, in: Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, June 1998, pp. 56-65.
23. K.C. Sevcik, Application scheduling and processor allocation in multiprogrammed parallel processing systems, Performance Evaluation 19 (1994) 107-140.
24. M. Shaked, J. Shanthikumar, Stochastic Orders and Their Applications, Academic Press, New York, 1994.
25. J. Shanthikumar, D.D. Yao, The effect of increasing service rates in closed queueing networks, J. Appl. Probab. 23 (1986) 474-483.
26. D.H. Shi, J. Guo, L. Liu, SPH-distributions and the rectangle-iterative algorithm, in: S.R. Chakravarthy, A.S. Alfa (Eds.) Matrix-Analytic Methods in Stochastic Models, Marcel Dekker, Boston, 1997, pp. 207-224.
27. M.S. Squillante, Matrix-analytic methods in stochastic parallel-server scheduling models, in: S.R. Chakravarthy, A.S. Alfa (Eds.), Advances in Matrix-Analytic Methods for Stochastic Models, Notable Publications, 1998.
28. M.S. Squillante, F. Wang, M. Papaefthymiou, Stochastic analysis of gang scheduling in parallel and distributed systems, Performance Evaluation 27/28 (1996) 273-296.
29. D. Stoyan, Comparison Methods for Queues and Other Stochastic Models, Wiley, New York, 1983 (edited with revisions by D.J. Daley).