Dynamic cluster assignment mechanisms
- 1 January 2000
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 133-142
Abstract
Clustered microarchitectures are an effective approach to reducing the penalties caused by wire delays inside a chip. Current superscalar processors have in fact a two-cluster microarchitecture with a naive code partitioning approach: integer instructions are allocated to one cluster and floating-point instructions to the other. This partitioning scheme is simple and results in no communications between the two clusters (just through memory) but it is in general far from optimal because she workload is not evenly distributed most of the time. In fact, when the processor is running integer programs, the workload is extremely unbalanced since the FP cluster is not used at all. In this work we investigate run-time mechanisms that dynamically distribute the instructions of a program among these two clusters. By optimizing the trade-off between inter-cluster communication penalty and workload balance, the proposed schemes can achieve an average speed-up of 36% for the SpecInt95 benchmark suite.Keywords
This publication has 15 references indexed in Scilit:
- The superthreaded architecture: thread pipelining with run-time data dependence checking and control speculation2002
- PEWs: a decentralized dynamic scheduler for ILP processing2002
- Register file design considerations in dynamically scheduled processors2002
- A dynamic multithreading processor2002
- Effective cluster assignment for modulo scheduling2002
- The multicluster architecture: reducing cycle time through partitioning2002
- A cost-effective clustered architecture1999
- Speculative multithreaded processors1998
- Will physical scalability sabotage performance gains?Computer, 1997
- Decoupling integer execution in superscalar processors1995