Title :
Parallel parsing of arithmetic expressions
Author_Institution :
Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
fDate :
1/1/1990 12:00:00 AM
Abstract :
Parallel algorithms for parsing expressions on mesh, shuffle, cube, and cube-connected cycle parallel computers are presented. With n processors, it requires O(√n) time on the mesh-connected model and O(log2 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
Keywords :
grammars; parallel algorithms; arithmetic expressions; cube; cube-connected cycle parallel computers; mesh; mesh-connected model; parallel algorithms; parsing; shuffle; shuffle computer; wrap-around row-major ordering; Algorithm design and analysis; Computational modeling; Computer architecture; Computer simulation; Delay effects; Digital arithmetic;
Journal_Title :
Computers, IEEE Transactions on
