An efficient heuristic for code partitioning

In this paper, we propose a heuristic for code partitioning for distributed memory multiprocessors (DMMs). Our method is data-flow based where all levels of parallelism can potentially be exploited. Given a weighted directed acyclic graph (DAG) representation of the program, our partitioning algorit...

Full description

Saved in:

Bibliographic Details
Published in:	Parallel computing Vol. 26; no. 4; pp. 399 - 426
Main Authors:	Ayed, Moez, Gaudiot, Jean-Luc
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2000
Subjects:	Critical path Directed acyclic graph (DAG) Distributed memory multiprocessor (DMM) Partition Processing element (PE) Task Task clustering Task graph Task merging Distributed memory multiprocessor (DMM) Partition Task Processing element (PE) Directed acyclic graph (DAG) Task graph Critical path Task merging Task clustering
ISSN:	0167-8191, 1872-7336
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!