Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
Parallel parsing on a one-way array of finite-state machines
IEEE Transactions on Computers
Data Structures and Algorithms
Data Structures and Algorithms
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
On line context free language recognition in less than cubic time(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A bibliography on parallel parsing
ACM SIGPLAN Notices
All-To-All Broadcast and Matrix Multiplication in Faulty SIMD Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Efficient reconfigurable embedded parsers
Computer Languages, Systems and Structures
A platform for the automatic generation of attribute evaluation hardware systems
Computer Languages, Systems and Structures
| Hi-index | 14.98 |
The authors present parallel algorithms for recognizing and parsing context-free languages on the hypercube. This algorithm is both time-wise and space-wise optimal with respect to the usual sequential dynamic programming algorithm. Also, the number of nonoverlapping interprocessor data transmissions for the recognition phase is small. It is noted that this is desirable since communication cost in reality is a function of the number of transmissions as well as transmission length. The authors present another recognition algorithm that achieves the same time and space bounds but employs a dynamic loading balancing technique to increase processor utilization. The results of implementing these algorithms on a 64-node NCUBE/7 MIMD hypercube machine are also given. The experimental evidence indicates that, while both recognition algorithms exhibit acceptable speedups, using load balancing results in significantly better performance. The authors obtain parallel algorithms with the same time and space bounds as above for the polygon triangulation problem and the matrix product chain problem.