论文信息 - The Inhibition of Potential Parallelism by Conditional Jumps

The Inhibition of Potential Parallelism by Conditional Jumps

This note reports the results of an examination of seven programs originally written for execution on a conventional computer (CDC-3600). We postulate an infinite machine, one with an infinite memory and instruction stack, infinite registers and memory, and an infinite number of functional units. This machine wiU exectite a program in parallel at maximum speed by executing each instruction at the earliest possible moment.

Edward M. Riseman | Caxton C. Foster | C. C. Foster | E. Riseman | C. Foster

[1] Erich Bloch,et al. The engineering design of the stretch computer , 1959, IRE-AIEE-ACM '59 (Eastern).

[2] John Cocke,et al. The virtual memory in the STRETCH computer , 1959, IRE-AIEE-ACM '59 (Eastern).

[3] R. T. Blosk. The instruction unit of the stretch computer , 1960, IRE-AIEE-ACM '60 (Eastern).

[4] Michael J. Flynn,et al. Very high-speed computing systems , 1966 .

[5] Herbert Hellerman,et al. Parallel Processing of Algebraic Expressions , 1966, IEEE Trans. Electron. Comput..

[6] Harold S. Stone,et al. One-Pass compilation of arithmetic expressions for a parallel processor , 1967, CACM.

[7] David W. Anderson,et al. The IBM System/360 model 91: machine philosophy and instruction-handling , 1967 .

[8] C. V. Ramamoorthy,et al. A survey of techniques for recognizing parallel processable streams in computer programs , 1899, AFIPS '69 (Fall).

[9] Michael J. Flynn,et al. Detection and Parallel Execution of Independent Instructions , 1970, IEEE Transactions on Computers.

[10] C. V. Ramamoorthy,et al. Program Suitability for Parallel Processing , 1971, IEEE Transactions on Computers.

[11] Yoichi Muraoka,et al. On the Number of Operations Simultaneously Executable in Fortran-Like Programs and Their Resulting Speedup , 1972, IEEE Transactions on Computers.