Scheduling Algorithm Based on Force Directed Clustering

This paper describes a new task scheduling algorithm based on clustering. In this new approach, clustering of the tasks is achieved by applying a force model to the task graph. From an initial configuration of the task graph, forces act upon the nodes to manoeuvre them into a low energy or equilibri...

Full description

Saved in:
Bibliographic Details
Published in2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies pp. 311 - 318
Main Authors Palmer, A., Sinnen, O.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2008
Subjects
Application software
Clustering algorithms
Cost function
Distributed computing
Energy states
Heuristic algorithms
Processor scheduling
Scheduling algorithm
Springs
Visualization
Online AccessGet full text

Cover

More Information
Summary:This paper describes a new task scheduling algorithm based on clustering. In this new approach, clustering of the tasks is achieved by applying a force model to the task graph. From an initial configuration of the task graph, forces act upon the nodes to manoeuvre them into a low energy or equilibrium state. Clusters are created from the equilibrium state and scheduled for an unlimited number of processors. This algorithm is compared in an extensive experimental evaluation to three other clustering algorithms namely, linear, single edge and dominant sequence clustering. By keeping the mapping and scheduling phases of the algorithms identical, we compare only the difference in clustering between all algorithms. Results show that force directed clustering is very promising, especially for a limited number of processors.
ISBN:9780769534435
0769534430
ISSN:2379-5352
DOI:10.1109/PDCAT.2008.89