Work

Highly parallelizable problems

Year: 1989

Type: conference-paper

Abstract: of Results.We establish that several problems are highly parallelizable.For each of these problems, we design an optimal 0 (loglogn ) time parallel algorithm on the Common CRCW PRAM model which is the weakest among the CRCW PRAM models.These problems include: 0 all nearest smaller values, l preprocessing for answering range maxima queries, l several problems in Computational Geometry, l string matching.

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/73007.73036

Authors: O. Berkman, Z. Galil, B. Schieber, U. Vishkin

Institutions: Tel Aviv University, University of Maryland, College Park, Columbia University, IBM Research - Thomas J. Watson Research Center

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, York University, Office of Naval Research

Awards: The Design of Efficient Algorithms and Proving Lower Bounds (An Accomplishment Based Renewal), G8876996369