Affiliation:
1. Purdue Univ., West Lfayette, IN
2. The Johns Hopkins Univ., Baltimore, MD
Abstract
Given an off-line sequence
S
of
n
set-manipulation operations, we investigate the parallel complexity of evaluating
S
(i.e., finding the response to every operation in
S
and returning the resulting set). We show that the problem of evaluating
S
is in
NC
for various combinations of common set-manipulation operations. Once we establish membership in
NC
(or, if membership in
NC
is obvious), we develop techniques for improving the time and/or processor complexity.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference32 articles.
1. A simple parallel tree contraction algorithm
2. ~AHO A. V. HOPCRAFT J. E. AND ULLMAN J. D. 1974. The Design and Analysts of Computer ~~418orithms. Addison-Wesley Reading Mass. ~AHO A. V. HOPCRAFT J. E. AND ULLMAN J. D. 1974. The Design and Analysts of Computer ~~418orithms. Addison-Wesley Reading Mass.
3. ~AJTAI M.~ KOMLOS J. AND SZEMEREDI E. Sorting in c log n parallel steps. Cornbinatorica 3 ~I t9. 10.1007/BF02579338 ~AJTAI M.~ KOMLOS J. AND SZEMEREDI E. Sorting in c log n parallel steps. Cornbinatorica 3 ~I t9. 10.1007/BF02579338
4. Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
5. Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献