A hybrid Markov chain model for workload on parallel computers

HPDC 2010 - Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing

Volumn , Issue , 2010, Pages 589-596

  Krampe, Anne ^a   Lepping, Joachim ^a   Sieben, Wiebke ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Measurement; Performance

Indexed keywords

COMMONLY USED; COMPREHENSIVE MODELING; EMPIRICAL DISTRIBUTION FUNCTIONS; EVALUATION TECHNIQUES; GOODNESS OF FIT; HYBRID APPROACH; MARKOV CHAIN; MARKOV CHAIN MODELS; PARALLEL COMPUTER; PERFORMANCE; PROCESSING TIME; STATE-DEPENDENT; SUBMISSION TIME; WORK-LOAD MODELS;

COMPUTER ARCHITECTURE; DISTRIBUTED COMPUTER SYSTEMS; DISTRIBUTION FUNCTIONS; MARKOV PROCESSES;

SCHEDULING ALGORITHMS;

EID: 78649981258     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1851476.1851563     Document Type: Conference Paper

References (22)

1. A. B. Downey and D. G. Feitelson. The Elusive Goal of Workload Characterization. Performance Evaluation Review, 26(4):14-29, March 1999.
2. C. Ernemann, B. Song, and R. Yahyapour. Scaling of Workload Traces. In D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn, editors, Job Scheduling Strategies for Parallel Processing, volume 2862 of Lecture Notes in Computer Science, pages 166-183. Springer, October 2003.
3. D. G. Feitelson. Packing Schemes for Gang Scheduling. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1162 of Lecture Notes in Computer Science, pages 89-110. Springer, 1996.
4. D. G. Feitelson. Metrics for Parallel Job Scheduling and their Convergence. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 2221, pages 188-206. Springer, 2001.
5. D. G. Feitelson. Workload Modeling for Performance Evaluation. In M. C. Calzarossa and S. Tucci, editors, Performance Evaluation of Complex Systems: Techniques and Tools, volume 2459 of Lecture Notes in Computer Science, pages 114-141. Springer, 2002.
6. D. G. Feitelson and A. M. Weil. Utilization and Predictability in Scheduling the IBM SP2 with Backfilling. In International Parallel Processing Symposium, pages 542-547. IEEE Computer Society Press, 1998.
7. C. Franke, J. Lepping, and U. Schwiegelshohn. Greedy Scheduling with Complex Objectives. In IEEE Symposium on Computational Intelligence in Scheduling, pages 113-120. IEEE Press, April 2007. CD-ROM.
8. S. Hotovy. Workload Evolution on the Cornell Theory Center IBM SP2. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1162 of Lecture Notes in Computer Science, pages 27-40. Springer, 1996.
9. J. Jann, P. Pattnaik, H. Franke, F. Wang, J. Skovira, and J. Riodan. Modeling of Workload in MPPs. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1291 of Lecture Notes in Computer Science, pages 95-116. Springer, 1997.
10. S. Kotz, C. B. Read, N. Balakrishnan, and B. Vidakovic. Encyclopedia of Statistical Science, volume 4. Wiley, 2nd edition, 2006.
11. C. B. Lee, Y. Schwartzman, J. Hardy, and A. Snavely. Are User Runtime Estimates Inherently Inaccurate? In Job Scheduling Strategies for Parallel Processing, volume 3277 of Lecture Notes in Computer Science, pages 253-263. Springer, April 2005.
12. H. Li and M. Muskulus. Analysis and Modeling of Job Arrivals in a Production Grid. ACM Sigmetrics Performance Evaluation Review, 34(4):59-70, 2007.
13. H. Li, M. Muskulus, and L. Wolters. Modeling Correlated Workloads by Combining Model Based Clustering and A Localized Sampling Algorithm. In Proceedings of 21st ACM International Conference on Supercomputing, pages 16-20. ACM Press, June 2007.
14. V. Lo, J. Mache, and K. Windisch. A Comparative Study of Real Workload Traces and Synthetic Workload Models for Parallel Job Scheduling. In D. G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1459 of Lecture Notes in Computer Science, pages 25-46. Springer, 1998.
15. U. Lublin and D. G. Feitelson. The Workload onParallel Supercomputers: Modeling the Characteristics of Rigid Jobs. Journal of Parallel and Distributed Computing, 63(11):1105-1122, 2003.
16. S. Majumdar and E. W. Parsons. Parallel Job Scheduling: A Performance Perspective. In Performance Evaluation: Origins and Directions, volume 1769 of Lecture Notes in Computer Science, pages 233-252. Springer, 2000.
17. A. M. Mood, F. A. Graybill, and D. C. Boes. Introduction to the Theory of Statistics. McGraw-Hill, 3rd edition, 1974.
18. B. Song, C. Ernemann, and R. Yahyapour. Modeling of Parameters in Supercomputer Workloads. In Workshop on Parallel Systems and Algorithms, volume P-41 of Lecture Notes in Informatics, pages 400-409. Gesellschaft für Informatik, March 2004.
19. B. Song, C. Ernemann, and R. Yahyapour. Parallel Computer Workload Modeling with Markov Chains. In D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn, editors, Job Scheduling Strategies for Parallel Processing, volume 3277 of Lecture Notes in Computer Science, pages 47-62. Springer, Oct 2004.
20. D. Sorensen and D. Gianola. Likelihood, Bayesian and MCMC Methods in Quantitative Genetics. Springer, 1st edition, 2002.
21. M. S. Squillante, D. D. Yao, and L. Zhang. The Impact of Job Arrival Patterns on Parallel Scheduling. SIGMETRICS Performance Evaluation Review, 26(4):52-59, 1999.
22. D. Tsafrir, Y. Etsion, and D. G. Feitelson. Modeling User Runtime Estimates. In D. G. F. et al., editor, Job Scheduling Strategies for Parallel Processing, volume 3834 of Lecture Notes in Computer Science, pages 1-35. Springer, 2005.