The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2011 vol.22)
pp: 594-607
Hongyang Sun , Nanyang Technological University, Singapore
Yangjie Cao , Xi'an Jiaotong University, Xi'an
Wen-Jing Hsu , Nanyang Technological University, Singapore
ABSTRACT
With proliferation of multicore computers and multiprocessor systems, an imminent challenge is to efficiently schedule parallel applications on these resources. In contrast to conventional static scheduling, adaptive schedulers that dynamically allocate processors to jobs possess good potential for improving processor utilization and speeding up job's execution. In this paper, we focus on adaptive scheduling of malleable jobs with periodic processor reallocations based on parallelism feedback of the jobs and allocation policy of the system. We present an efficient adaptive scheduler Acdeq that provides parallelism feedback using an adaptive controller A-Control and allocates processors based on the well-known Dynamic Equipartitioning algorithm (Deq). Compared to A-Greedy, an existing adaptive scheduler that experiences feedback instability thus incurs unnecessary scheduling overheads, we show that A-Control achieves much more stable feedback among other desirable control-theoretic properties. Furthermore, we analyze algorithmically the performances of Acdeq in terms of its response time and processor waste for an individual job as well as makespan and total response time for a set of jobs. To the best of our knowledge, Acdeq is the first multiprocessor scheduling algorithm that offers both control-theoretic and algorithmic guarantees. We further evaluate Acdeq via simulations by using Downey's parallel job model augmented with internal parallelism variations. The results confirm its improved performances over Agdeq, and they show that Acdeq excels especially when the scheduling overhead becomes high.
INDEX TERMS
Adaptive scheduling, competitive analysis, control-theoretic analysis, malleable parallel jobs, multiprocessors, nonclairvoyant scheduling, parallelism feedback, stability, two-level scheduling.
CITATION
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu, "Efficient Adaptive Scheduling of Multiprocessors with Stable Parallelism Feedback", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 4, pp. 594-607, April 2011, doi:10.1109/TPDS.2010.121
REFERENCES
[1] K. Agrawal, Y. He, W.J. Hsu, and C.E. Leiserson, "Adaptive Scheduling with Parallelism Feedback," Proc. ACM SIGPLAN Symp. Principles and Practice of Parallel Programming (PPoPP), pp. 100-109, 2006.
[2] K. Agrawal, Y. He, and C.E. Leiserson, "An Empirical Evaluation of Work Stealing with Parallelism Feedback," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), pp. 19-29, 2006.
[3] K. Agrawal, Y. He, and C.E. Leiserson, "Adaptive Work Stealing with Parallelism Feedback," Proc. ACM SIGPLAN Symp. Principles and Practice of Parallel Programming (PPoPP), pp. 112-120, 2007.
[4] N.S. Arora, R.D. Blumofe, and C.G. Plaxton, "Thread Scheduling for Multiprogrammed Multiprocessors," Proc. Symp. Parallel Algorithms and Architectures (SPAA), pp. 119-129, Sept. 1998.
[5] K.J. Åström and B. Wittenmark, Adaptive Control. Addison-Wesley, 1989.
[6] R.D. Blumofe and C.E. Leiserson, "Scheduling Multithreaded Computations by Work Stealing," J. ACM, vol. 46, no. 5, pp. 720-748, 1999.
[7] A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge Univ. Press, 1998.
[8] T. Brecht, X. Deng, and N. Gu, "Competitive Dynamic Multiprocessor Allocation for Parallel Applications," Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS), pp. 448-455, 1995.
[9] P. Brucker, Scheduling Algorithms. Springer-Verlag, 2001.
[10] M. Calzarossa, A.P. Merlo, D. Tessera, G. Haring, and G. Kotsis, "A Hierarchical Approach to Workload Characterization for Parallel Systems," Proc. Int'l Conf. and Exhibition High-Performance Computing and Networking (HPCN), pp. 102-109, 1995.
[11] W. Cirne and F. Berman, "A Model for Moldable Supercomputer Jobs," Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS), p. 59, 2001.
[12] J. Corbálan, X. Martorell, and J. Labarta, "Performance-Driven Processor Allocation," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 7, pp. 599-611, July 2005.
[13] X. Deng and P. Dymond, "On Multiprocessor System Scheduling," Proc. Symp. Parallel Algorithms and Architectures (SPAA), pp. 82-88, 1996.
[14] X. Deng, N. Gu, T. Brecht, and K. Lu, "Preemptive Scheduling of Parallel Jobs on Multiprocessors," Proc. Symp. Discete Algorithms (SODA) , pp. 159-167, 1996.
[15] A.B. Downey, "A Parallel Workload Model and Its Implications for Processor Allocation," Proc. Int'l Symp. High Performance Distributed Computing (HPDC), p. 112, 1997.
[16] J. Edmonds, "Scheduling in the Dark," Proc. Symp. Theory of Computing (STOC), pp. 179-188, 1999.
[17] J. Edmonds, D.D. Chinn, T. Brecht, and X. Deng, "Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics," Proc. Symp. Theory of Computing (STOC), pp. 120-129, 1997.
[18] J. Edmonds and K. Pruhs, "Scalably Scheduling Processes with Arbitrary Speedup Curves," Proc. Symp. Discrete Algorithms, pp. 685-692, 2009.
[19] D.G. Feitelson, "Packing Schemes for Gang Scheduling," Proc. Job Scheduling Strategies for Parallel Processing (JSSPP) Workshop, pp. 89-110, 1996.
[20] D.G. Feitelson, "Job Scheduling in Multiprogrammed Parallel Systems (Extended Version)," Research Report RC19790(87657), IBM , Second Revision, 1997.
[21] D.G. Feitelson and L. Rudolph, "Metrics and Benchmarking for Parallel Job Scheduling," Proc. Job Scheduling Strategies for Parallel Processing (JSSPP) Workshop, pp. 1-24, 1998.
[22] A. Goel, J. Walpole, and M. Shor, "Real-Rate Scheduling," Proc. Real-Time Application Symp. (RTAS), pp. 434-441, 2004.
[23] R.L. Graham, "Bounds on Multiprocessing Anomalies," SIAM J. Applied Math., vol. 17, no. 2, pp. 416-429, 1969.
[24] Y. He, W.J. Hsu, and C.E. Leiserson, "Provably Efficient Two-Level Adaptive Scheduling," Proc. Job Scheduling Strategies for Parallel Processing (JSSPP) Symp., pp. 1-32, 2006.
[25] Y. He, W.J. Hsu, and C.E. Leiserson, "Provably Efficient Online Non-Clairvoyant Adaptive Scheduling," Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS), pp. 1-10, 2007.
[26] Y. He, H. Sun, and W.J. Hsu, "Improved Results for Scheduling Batched Parallel Jobs by Using a Generalized Analysis Framework," J. Parallel and Distributed Computing, vol. 70, 2009. pp. 173-182.
[27] Y. He, H. Sun, and W.J. Hsu, "Adaptive Scheduling of Parallel Jobs on Functionally Heterogeneous Resources," Proc. Int'l Conf. Parallel Processing (ICPP), p. 43, 2007.
[28] J.L. Hellerstein, Y. Diao, S. Parekh, and D. Tilbury, Feedback Control of Computing Systems. Wiley-Interscience, 2004.
[29] J. Jann, P. Pattnaik, H. Franke, F. Wang, J. Skovira, and J. Riordan, "Modeling of Workload in MPPs," Proc. Job Scheduling Strategies for Parallel Processing (JSSPP) Workshop, pp. 95-116, 1997.
[30] B. Kalyanasundaram and K. Pruhs, "Speed is as Powerful as Clairvoyance," Foundations of Computer Science, pp. 214-221, Springer 1995.
[31] M. Kumar, "Measuring Parallelism in Computation-Intensive Scientific/Engineering Applications," IEEE Trans. Computers, vol. 37, no. 9, pp. 1088-1098, Sept. 1988.
[32] T.W. Lam, L.K. Lee, I.K.K. To, and P.W.H. Wong, "Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count," Proc. European Symp. Algorithms (ESA), pp. 647-659, 2008.
[33] X. Liu, X. Zhu, S. Singhal, and M. Arlitt, "Adaptive Entitlement Control of Resource Containers on Shared Servers," Proc. IFIP/IEEE Int'l Symp. Integrated Network Management, pp. 163-176, 2005.
[34] C. Lu, T.F. Abdelzaher, J.A. Stankovic, and S.H. Son, "A Feedback Control Approach for Guaranteeing Relative Delays in Web Servers," Proc. Real-Time Technology Applications Symp. (RTAS), pp. 51-62, 2001.
[35] C. Lu, J.A. Stankovic, S.H. Son, and G. Tao, "Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms," Real-Time Systems, vol. 23, nos. 1/2, pp. 85-126, 2002.
[36] U. Lublin and D.G. Feitelson, "The Workload on Parallel Supercomputers: Modeling the Characteristics of Rigid Jobs," J. Parallel and Distributed Computing, vol. 63, no. 11, pp. 1105-1122, 2003.
[37] C. McCann, R. Vaswani, and J. Zahorjan, "A Dynamic Processor Allocation Policy for Multiprogrammed Shared-Memory Multiprocessors," ACM Trans. Computer Systems, vol. 11, no. 2, pp. 146-178, 1993.
[38] R. Motwani, S. Phillips, and E. Torng, "Non-Clairvoyant Scheduling," Proc. Symp. Discete Algorithms (SODA), pp. 422-431, 1993.
[39] T.D. Nguyen, R. Vaswani, and J. Zahorjan, "Maximizing Speedup through Self-Tuning of Processor Allocation," Proc. Int'l Parallel Processing Symp. (IPPS), pp. 463-468, 1996.
[40] P. Padala, K.G. Shin, X. Zhu, M. Uysal, Z. Wang, S. Singhal, A. Merchant, and K. Salem, "Adaptive Control of Virtualized Resources in Utility Computing Environments," Proc. European Conf. Computer Systems (EuroSys), pp. 289-302, 2007.
[41] C.A. Phillips, C. Stein, E. Torng, and J. Wein, "Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract)," Proc. Symp. Theory of Computing (STOC), pp. 140-149, 1997.
[42] K. Pruhs, "Competitive Online Scheduling for Server Systems," ACM SIGMETRICS Performance Evaluation Rev., vol. 34, no. 4, pp. 52-58, 2007.
[43] C.J. Ribbens and R. Sudarsan, "ReSHAPE: A Framework for Dynamic Resizing and Scheduling of Homogeneous Applications in a Parallel Environment," Proc. Int'l Conf. Parallel Processing (ICPP), p. 44, 2007.
[44] J. Robert and N. Schabanel, "Non-Clairvoyant Batch Set Scheduling: Fairness Is Fair Enough," Proc. European Symp. Algorithms (ESA), pp. 741-753, 2007.
[45] S. Sen, "Dynamic Processor Allocation for Adaptively Parallel Jobs," master's thesis, Massachusetts Inst. of Tech nology, 2004.
[46] H. Sun, Y. Cao, and W.J. Hsu, "Competitive Two-Level Adaptive Scheduling Using Resource Augmentation," Proc. Job Scheduling Strategies Parallel Processing (JSSPP) Workshop, pp. 1-25, 2009.
[47] H. Sun and W.J. Hsu, "Adaptive B-Greedy (ABG): A Simple Yet Efficient Scheduling Algorithm," Proc. Int'l Workshop System Management Techniques, Processes, and Services (SMTPS) in Conjunction with Int'l Parallel and Distributed Processing Symp. (IPDPS), pp. 1-8, 2008.
[48] A. Tucker and A. Gupta, "Process Control and Scheduling Issues for Multiprogrammed Shared-Memory Multiprocessors," Proc. Symp. Operating Systems Principles (SOSP), pp. 159-166, 1989.
[49] Z. Wang, X. Zhu, and S. Singhal, "Utilization vs. SLO-Based Control for Dynamic Sizing of Resource Partitions," Proc. Distributed Systems: Operations and Management (DSOM) Workshop, pp. 133-144, 2005.
[50] J.B. Weissman, L.R. Abburi, and D. England, "Integrated Scheduling: The Best of Both Worlds," J. Parallel and Distributed Computing, vol. 63, no. 6, pp. 649-668, 2003.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool