|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Y.N. Srikant, "Parallel Parsing of Arithmetic Expressions," IEEE Transactions on Computers, vol. 39, no. 1, pp. 130-132, January, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/12.46288, author = {Y.N. Srikant}, title = {Parallel Parsing of Arithmetic Expressions}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {1}, issn = {0018-9340}, year = {1990}, pages = {130-132}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.46288}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Parallel Parsing of Arithmetic Expressions IS - 1 SN - 0018-9340 SP130 EP132 EPD - 130-132 A1 - Y.N. Srikant, PY - 1990 KW - parallel algorithms; arithmetic expressions; parsing; mesh; shuffle; cube; cube-connected cycle parallel computers; mesh-connected model; wrap-around row-major ordering; shuffle computer; grammars; parallel algorithms. VL - 39 JA - IEEE Transactions on Computers ER - | |||
Parallel algorithms for parsing expressions on mesh, shuffle, cube, and cube-connected cycle parallel computers are presented. With n processors, it requires O( square root n) time on the mesh-connected model and O(log/sup 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.
[1] S. G. Akl,Parallel Sorting Algorithms. Orlando, FL: Academic, 1985.
[2] I. Bar-On and U. Vishkin, "Optimal generation of a computation tree form,"ACM Trans. Programming Lang. Syst., vol. 7, no. 2, pp. 659-663, 1985.
[3] E. Dekel and S. Sahni, "Parallel generation of postfix and tree forms,"ACM Trans. Programming Languages Syst., pp. 300-317, July 1983.
[4] K. Hwang and F. A. Briggs,Computer Architecture and Parallel Processing. New York: McGraw-Hill, 1984.
[5] D. Nassimi and S. Sahni, "Data broadcasting in SIMD computers,"IEEE Trans. Comput., vol. C-30, pp. 101-107, Feb. 1981.
[6] M. C. Pease, "The indirect binary n-cube microprocessor array,"IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1977.
[7] F. P. Preparata and J. Vuillemin, "The cube-connected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300-309, May 1981.
[8] J. T. Schwartz, "Ultracomputers,"ACM Trans. Programming Languages Syst., vol. 2, no. 4, pp. 484-521, Oct. 1980.
[9] Y. N. Srikant and P. Shankar, "A new parallel algorithm for parsing arithmetic infix expressions,"Parallel Comput., vol. 4, pp. 291-304, 1987.