The multicluster architecture: Reducing processor cycle time through partitioning

Citation
Ki. Farkas et al., The multicluster architecture: Reducing processor cycle time through partitioning, INT J P PRO, 27(5), 1999, pp. 327-356
Citations number
15
Categorie Soggetti
Computer Science & Engineering
Journal title
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING
ISSN journal
08857458 → ACNP
Volume
27
Issue
5
Year of publication
1999
Pages
327 - 356
Database
ISI
SICI code
0885-7458(199910)27:5<327:TMARPC>2.0.ZU;2-V
Abstract
The multicluster architecture that we introduce offers a decentralized, dyn amically-scheduled architecture, in which the register files, dispatch queu e, and Functional units of the architecture are distributed across multiple clusters, and each cluster is assigned a subset of the architectural regis ters. The motivation for the multicluster architecture is to reduce the clo ck cycle time, relative to a single-cluster architecture with the same numb er of hardware resources, by reducing the size and complexity of components on critical timing paths. Resource partitioning, however, introduces instr uction-execution overhead and may reduce the number of concurrently executi ng instructions. To counter these two negative by-products of partitioning, we developed a static instruction scheduling algorithm. We describe this a lgorithm, and using trace-driven simulations of SPEC92 benchmarks, evaluate its effectiveness. This evaluation indicates that for the configurations c onsidered, the multicluster architecture may have significant performance a dvantages at feature sizes below 0.35 mu m, and warrants further investigat ion.