✦ LIBER ✦

Analysis of Heuristics for Number Partitioning

✍ Scribed by Ian P. Gent; Toby Walsh

Book ID: 108507802
Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 247 KB
Volume: 14
Category: Article
ISSN: 0824-7935
DOI: 10.1111/0824-7935.00069

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of a Heuristic for Code Partiti

Analysis of a Heuristic for Code Partitioning

✍ Moez Ayed; Jean-Luc Gaudiot 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 229 KB

Constructing Test Cases for Partitioning

Constructing Test Cases for Partitioning Heuristics

✍ Krishnamurthy, Balakrishnan 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 779 KB

Partitioning heuristics for two geometri

Partitioning heuristics for two geometric maximization problems

✍ M.E Dyer; A.M Frieze; C.J.H McDiarmid 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Set partitioning based heuristics for in

Set partitioning based heuristics for interactive routing

✍ Frank H. Cullen; John J. Jarvis; H. Donald Ratliff 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 880 KB

A Mixed Heuristic for Circuit Partitioni

A Mixed Heuristic for Circuit Partitioning

✍ C. Gil; J. Ortega; M.G. Montoya; R. Baños 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 148 KB

An efficient heuristic for code partitio

An efficient heuristic for code partitioning

✍ 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