Generic Scheduling Method for Distributed Parallel Systems 


Vol. 28,  No. 1, pp. 27-33, Jan.  2003


PDF
  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

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Kim, "Generic Scheduling Method for Distributed Parallel Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 1, pp. 27-33, 2003. DOI: .

[ACM Style]

Hwa-sung Kim. 2003. Generic Scheduling Method for Distributed Parallel Systems. The Journal of Korean Institute of Communications and Information Sciences, 28, 1, (2003), 27-33. DOI: .

[KICS Style]

Hwa-sung Kim, "Generic Scheduling Method for Distributed Parallel Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 1, pp. 27-33, 1. 2003.