Fair and efficient online adaptive scheduling for multiple sets of parallel applications

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn , Issue , 2011, Pages 64-71

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

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b XI'AN JIAOTONG UNIVERSITY   (China)

Author keywords

Adaptive scheduling; Efficiency; Fairness; Feedback driven scheduling; Multiprocessor systems; Online algorithms; Parallel applications; Set response time

Indexed keywords

ADAPTIVE SCHEDULING; FAIRNESS; MULTI PROCESSOR SYSTEMS; ON-LINE ALGORITHMS; PARALLEL APPLICATION;

COMPUTER SYSTEMS; EFFICIENCY; PARALLEL PROCESSING SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 84863404138     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2011.62     Document Type: Conference Paper

References (22)

1. K. Agrawal, Y. He, W.-J. Hsu, and C. E. Leiserson. Adaptive scheduling with parallelism feedback. In PPoPP, New York, USA, 2006.
2. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, New York, NY, USA, 1998.
3. Y. Cao, H. Sun, and W.-J. Hsu. Malleable-Lab: A tool for evaluating adaptive online schedulers on malleable jobs. In PDP, Pisa, Italy, 2010.
4. Y. Cao, H. Sun, D. Qian, and W. Wu. Scalable hierarchical scheduling for multiprocessor systems using adaptive feedback-driven policies. In ISPA, Taipei, Taiwan, 2010.
5. A. B. Downey. A parallel workload model and its implications for processor allocation. In HPDC, Portland, USA, 1997.
6. J. Edmonds. Scheduling in the dark. In STOC, Atlanta, USA, 1999.
7. J. Edmonds, D. D. Chinn, T. Brecht, and X. Deng. Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics. In STOC, El Paso, USA, 1997.
8. D. G. Feitelson. Job scheduling in multiprogrammed parallel systems. IBM Research Report RC19790(87657) 2nd Revision, 1997.
9. Y. He, W.-J. Hsu, and C. E. Leiserson. Provably efficient two-level adaptive scheduling. In JSSPP, Saint-Malo, France, 2006.
10. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):617-643, 2000.
11. Y.-K. Kwok, and I. Ahmad. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4):406-471, 1999.
12. C. McCann, R. Vaswani, and J. Zahorjan. A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Transactions on Computer Systems, 11(2):146-178, 1993. (Pubitemid 23668699)
13. R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. In SODA, Austin, USA, 1993.
14. K. Pruhs. Competitive online scheduling for server systems. Performance Evaluation Review, 34(4):52-58, 2007.
15. J. Robert and N. Schabanel. Non-clairvoyant batch set scheduling: Fairness is fair enough. In ESA, Eilat, Israel, 2007.
16. J. Robert and N. Schabanel. Pull-based data broadcast with dependencies: be fair to users, not to items. In SODA, New Orleans, USA, 2007.
17. S. Sen. Dynamic processor allocation for adaptively parallel jobs. Master's thesis, Massachusetts Institute of technology, 2004.
18. R. Sudarsan and C. J. Ribbens ReSHAPE: A framework for dynamic resizing and scheduling of homogeneous applications in a parallel environment. In ICPP, Xi'an, China, 2007.
19. H. Sun, Y. Cao, and W.-J. Hsu. Competitive two-level adaptive scheduling using resource augmentation. In JSSPP, Rome, Italy, 2009.
20. H. Sun, Y. Cao, and W.-J. Hsu. Efficient Adaptive scheduling of multiprocessors with stable parallelism feedback. In IEEE Transactions on Parallel and Distributed Systems, 22(4), 594-607, 2011.
21. H. Sun and W.-J. Hsu. Adaptive B-Greedy (ABG): A simple yet efficient scheduling algorithm. In IPDPS, Miami, USA, 2008.
22. A. Tucker and A. Gupta. Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. In SOSP, New York, USA, 1989.