Cart (Loading....) | Create Account
Close category search window

GTCS: a Greedy Task Clustering and Scheduling algorithm for distributed memory processor architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Banjong Piyatamrong ; Dept. of Comput. Eng., King Mongkut''s Inst. of Technol., Bangkok, Thailand ; Ohara, S. ; Kantakajorn, S.

Presents a task-clustering algorithm named GTCS (Greedy Task Clustering and Scheduling). The algorithm represents the tasks of a parallel program as nodes and schedules them with a directed acyclic task graph (DAG). The parallel hardware architecture focused on in this paper is the distributed memory architecture. GTCS implements the task-clustering method by partitioning the nodes on a DAG. Each group or cluster within the DAG is placed on only one processor. The algorithm partitions the DAG into several clusters to reduce the communication overhead between the processors, because the network has a lot of communication overhead, which increases the total execution time or makespan of the tasks, especially in parallel programs that perform fine-grained tasks on a network. The GTCS algorithm produces a schedule whose makespan is at most twice that of the optimal cluster. GTCS has a time complexity equal to O[m(|V|/spl middot/lg|V|+|E|)] where m is the number of clusters and 1/spl les/m/spl les/V.

Published in:

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on  (Volume:1 )

Date of Conference:

14-17 May 2000

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.