Compilation Techniques for Recognition of Parallel Processable Tasks in Arithmetic Expressions

Authors:
C. V. Ramamoorthy;J. H. Park;H. F. Li
Affiliations:
Department of Electrical Engineering and Computer Sciences, University of California;-;-
Venue:
IEEE Transactions on Computers
Year:
1973

Citing 5
Cited 3

One-Pass compilation of arithmetic expressions for a parallel processor

Communications of the ACM
Compiler Construction for Digital Computers

Compiler Construction for Digital Computers
On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup

IEEE Transactions on Computers
A multiprocessor system design

AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference
A survey of techniques for recognizing parallel processable streams in computer programs

AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference

Scheduling Trees in Parallel/Pipelined Processing Environments

IEEE Transactions on Computers
Some thoughts on associative processing languages

AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
An overview of the Texas reconfigurable array computer

AFIPS '80 Proceedings of the May 19-22, 1980, national computer conference

Quantified Score

Hi-index	14.98

Visualization

Abstract

With the developments of parallel computer systems, the techniques for the recognition and representation of parallel task streams in a job (program) have become important to enhance the system performance.