REFERENCES
- Y N Srikant, Parallel Parsing of arithmetic expressions, IEEE Transactions on Computers, vol 39, no 1, pp 130–132, Jan 1990.
- D J Kuck, Y Muraoka & S Chen, On the number of operations simultaneously executable in Fortran-Like programs and their resulting speedup, IEEE Trans Computers, vol C-21, no 12, pp 1293–1310, Dec 1972.
- D A Padua & M J Wolfe, Advanced compiler optimizations for Super Computers, Comm ACM, vol 29, no 12, pp 1184–1201, Dec 1986.
- David J Lilja, Exploiting the parallelism available in loops, IEEE Computer, vol 27, no 2, pp 13–26, Feb 1994.
- A J Bernstein, Analysis of programs for parallel processing, IEEE Transactions on Electronic Computers, vol EC-15, no 5, Oct 1966.
- M J Gonzalez et al, Program Suitability for parallel processing, IEEE Trans on Computers, vol C-20, no 6, June 1971.
- E Dekel et al, ParaHel generation of Postfix and tree forms, ACM Transactions on programming languages and systems, vol 5, no 3, pp 300–317, July 1983.
- Ilan Bar-On et al. Optimal parallel generation of a computation tree form, ACM Trans on programming languages and system, vol 7, no 2, pp 348–357, April 1985.
- K Hwang & F Briggs, Computer Architecture and parallel, processing, New York: McGraw-Hill, 1984.
- Y N Srikant & P Shankar, A new parallel algorithm for parsing arithmetic infix expressions, Parallel Comput, vol 4, pp 291–304, 1987.
- S G Akl, Parallel sorting algorithms, New York Academic, 1985.
- S Valli & V Ganapathy, A Heuristic Approach for Inter Instruction Parallelism using Rearrangement, IETE Journal of Research, vol 42, pp 175–178, 1996.
- S Valli & V Ganapathy, A Parallel Approach to Pick and Place Operation, Proceedings of ROSEPRO.
- S Valli, V Sankaranarayanan & V Ganapathy, Parallel Evaluation of Arithmetic Operations at Intra Instruction Level by Rearrangement, Accepted for publication in the CSI journal.