Variable instruction scheduling for MIMD interpretation on pipelined SIMD machines and for compositional instruction sets

Functional parallelism may be supported on SIMD machines by interpretation. The programs and data of each function are loaded on the processing elements (PEs), and the control unit of the machine executes a central control algorithm that causes the concurrent interpretation of these functions. The p...

Full description

Saved in:
Bibliographic Details
Published inConcurrency (Chichester, England.) Vol. 9; no. 1; pp. 21 - 39
Main Authors ABU-GHAZALEH, NAEL B., WILSEY, PHILIP A.
Format Journal Article
LanguageEnglish
Published Chichester John Wiley & Sons, Ltd 01.01.1997
Online AccessGet full text
ISSN1040-3108
1096-9128
1096-9128
DOI10.1002/(SICI)1096-9128(199701)9:1<21::AID-CPE237>3.0.CO;2-L

Cover

More Information
Summary:Functional parallelism may be supported on SIMD machines by interpretation. The programs and data of each function are loaded on the processing elements (PEs), and the control unit of the machine executes a central control algorithm that causes the concurrent interpretation of these functions. The performance of this paradigm has been shown to benefit considerably from a variable instruction issue schedule that delays execution of expensive and rarely occurring operations. Two new features of the interpretation paradigm, namely pipelined SIMD machines and compositional instruction sets, change the nature of the mathematical model used for variable instruction scheduling significantly. In the paper, a previously developed mathematical model of the interpretation process is extended to allow for compositional instructions and pipelining. We develop and present algorithms that produce variable instruction schedules for the extended model and investigate whether the variable instruction issue is useful for these cases. We show that the variable instruction issue improves the performance of pipelined machines but is not very effective for compositional instruction sets, especially when the composition matrix is not sparse. © 1997 by John Wiley & Sons, Ltd.
Bibliography:istex:BBB55A1FD79EE1AF37A2DD156FD125C8A0565506
ark:/67375/WNG-ZX2C12G8-B
ArticleID:CPE237
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1040-3108
1096-9128
1096-9128
DOI:10.1002/(SICI)1096-9128(199701)9:1<21::AID-CPE237>3.0.CO;2-L