Scalable hierarchical scheduling for multiprocessor systems using adaptive feedback-driven policies

Proceedings - International Symposium on Parallel and Distributed Processing with Applications, ISPA 2010

Volumn , Issue , 2010, Pages 38-45

  Cao, Yangjie ^a   Sun, Hongyang ^b   Qian, Depei ^a   Wu, Weiguo ^a  

^a XI'AN JIAOTONG UNIVERSITY   (China)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE FEEDBACK; ADAPTIVE SCHEDULING ALGORITHM; ADAPTIVE STRATEGY; ALLOCATION APPROACH; COMPETITIVE RATIO; COMPLETION TIME; HIERARCHICAL LEVEL; HIERARCHICAL SCHEDULING; MAKESPAN; MULTI CORE; MULTI PROCESSOR SYSTEMS; PARALLEL COMPUTING; PARALLEL JOBS; PARALLELIZATIONS; PERFORMANCE GAIN; SCALABLE PERFORMANCE; SCHEDULING HIERARCHY; SIMULATION RESULT;

ADAPTIVE ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; HIERARCHICAL SYSTEMS; MULTIPROCESSING SYSTEMS; PARALLEL ARCHITECTURES; SCALABILITY;

SCHEDULING ALGORITHMS;

EID: 79952093555     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPA.2010.68     Document Type: Conference Paper

References (16)

1. P. Goyal, X. Guo, and H. Vin. A Hierarchical CPU Scheduler for Multimedia Operating Systems Proc. Second Usenix Symp. Operating System Design and Implementation (OSDI'96), pages 107-122, Oct. 1996.
2. A. Chandra and P. Shenoy. Hierarchical scheduling for symmetric multiprocessors In IEEE Transactions on Parallel and Distributed Systems, pages 418-431, 2008.
3. J.H. Abawajy. Adaptive hierarchical scheduling policy for enterprise grid computing systems Journal of Network and Computer Applications, 32(3):770-779, 2009.
4. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, New York, NY, USA, 1998.
5. R. Motwani, S. Phillips, and E. Torng. Non-clairvoyant scheduling. In SODA, pages 422-431, Austin, TX, USA, 1993.
6. J. Edmonds. Scheduling in the dark. In STOC, pages 179-188, Atlanta, GA, USA, 1999.
7. Jeff Edmonds and Donald D. Chinn and Tim Brecht and Xiaotie Deng. Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics. In Journal of Scheduling, 6(3):231-250, 2003.
8. J. Robert and N. Schabanel. Non-clairvoyant batch set scheduling: Fairness is fair enough. In ESA, pages 741-753, Eilat, Israel, 2007.
9. H. Sun, Y. Cao, and W.-J. Hsu. Non-clairvoyant Adaptive Scheduling for Sets of Parallel Jobs with Fairness and Efficiency. Submitted.
10. 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.
11. 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.
12. Y. He, W.-J. Hsu, and C. E. Leiserson. Provably efficient two-level adaptive scheduling. In JSSPP, pages 1-32, Saint-Malo, France, 2006.
13. Y. Cao, H. Sun, and W.-J. Hsu. Malleable-Lab: A tool for evaluating adaptive online schedulers on malleable jobs. The 18th Euromicro International Conference on Parallel, Distributed and Network-Based Computing, pages 11-18, Piza, Italy, 2010.
14. 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)
15. H. Sun, Y. Cao, and W.-J. Hsu. Efficient Adaptive Scheduling of Multiprocessors with Stable Parallelism Feedback. To appear in IEEE Transactions on Parallel and Distributed Systems.
16. A. B. Downey. A parallel workload model and its implications for processor allocation. In HPDC, page 112, Portland, OR, USA, 1997.