DocumentCode
3204465
Title
An optimal parallel algorithm for arithmetic expression parsing
Author
Deng, Weian ; Iyengar, S. Sitharama
Author_Institution
Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA
fYear
1992
fDate
23-26 Mar 1992
Firstpage
212
Lastpage
215
Abstract
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
Keywords
computational complexity; parallel algorithms; program compilers; programming theory; SIMD-SM EREW model; arithmetic expression parsing; optimal parallel algorithm; parenthesis pairing algorithm; tree form generation; Binary trees; Computational modeling; Computer science; Concurrent computing; Digital arithmetic; Heart; Parallel algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1992. Proceedings., Sixth International
Conference_Location
Beverly Hills, CA
Print_ISBN
0-8186-2672-0
Type
conf
DOI
10.1109/IPPS.1992.223044
Filename
223044
Link To Document