Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Optimal parallel suffix-prefix matching algorithm and applications
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A bridging model for parallel computation
Communications of the ACM
Discrete Applied Mathematics
An optimal O(log n)time parallel string matching algorithm
SIAM Journal on Computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Parallel sorting with limited bandwidth
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
All Nearest Smaller Values on the Hypercube
IEEE Transactions on Parallel and Distributed Systems
Parallel computation: models and methods
Parallel computation: models and methods
Communication efficient BSP algorithm for all nearest smaller values problem
Journal of Parallel and Distributed Computing
Synthesis of Parallel Algorithms
Synthesis of Parallel Algorithms
Introduction to Algorithms
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers
| Hi-index | 0.02 |
We provide the first non-trivial lower bound, p - 3/p 驴 n/p, where p is the number of the processors and n is the data size, on the average-case communication volume, 驴, required to solve the parenthesis matching problem and present a parallel algorithm that takes linear (optimal) computation time and optimal expected message volume, 驴 + p.The kernel of the algorithm is to solve the all nearest smaller values problem. Provided n/p = 驴(p), we present an algorithm that achieves optimal sequential computation time and uses only a constant number of communication phases, with the message volume in each phase bounded above by (n/p + p) in the worst case and p in the average case, assuming the input instances are uniformly distributed.