Issue No. 01 - January (1990 vol. 39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.46288
<p>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.</p>
parallel algorithms; arithmetic expressions; parsing; mesh; shuffle; cube; cube-connected cycle parallel computers; mesh-connected model; wrap-around row-major ordering; shuffle computer; grammars; parallel algorithms.
Y. Srikant, "Parallel Parsing of Arithmetic Expressions," in IEEE Transactions on Computers, vol. 39, no. , pp. 130-132, 1990.