The Community for Technology Leaders
RSS Icon
Issue No.01 - January (1990 vol.39)
pp: 130-132
<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.N. Srikant, "Parallel Parsing of Arithmetic Expressions", IEEE Transactions on Computers, vol.39, no. 1, pp. 130-132, January 1990, doi:10.1109/12.46288
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool