Optimal parallel generation of a computation tree form
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel Generation of Postfix and Tree Forms
ACM Transactions on Programming Languages and Systems (TOPLAS)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Parallel Sorting Algorithms
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
A bibliography on parallel parsing
ACM SIGPLAN Notices
Efficient EREW PRAM Algorithms for Parentheses-Matching
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.98 |
Parallel algorithms for parsing expressions on mesh, shuffle, cube, and cube-connected cycle parallel computers are presented. With n processors, it requires O( square root n) time on the mesh-connected model and O(log/sup 2/ n) time on others. For the mesh-connected computer, the author uses a wrap-around row-major ordering. For the shuffle computer, he uses an extra connection between adjacent processors, and thus four connections per processor are required.