By Topic

An optimal parallel algorithm for arithmetic expression parsing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Weian Deng ; Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA ; Iyengar, S.S.

The paper discusses an optimal parallel algorithm for tree form generation of arithmetic expressions on an SIMD-SM EREW model. The main idea is how to avoid the read conflict posted by Bar-On and Vishkin's algorithm (1985) by modifying their parenthesis pairing algorithm

Published in:

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Date of Conference:

23-26 Mar 1992