Strength and Weaknesses of Genetic List Scheduling for Heterogeneous Systems

Authors:
Martin Grajcar
Affiliations:
-
Venue:
ACSD '01 Proceedings of the Second International Conference on Application of Concurrency to System Design
Year:
2001

Citing 0
Cited 4

Comparison of genetic representation schemes for scheduling soft real-time parallel applications

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Non-evolutionary algorithm for scheduling dependent tasks in distributed heterogeneous computing environments

Journal of Parallel and Distributed Computing
An architectural co-synthesis algorithm for energy-aware Network-on-Chip design

Journal of Systems Architecture: the EUROMICRO Journal
A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous processor networks

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

List scheduling combined with genetic algorithms has already been shown to be a powerful approach [6, 11 ]. We investigate the problems associated with using a list scheduler for a heterogeneous system. Furthermore, we present cases, from which most list schedulers fail to find the optimum. We propose and experimentally evaluate novel ideas avoiding it.