Task scheduling in distributed computing systems with a genetic algorithm

Research output: Contribution to conferencePaper

21 Citations (Scopus)

Abstract

Scheduling a directed acyclic graph (DAG) which represents the precedence relations of the tasks of a parallel program in a distributed computing system (DCS) is known as an NP-complete problem except for some special cases. Many heuristic-based methods have been proposed under various models and assumptions. A DCS can be classified in two types according to the characteristics of the processors on a network: a distributed homogeneous system (DHOS) and a distributed heterogeneous system (DHES). This paper defines a general model for a DHOS and a DHES and presents a genetic algorithm (GA) to solve the task scheduling problem in the defined DCS. The performance of the proposed GA is compared with the list scheduling algorithm in a DHOS and with the one-level reach-out greedy algorithm (OLROG) in a DHES. The proposed GA has shown better performance in various environments than other scheduling methods.

Original languageEnglish
Pages301-305
Number of pages5
Publication statusPublished - 1997 Jan 1
EventProceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97 - Seoul, South Korea
Duration: 1997 Apr 281997 May 2

Other

OtherProceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97
CitySeoul, South Korea
Period97/4/2897/5/2

Fingerprint

Distributed computer systems
Genetic algorithms
Scheduling
Scheduling algorithms
Computational complexity
Computer systems

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Cite this

Woo, S. H., Yang, S-B., Kim, S-D., & Han, T-D. (1997). Task scheduling in distributed computing systems with a genetic algorithm. 301-305. Paper presented at Proceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97, Seoul, South Korea, .
Woo, Sung Ho ; Yang, Sung-Bong ; Kim, Shin-Dug ; Han, Tack-Don. / Task scheduling in distributed computing systems with a genetic algorithm. Paper presented at Proceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97, Seoul, South Korea, .5 p.
@conference{c42baa31ed42494cacffad262e25d41f,
title = "Task scheduling in distributed computing systems with a genetic algorithm",
abstract = "Scheduling a directed acyclic graph (DAG) which represents the precedence relations of the tasks of a parallel program in a distributed computing system (DCS) is known as an NP-complete problem except for some special cases. Many heuristic-based methods have been proposed under various models and assumptions. A DCS can be classified in two types according to the characteristics of the processors on a network: a distributed homogeneous system (DHOS) and a distributed heterogeneous system (DHES). This paper defines a general model for a DHOS and a DHES and presents a genetic algorithm (GA) to solve the task scheduling problem in the defined DCS. The performance of the proposed GA is compared with the list scheduling algorithm in a DHOS and with the one-level reach-out greedy algorithm (OLROG) in a DHES. The proposed GA has shown better performance in various environments than other scheduling methods.",
author = "Woo, {Sung Ho} and Sung-Bong Yang and Shin-Dug Kim and Tack-Don Han",
year = "1997",
month = "1",
day = "1",
language = "English",
pages = "301--305",
note = "Proceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97 ; Conference date: 28-04-1997 Through 02-05-1997",

}

Woo, SH, Yang, S-B, Kim, S-D & Han, T-D 1997, 'Task scheduling in distributed computing systems with a genetic algorithm' Paper presented at Proceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97, Seoul, South Korea, 97/4/28 - 97/5/2, pp. 301-305.

Task scheduling in distributed computing systems with a genetic algorithm. / Woo, Sung Ho; Yang, Sung-Bong; Kim, Shin-Dug; Han, Tack-Don.

1997. 301-305 Paper presented at Proceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97, Seoul, South Korea, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Task scheduling in distributed computing systems with a genetic algorithm

AU - Woo, Sung Ho

AU - Yang, Sung-Bong

AU - Kim, Shin-Dug

AU - Han, Tack-Don

PY - 1997/1/1

Y1 - 1997/1/1

N2 - Scheduling a directed acyclic graph (DAG) which represents the precedence relations of the tasks of a parallel program in a distributed computing system (DCS) is known as an NP-complete problem except for some special cases. Many heuristic-based methods have been proposed under various models and assumptions. A DCS can be classified in two types according to the characteristics of the processors on a network: a distributed homogeneous system (DHOS) and a distributed heterogeneous system (DHES). This paper defines a general model for a DHOS and a DHES and presents a genetic algorithm (GA) to solve the task scheduling problem in the defined DCS. The performance of the proposed GA is compared with the list scheduling algorithm in a DHOS and with the one-level reach-out greedy algorithm (OLROG) in a DHES. The proposed GA has shown better performance in various environments than other scheduling methods.

AB - Scheduling a directed acyclic graph (DAG) which represents the precedence relations of the tasks of a parallel program in a distributed computing system (DCS) is known as an NP-complete problem except for some special cases. Many heuristic-based methods have been proposed under various models and assumptions. A DCS can be classified in two types according to the characteristics of the processors on a network: a distributed homogeneous system (DHOS) and a distributed heterogeneous system (DHES). This paper defines a general model for a DHOS and a DHES and presents a genetic algorithm (GA) to solve the task scheduling problem in the defined DCS. The performance of the proposed GA is compared with the list scheduling algorithm in a DHOS and with the one-level reach-out greedy algorithm (OLROG) in a DHES. The proposed GA has shown better performance in various environments than other scheduling methods.

UR - http://www.scopus.com/inward/record.url?scp=0030644038&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030644038&partnerID=8YFLogxK

M3 - Paper

SP - 301

EP - 305

ER -

Woo SH, Yang S-B, Kim S-D, Han T-D. Task scheduling in distributed computing systems with a genetic algorithm. 1997. Paper presented at Proceedings of the 1997 2nd High Performance Computing on the Information Superhighway, HPC Asia'97, Seoul, South Korea, .