Clustered VLIW architectures with predicated switching

In order to meet the high throughput requirements of applications exhibiting high ILP, VLIW ASIPs may increasingly include large numbers of functional units (FUs). Unfortunately, 'switching' data through register files shared by large numbers of FUs quickly becomes a dominant cost performa...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232) pp. 696 - 701
Main Authors Jacome, M.F., de Veciana, G., Pillai, S.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2001
Subjects
Aging
Application specific processors
Computer architecture
Costs
Performance gain
Permission
Power dissipation
Registers
Throughput
VLIW
Online AccessGet full text

Cover

More Information
Summary:In order to meet the high throughput requirements of applications exhibiting high ILP, VLIW ASIPs may increasingly include large numbers of functional units (FUs). Unfortunately, 'switching' data through register files shared by large numbers of FUs quickly becomes a dominant cost performance factor suggesting that clustering smaller number of FUs around local register files may be beneficial even if data transfers are required among clusters. With such machines in mind, we propose a compiler transformation, predicated switching, which enables aggressive speculation while leveraging the penalties associated with inter-cluster communication to achieve gains in performance. Based on representative benchmarks, we demonstrate that this novel technique is particularly suitable for application specific clustered machines aimed at supporting high ILP as compared to state of-the-art approaches.
ISBN:1581132972
9781581132977
ISSN:0738-100X
DOI:10.1145/378239.379050