By Topic

Global execution time minimization by allocating tasks in parallel systems

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)
Coli, M. ; Dipartimento di Ingegneria Elettronica, Universita La Sapienza, Rome, Italy ; Palazzari, P.

We have studied the allocation of directed acyclic graphs (DAGs) into a given parallel machine (PM); this is an NP-complete problem. Previous papers presented allocation algorithms all making many rough simplifications so that the achieved allocations are too far from the optimum and do not minimize the actual execution time of the program. We analyzed the impact of the precedence relations on the execution time of DAG into PM issuing a new cost function (fPR) which takes into account both the PM topology and the precedence relations. fPR is minimized through a genetic algorithm and, in order to speed up its convergence, we developed a heuristic criterion, based on the critical path idea, for the choice of the starting population. The best results achievable using our cost function have been illustrated by comparing the actual execution times of the allocation given by the minimization of fPR with the ones obtained using the allocations given by the minimization of two cost functions described in literature

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Euromicro Workshop on

Date of Conference:

25-27 Jan 1995