Browse > Article

Generic Scheduling Method for Distributed Parallel Systems  

Kim, Hwa-Sung (광운대학교 전자공학부 네트워크 컴퓨팅 연구실)
Abstract
This paper presents the Genetic Algorithm based Task Scheduling (GATS) method for the scheduling of programs with diverse embedded parallelism types in Distributed Parallel Systems, which consist of a set of loosely coupled parallel and vector machines connected via high speed networks The distributed parallel processing tries to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. When scheduling in distributed parallel systems, the matching of the parallelism characteristics between tasks and parallel machines rather than load balancing should be carefully handled with the minimization of communication cost in order to obtain more speedup. This paper proposes the based initialization methods for an initial population and the knowledge-based mutation methods to accommodate the parallelism type matching in genetic algorithms.
Keywords
Citations & Related Records
연도 인용수 순위
  • Reference
1 H.S Kim, '고속 네트웍 기반의 분산병렬 시스템에서의 성능 향상 분석 모델', 한국통신학회 논문지 제 26권 제 12호C, Dec. 2001, pp.218-224
2 Mitsuo Gen, Genetic Algorithms & Eng. Optimization: John Wiley & Sons, 2000
3 H.S Kim, S.M Kang, 'List Scheduling in High Speed Network based Distributed Parallel Systems', ICACT 2000, Feb. 2000, pp. 491-496
4 Van Laarhoven and E.H. Aans, Simulated Annealing: Theory and Applications, The Netherlands, 1988
5 T.L. Adam, K.M. Chandy and J.R.Dickinson,'Comparison of List Schedules for Parallel Processing Systems' Communications of the ACM, Dec. 1974, pp. 685-690
6 H. S Kim, 'Web/Java 기반의 고성능 분산 컴퓨팅 패러다임', 한국전자통신연구원 주간기술동향 포커스 논문, TIS-97-42 820호, 1997, pp. 16-31
7 G. Robertson, 'Parallel Implementation of Genetic Algorithms in a Classifier System', Genetic Algorithms and Simulated Annealing, edited by L. Davis, Morgan Kaufmann, 1987, pp. 129-140