# Parallel Parsing of Arithmetic Expressions

Srikant, YN (1990) Parallel Parsing of Arithmetic Expressions. In: IEEE Transactions on Computers, 39 (1). pp. 130-132.

 Preview
PDF
parallel.pdf

Parallel algorithms for parsing expressions on mesh, shuffle, cube, and cube-connected cycle parallel computers are presented. With n processors, it requires $O(\sqrt{n})$ time on the mesh-connected model and $O(log^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