Making the Original Scoreboard Mechanism Deadlock Free

Very recently, it was shown that the well known scoreboard as introduced in the CDC 6600 and described in current textbooks runs into deadlocks. However, it is one of the two major scheduling mechanisms used in todays microprocessors. This paper presents a corrected version of the scoreboard and formally proves that mechanism to be correct and deadlock free.

[1]  Wolfgang J. Paul,et al.  On the Correctness of Hardware Scheduling Mechanisms for Out-of-Order Execution , 1998, J. Circuits Syst. Comput..

[2]  S M M Uller.  Complexity and Correctness of Computer Architectures , 1996 .

[3]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[4]  Peter M. Kogge,et al.  The Architecture of Pipelined Computers , 1981 .

[5]  Barbara M. Chapman,et al.  Supercompilers for parallel and vector computers , 1990, ACM Press frontier series.

[6]  Arthur J. Bernstein,et al.  Analysis of Programs for Parallel Processing , 1966, IEEE Trans. Electron. Comput..

[7]  J. E. Thornton,et al.  Parallel operation in the control data 6600 , 1964, AFIPS '64 (Fall, part II).

[8]  Allan Gottlieb,et al.  Highly parallel computing , 1989, Benjamin/Cummings Series in computer science and engineering.

[9]  J. Davenport.  Editor , 1960 .

[10]  J. E. Thornton.  Design of a Computer: The Control Data 6600 , 1970 .

[11]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .