TY - GEN
T1 - Static synchronization beyond VLIW
AU - Dietz, H.
AU - Schwederski, T.
AU - O'Keefe, M.
AU - Zaafrani, A.
PY - 1989/8/1
Y1 - 1989/8/1
N2 - The authors propose a new kind of architecture, the static barrier MIMD (SBM), which can be viewed as further generalization of the parallel execution abilities of static synchronization machines. Barrier MIMDs are asynchronous multiple-instruction-stream multiple-data-stream architectures capable of parallel execution of loops, subprogram calls, and variable-execution-time instructions. However, instead of using barriers as a synchronization mechanism, the proposed barrier hardware is used to impose static timing constraints. Since the compiler can know at compile time all instructions which each processor could be executing when a particular conceptual synchronization operation is needed, it can resolve most synchronizations by using VLIW (very-long-instruction word)-like compile-time instruction scheduling, without the use of a runtime synchronization mechanism. The effect is that the proposed barrier mechanism greatly extends the generality of efficient static scheduling without adding a significant hardware cost. Both the barrier architecture and the supporting compiler technology are discussed.
AB - The authors propose a new kind of architecture, the static barrier MIMD (SBM), which can be viewed as further generalization of the parallel execution abilities of static synchronization machines. Barrier MIMDs are asynchronous multiple-instruction-stream multiple-data-stream architectures capable of parallel execution of loops, subprogram calls, and variable-execution-time instructions. However, instead of using barriers as a synchronization mechanism, the proposed barrier hardware is used to impose static timing constraints. Since the compiler can know at compile time all instructions which each processor could be executing when a particular conceptual synchronization operation is needed, it can resolve most synchronizations by using VLIW (very-long-instruction word)-like compile-time instruction scheduling, without the use of a runtime synchronization mechanism. The effect is that the proposed barrier mechanism greatly extends the generality of efficient static scheduling without adding a significant hardware cost. Both the barrier architecture and the supporting compiler technology are discussed.
UR - https://www.scopus.com/pages/publications/0024942941
UR - https://www.scopus.com/pages/publications/0024942941#tab=citedBy
U2 - 10.1145/76263.76309
DO - 10.1145/76263.76309
M3 - Conference contribution
AN - SCOPUS:0024942941
SN - 9780897913416
T3 - Proceedings Supercomputing 1989
SP - 416
EP - 425
BT - Proceedings Supercomputing 1989
T2 - 1989 ACM/IEEE conference on Supercomputing, SC 1989
Y2 - 13 November 1989 through 17 November 1989
ER -