A Performance Evaluation of List Scheduling Heuristics for Task Graphs without Communication Costs

Authors:
Janez Brest;Viljem Zumer
Affiliations:
-;-
Venue:
ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
Year:
2000

Citing 0
Cited 3

Genetic-algorithm-based real-time task scheduling with multiple goals

Journal of Systems and Software - Special issue: Computer systems
Scheduler implementation in MP SoC design

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Coordinated concurrent memory accesses on a reconfigurable multimedia accelerator

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose three new static scheduling algorithms for allocating task graphs without communication costs to fully connected multiprocessors. Proposed algorithms, called MCP/ABS, MCP/CLR, and MCP/CLRR, are based on the well known MCP algorithm, and all of them have the same complexity of O(v2 log v), where v is the number of nodes in the task graph. A global comparison of proposed algorithms with three recently reported scheduling algorithms is carried out. The proposed algorithms generate similar or even better solutions than the previous algorithms in terms of the completion times of resulting schedules using a Prototype Standard Task Graph Set.