𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines

✍ Scribed by Thomas M. Keane; Andrew J. Page; Thomas J. Naughton; Simon A.A. Travers; James O. McInerney

Book ID
106148699
Publisher
Springer
Year
2006
Tongue
English
Weight
271 KB
Volume
45
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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

Random Data Accesses on a Coarse-Grained
Random Data Accesses on a Coarse-Grained Parallel Machine II. One-to-Many and Many-to-One Mappings
✍ Ravi V. Shankar; Sanjay Ranka πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 290 KB

This paper describes deterministic communication-efficient algorithms for performing random data accesses with hot spots on a coarse-grained parallel machine. The general random access read-write operations with hot spots can be completed in CΒ΅n/p (+ lower order terms) time and is optimal and scalab