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

Multiprocessor scheduling algorithm utilizing linear clustering of directed acyclic graphs

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

2 Author(s)
Choung Shik Park ; Dept. of Electron. Eng., Inha Univ., Inchon, South Korea ; Sang Bang Choi

The multiprocessor scheduling is the method to allocate modules(or tasks) with precedence relationship onto the processors in such a way that the parallel time (completion time of a program in multiprocessor system) is minimized. In this paper, we propose a scheduling heuristic which is based on linear clustering scheme and uses only local information of a DAG (Directed Acyclic Graph). Proposed algorithm gives an optimal scheduling result for a coarse grain DAG with only fork or join nodes and a greatly reduced parallel time for general DAGs. Simulation results showed that proposed algorithm has better scheduling result and less algorithm execution time than any of compared algorithms

Published in:

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Date of Conference:

10-13 Dec 1997

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.