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

Communication-optimal parallel parenthesis matching

โœ Scribed by Chun-Hsi Huang; Xin He; Min Qian

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
229 KB
Volume
32
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Simple Optimal Parallel Multiple Pattern
Simple Optimal Parallel Multiple Pattern Matching
โœ S Muthukrishnan ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 96 KB

In this paper, we present a simple algorithm for solving the multipattern matching problem, with optimal speedup. The best-known deterministic parallel algorithm for this problem also provides optimal speedup, but relies crucially on a sophisticated construction of an automaton. Since then, Rabin ha

An Optimal Parallel Matching Algorithm f
An Optimal Parallel Matching Algorithm for Cographs
โœ R. Lin; S. Olariu ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 865 KB

The class of cographs, or complement-reducible graphs, arises naturally in many different areas of applied mathematics and computer science. We show that the problem of finding a maximum matching in a cograph can be solved optimally in parallel by reducing it to parenthesis matching. With an \(n\)-v

Communication Optimizations for Parallel
Communication Optimizations for Parallel C Programs
โœ Yingchun Zhu; Laurie J. Hendren ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 661 KB

This paper presents algorithms for reducing the communication overhead for parallel C programs that use dynamically allocated data structures. The framework consists of an analysis phase called possible-placement analysis, and a transformation phase called communication selection. The fundamental id

Reducing communication overhead: A paral
Reducing communication overhead: A parallel code optimization
โœ Duane A. Bailey; Janice E. Cuny; Bruce B. MacLeod ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 872 KB

In highly parallel computation, where a large number of closely coupled processors cooperate on a single task, communication overhead is often the dominant factor in efficiency. We report here on parallel code optimixations designed to reduce this overhead. Our optimizations are targeted for synchro