๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Analysis of a Heuristic for Code Partitioning

โœ Scribed by Moez Ayed; Jean-Luc Gaudiot


Book ID
110258064
Publisher
Springer US
Year
1998
Tongue
English
Weight
229 KB
Volume
12
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An efficient heuristic for code partitio
โœ Moez Ayed; Jean-Luc Gaudiot ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 326 KB

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

A Mixed Heuristic for Circuit Partitioni
โœ C. Gil; J. Ortega; M.G. Montoya; R. Baรฑos ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 148 KB
A New Heuristic for Partitioning the Nod
โœ Barnes, Earl R.; Vannelli, Anthony; Walker, James Q. ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 525 KB