Issue No. 10 - October (2005 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.128
Manoj Franklin , IEEE Computer Society
Aneesh Aggarwal , IEEE Computer Society
<p><b>Abstract</b>—In the evolving submicron technology, making it particularly attractive to use decentralized designs. A common form of decentralization adopted in processors is to partition the execution core into multiple <it>clusters</it>. Each <it>cluster</it> has a small instruction window, and a set of functional units. A number of algorithms have been proposed for distributing instructions among the <it>clusters</it>. The first part of this paper analyzes (qualitatively as well as quantitatively) the effect of various hardware parameters such as the type of cluster interconnect, the fetch size, the cluster issue width, the cluster window size, and the number of clusters on the performance of different instruction distribution algorithms. The study shows that the relative performance of the algorithms is very sensitive to these hardware parameters and that the algorithms that perform relatively better with four or fewer clusters are generally not the best ones for a larger number of clusters. This is important, given that with an imminent increase in the transistor budget, more clusters are expected to be integrated on a single chip. The second part of the paper investigates alternate interconnects that provide scalable performance as the number of clusters is increased. In particular, it investigates two hierarchical interconnects—a single ring of crossbars and multiple rings of crossbars—as well as instruction distribution algorithms to take advantage of these interconnects. Our study shows that these new interconnects with the appropriate distribution techniques achieve an IPC (instructions per cycle) that is 15-20 percent better than the most scalable existing configuration, and is within 2 percent of that achieved by a hypothetical ideal processor having a 1-cycle latency crossbar interconnect. These results confirm the utility and applicability of hierarchical interconnects and hierarchical distribution algorithms in clustered processors.</p>
Clustered processor architecture, pipeline processors, interconnection architectures, load balancing and task assignment.
Manoj Franklin, Aneesh Aggarwal, "Scalability Aspects of Instruction Distribution Algorithms for Clustered Processors", IEEE Transactions on Parallel & Distributed Systems, vol. 16, no. , pp. 944-955, October 2005, doi:10.1109/TPDS.2005.128