Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Space-Sharing Scheduling Schemes for NOW with Heterogeneous Computing Power

이질적 계산 능력을 가진 NOW를 위한 공간 공유 스케쥴링 기법

  • Published : 2000.07.15
Download PDF
⟨ Previous Next ⟩

Abstract

NOW(Network of Workstations) is considered as a platform for running parallel programs by many people. One of the fundamental problems that must be addressed to achieve good performance for parallel programs on NOW is the determination of efficient job scheduling policies. Currently most research on NOW assumes that all the workstations in the NOW have the same processing power. In this paper we consider a NOW in which workstations may have different computing power. We introduce 10 classes of space sharing-based scheduling policies that can be applied to the NOW with heterogeneous computing power. We compare the performance of these scheduling policies by using the simulator which accepts synthetically generated sequential and parallel workloads and generates the response time and waiting time of parallel jobs as performance indices of various scheduling strategies. Through the experiments the case when a parallel program is partitioned heterogeneously in proportion to the computing power of workstations is shown to have better performance than when a parallel program is partitioned into parallel processes of the same size. When the owner returns to the workstation which is executing a parallel process, the policy which just lowers the priority of the parallel process shows better performance than the one which migrates the parallel process to a new idle workstation. Among the policies which use heterogeneous partitioning and process priority lowering, the adaptive policy performed best across the wide range of inter-arrival time of parallel programs but when the load imbalance among parallel processes becomes very high, the modified adaptive policy performed better.

NOW(Network of Workstations)는 병렬 프로그램들을 수행하기 위한 플랫폼으로 많이 고려되어지고 있다. NOW에서 병렬 프로그램이 좋은 성능으로 실행되기 위해 해결되어야할 기본적인 문제들 중 하나가 작업의 스케쥴링 문제를 효율적으로 결정하는 것이다. 현재 NOW에 관한 대부분의 연구는 NOW를 구성하는 모든 워크스테이션이 같은 처리 능력을 가지고 있다고 가정하고 있다. 본 논문에서는 NOW를 구성하는 워크스테이션들이 다른 계산 능력을 가지고 있는 것을 고려한다. 이질적인 계산 능력을 가지고 있는 워크스테이션들로 구성된 NOW에 적용할 수 있는 10가지 공간 분할 스케쥴링 방법을 제시하 고, 시뮬레이터를 통하여 이 스케쥴링 정책들을 비교한다. 시뮬레이터는 합성된 순차/병렬 부하를 입력으로 받아 병렬 작업의 응답 사간과 기다림 시간을 성능 지표로 발생시킨다. 실험 결과 워크스테이션의 계산 능력에 비례하여 병렬 프로그램을 이질적으로 분할하는 경우가 균등 분할하는 경우보다 성능이 우수함을 알 수 있었다. 병렬 프로세스를 수행하는 워크스테이션에 소유자가 돌아온 경우 병렬 프로세스를 새 유휴 워크스테이션에 이주하는 것보다는 단지 우선 순위를 낮추는 것이 높은 성능을 보여 주었다. 우선 순위 낮춤을 사용하는 이질적 분할의 경우 적응 할당 정책이 넓은 범위의 병렬 프로그램 도착시간에서 좋은 성능을 보이나 부하 불균형이 높아지는 경우 수정된 적응 할당 정책이 높은 성능을 보여준다 .

Keywords

References

  1. T. E. Anderson et al., 'A Case for NOW(Network of Workstation),' IEEE Micro, vol. 15, no. 1, pp. 54-64, February 1995 https://doi.org/10.1109/40.342018
  2. M. M. Mutka and M. Livny, 'The available capacity of a privately owned workstationenvironment,' Performance Evaluation, vol. 12, no. 4, pp. 269-284, July 1991 https://doi.org/10.1016/0166-5316(91)90005-N
  3. J. Arabe, A. Beguelin, B. Lowekamp, E. Seligman, M. Starkey, and P. Stephan, 'Dome: Parallel Programming in a Heterogeneous Multi-User Environment,' Proceedings of the International Parallel Processing Symposium, 1996 https://doi.org/10.1109/IPPS.1996.508061
  4. S.L. Au and S.P. Dandamudi, 'The Impact of Program Structure on the Performance ofScheduling Policies in Multiprocessor Systems,' Int. J. Computers and Their Applications, Vol. 3, No. 1, April 1996
  5. Y.-N. Chan et al., 'Experiences with Parallel Job Scheduling on a Transputer System,' Performance Evaluation Review, March 1999 https://doi.org/10.1145/309746.309753
  6. Young-Min Chang and Young-Chul Shim, 'Simulation- ased Analysis of the Performance of Parallel Programs in the NOW,' IASTED Int. Conf. on Parallel and Distributed Computer and Networks, 1998
  7. M. Mutka and M. Livny, 'The Available Capacity of a Privately Owned Workstation Environment,' Performance Evaluation, July 1991 https://doi.org/10.1016/0166-5316(91)90005-N
  8. Anurag Acharya, et al., 'The Utility of Exploiting Idle Workstations for Parallel Computation,' Proceedings of ACM SIGMETRICS '97, 1997 https://doi.org/10.1145/258612.258691
  9. D. G. Feitelson, 'Packing Schemes for Gang Scheduling,' In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), Springer-Verlag, 1996
  10. Y.N. Chan, S.P. Dandamudi, and S. Majumdar, 'Performance Comparison of Processor Scheduling Strategies in a Distributed-Memory Multicomputer Systems,' IEEE Int. Parallel Processing Symposium, 1997 https://doi.org/10.1109/IPPS.1997.580869
  11. Y.N. Chan, S.P. Dandamudi, and S. Majumdar, 'Experiences with Parallel Job Scheduling on Transputer System,' ACM SIGMETRICS Performance Evaluation Review, Vol. 26, No. 4, 1999 https://doi.org/10.1145/309746.309753
  12. C. McCann and J. Zahorjan, 'Processor Allocation Policies for Message-Passing Parallel Computers,' Proc. ACM SIGMETRICS Conference, May 1994 https://doi.org/10.1145/183018.183022
  13. M.S. Squillante, 'On the Benefits and Limitations of Dynamic Partitioning in Parallel Computer Systems,' Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science, Springer-Verlag, 1995
  14. D.G. Feitelson, L. Rudolph, U. Schwiegelshohn, K.C. Sevcik, and P. Wong, 'Theory and Practice in Parallel Job Scheduling,' Job Scheduling Strategies for Parallel Processing, D. Feitelson, L. Rudolph (eds.), Vol. 1291, Lecture Notes in Computer Science, Springer-Verlag, 1997
  15. E.W. Parsons and K.C. Sevcik, 'Coordinated Allocation of Memory and Processors in Multiprocessor,' Proc. ACM SIGMETRICS Conference, 1996 https://doi.org/10.1145/233013.233023
  16. Y. Yan, X. Zhang, and Y. Song, 'An Effective and Practical Performance Prediction Model for Parallel Computing on Non-Dedicated Heterogeneous NOW,' Journal of Parallel and Distributed Computing, Vol. 38, 1996 https://doi.org/10.1006/jpdc.1996.0129
  17. J.B. Weissman and X. Zhao, 'Run-time Support for Scheduling Parallel Applications in Heterogeneous NOWs,' IEEE Symp. on High Performance Distributed Computing, 1997, https://doi.org/10.1109/HPDC.1997.626442
  18. A. Downey and D. Feitelson, 'Elusive Goal of Workload Characterization,' Performance Evaluation Review, March 1999 https://doi.org/10.1145/309746.309750
  19. A.C. Dusseau et al, 'Effective Distributed Scheduling of Parallel Workloads,' ACM Int. Conf on Measurement and Modeling of Computer Systems, 1996 https://doi.org/10.1145/233008.233020
  20. L. W. Dowdy and M. R. Leuze, 'On Modeling Partitioned Multiprocessor Systems,' International Journal of High Speed Computing, Vol.6, No.1, 1994 https://doi.org/10.1142/S0129053394000032
  21. A.M. Vahdat, D.P. Ghormley, and T.E. Anderson, 'Efficient, Portable, and Robust Extension of Operating System Functionality,' Technical Report UCB//CSD- 4-842, University of California, Berkeley, 1994
  22. M. Harchol-Balter and A.B. Downey, 'Exploiting Process Lifetime Distributions for Dynamic Load Balancing,' Proceedings of ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, May 1996 https://doi.org/10.1145/233008.233019