✦ LIBER ✦

An efficient profile-based algorithm for scratchpad memory partitioning

✍ Scribed by Angiolini, F.; Benini, L.; Caprara, A.

Book ID: 117907419
Publisher: IEEE
Year: 2005
Tongue: English
Weight: 1010 KB
Volume: 24
Category: Article
ISSN: 0278-0070
DOI: 10.1109/tcad.2005.852299

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient clustering algorithm for pa

An efficient clustering algorithm for partitioning parallel programs

✍ Piyush Maheshwari; Hong Shen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 254 KB

This paper presents a clustering algorithm that partitions node-labelled and edge-labelled Ž . directed acyclic precedence graphs APG into clusters such that all the clusters have balanced amount of computation load and there is only one communication path between any pair of clusters. The algorithm

An efficient algorithm for partitioning

An efficient algorithm for partitioning an oriented graph into bicomponents

✍ L. Ya. Leifman 📂 Article 📅 1968 🏛 Springer US 🌐 English ⚖ 359 KB

An efficient algorithm for the complete

An efficient algorithm for the complete set partitioning problem

✍ Chien-Hua M. Lin; Harvey M. Salkin 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 439 KB

An efficient memetic algorithm for the g

An efficient memetic algorithm for the graph partitioning problem

✍ Philippe Galinier; Zied Boujbel; Michael Coutinho Fernandes 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 619 KB

Efficient heuristic algorithms for path-

Efficient heuristic algorithms for path-based hardware/software partitioning

✍ Jigang Wu; Thambipillai Srikanthan; Ting Lei 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 606 KB

An efficient parallel sorting algorithm

An efficient parallel sorting algorithm for shared memory multiprocessors

✍ M. Wheat; D.J. Evans 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 498 KB