This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Recognition and Parsing on the Hypercube
June 1991 (vol. 40 no. 6)
pp. 764-770

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.

[1] A. Aho, J. Hopcroft, and J. Ullman,Data Structures and Algorithms. Reading, MA: Addison-Wesley, 1983.
[2] A. V. Aho and J. D. Ullman,The Theory of Parsing, Translation, and Compiling, Vol. 1: Parsing. Englewood Cliffs, NJ: Prentice-Hall, 1972.
[3] T. F. Chan and Y. Saad, "Multigrid algorithms on the hypercube multiprocessor,"IEEE Trans. Comput., vol. C-35, no. 11, pp. 969-977, Nov. 1986.
[4] J. H. Chang, O. H. Ibarra, and M. A. Palis, "Parallel parsing on a one-way array of finite-state machines,"IEEE Trans. Comput., vol. C-36, no. 1, pp. 64-75, Jan. 1987.
[5] Y. T. Chiang and K. S. Fu, "Parallel parsing algorithms and VLSI implementations for syntactic pattern recognition,"IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-6, no. 3, May 1984.
[6] S. L. Graham, M. A. Harrison, and W. L. Ruzzo, "On-line context-free language recognition in less than cubic time," inProc 8th ACM Symp. Theory Comput., 1976.
[7] L. J. Guibas, H. T. Kung, and C. D. Thompson, "Direct VLSI implementation of combinatorial algorithms," inProc. Caltech Conf. VLSI, 1979, pp. 509-525.
[8] J. P. Hayes, T. N. Mudge, Q. F. Stout, S. Colley, and J. Palmer, "Architecture of a hypercube supercomputer," inProc 1986 Int. Conf. Parallel Processing, 1986, pp. 653-660.
[9] O. H. Ibarra and S. M. Sohn, "On mapping systolic algorithms onto the hypercube," inProc. 1989 Int. Conf. Parallel Processing, 1989, to be published.
[10] S. Kosaraju, "Speed of recognition of context-free languages by array automata,"SIAM J. Comput., vol. 4, no. 3, pp. 331-340, Sept. 1975.
[11] G. Li and B. W. Wah, "Systolic processing for dynamic programming problems," inProc. 1985 Int. Conf. Parallel Processing, 1985, pp. 434-441.
[12] R. Sedgewick,Algorithms. Reading, MA: Addison-Wesley, 1983, pp. 486-489.
[13] P. Varman and V. Ramakrishnan, "Dynamic programming and transitive closure on linear pipelines," inProc. 1984 Int. Conf. Parallel Processing, 1984, pp. 359-364.
[14] R. Weicker, "General context free language recognition by a RAM with uniform cost criterion in timen2logn," Tech. Rep. 182, Dep. Comput. Sci., Penn. State Univ., Feb. 1976.

Index Terms:
parallel recognition; time bounds; parsing; hypercube; parallel algorithms; context-free languages; sequential dynamic programming algorithm; nonoverlapping interprocessor data transmissions; space bounds; 64-node NCUBE/7 MIMD hypercube machine; polygon triangulation problem; matrix product chain problem; context-free languages; grammars; parallel algorithms.
Citation:
O.H. Ibarra, T.-C. Pong, S.M. Sohn, "Parallel Recognition and Parsing on the Hypercube," IEEE Transactions on Computers, vol. 40, no. 6, pp. 764-770, June 1991, doi:10.1109/12.90253
Usage of this product signifies your acceptance of the Terms of Use.