✦ LIBER ✦

The Complexity of Parallel Multisearch on Coarse-Grained Machines

✍ Scribed by Bäumker, A.; Dittrich, W.; Pietracaprina, A.

Book ID: 113012360
Publisher: Springer
Year: 1999
Tongue: English
Weight: 200 KB
Volume: 24
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00008261

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Building Large Phylogenetic Trees on Coa

Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines

✍ Thomas M. Keane; Andrew J. Page; Thomas J. Naughton; Simon A.A. Travers; James O 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 271 KB

Solving large FPT problems on coarse-gra

Solving large FPT problems on coarse-grained parallel machines

✍ James Cheetham; Frank Dehne; Andrew Rau-Chaplin; Ulrike Stege; Peter J. Taillon 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 208 KB

Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with previous methods. In this paper, we show how to enhance this approach through the addition of parallelism, thereby allow

Parallelizing image feature extraction o

Parallelizing image feature extraction on coarse-grain machines

✍ Yongwha Chung; Prasanna, V.K. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 228 KB

Parallel Coarse Grain Computing of Boltz

Parallel Coarse Grain Computing of Boltzmann Machines

✍ Julio Ortega; Ignacio Rojas; Antonio F. Diaz; Alberto Prieto 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 262 KB

On Estimating Machine Dependency of Fine

On Estimating Machine Dependency of Fine– and Coarse–Grained Parallel Structural Computations

✍ W. J. Watkins; D. Kennedy; F. W. Williams 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

Random Data Accesses on a Coarse-Grained

Random Data Accesses on a Coarse-Grained Parallel Machine I. One-to-One Mappings

✍ Ravi V. Shankar; Sanjay Ranka 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 271 KB

This paper describes deterministic communication-efficient algorithms for performing dynamic permutations on a coarsegrained parallel machine. Our analysis shows that the general permutation operation can be completed in Cµn/p (+ lower order terms) time and is optimal and scalable provided n >> p 3