Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

# 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

## Abstract

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

Item Type: Journal Article Ã�Â�Ã�Â©1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Arithmetic expressions; Parallel processing; Parsing Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation) 10 Nov 2005 19 Sep 2010 04:20 http://eprints.iisc.ernet.in/id/eprint/3907

### Actions (login required)

 View Item