Malleable-lab: A tool for evaluating adaptive online schedulers on malleable jobs

Proceedings of the 18th Euromicro Conference on Parallel, Distributed and Network-Based Processing, PDP 2010

Volumn , Issue , 2010, Pages 11-18

  Cao, Yangjie ^a   Sun, Hongyang ^b   Hsu, Wen Jing ^b   Qian, Depei ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SCHEDULING; ARRIVAL PATTERNS; DYNAMIC BEHAVIORS; GENERIC PATTERNS; HIGH SENSITIVITY; MALLEABLE JOBS; MULTI CORE; MULTIPLE PROCESSORS; ON-LINE SCHEDULERS; PARALLEL APPLICATION; PARALLEL JOBS; PARALLEL PROGRAM; TRANSIENT RESPONSE; WORK-LOAD MODELS;

PARALLEL ARCHITECTURES;

SCHEDULING;

EID: 77952664835     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDP.2010.14     Document Type: Conference Paper

References (13)

1. K. Agrawal, Y. He, W.-J. Hsu, and C. E. Leiserson. Adaptive scheduling with parallelism feedback. In PPoPP, pages 100-109, New York City, NY, USA, 2006.
2. J. Edmonds. Scheduling in the dark. In STOC, pages 179-188, Atlanta, GA, USA, 1999.
3. H. Sun, and W.-J. Hsu. Adaptive B-Greedy (ABG): A Simple yet Efficient Scheduling Algorithm. In SMTPS in conjunction with IPDPS, pages 1-8, Miami, FL, USA, 2008.
4. D. G. Feitelson and L. Rudolph. Metrics and benchmarking for parallel job scheduling Lecture Notes in Computer Science, vol. 1459, pages 185, 1998.
5. D. G. Feitelson Packing schemes for gang scheduling Lecture Notes in Computer Science, pages 89-111, 1996.
6. J. Jann, P. Pattnaik, H. Franke, F. Wang, J. Skovira and J. Riordan. Modeling of Workload in MPPs. In JSSPP, pages 95-116, Geneva, Switzerland, 1997.
7. U. Lublin and D. G. Feitelson. The workload on parallel supercomputers: modeling the characteristics of rigid jobs. Journal of Parallel and Distributed Computing, 2003.
8. A. B. Downey. A parallel workload model and its implications for processor allocation 6th Intl. Symposium High Performance Distributed Computing, 1997.
9. W. Cirne and F. Berman. A comprehensive model of the supercomputer workload In 4th Annual Workshop Workload Characterization, pages 140-148, 2001.
10. M. Calzarossa, A. Merlo, D. Tessera, G. Haring, and G. Kotsis. A hierarchical approach to workload characterization for parallel systems. Lecture Notes in Computer Science, vol. 919, pages 102-109, 1995.
11. Y. He, W.-J. Hsu, and C. E. Leiserson. Provably efficient two-level adaptive scheduling. In JSSPP, pages 1-32, Saint-Malo, France, 2006.
12. J. Edmonds, D. D. Chinn, T. Brecht, and X. Deng. Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics. In STOC, pages 120-129, El Paso, TX, USA, 1997.
13. C. McCann, R. Vaswani, and J. Zahorjan. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors ACM Transactions on Computer Systems (TOCS), vol. 11, pages 146-178, 1993.