A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
Proceedings of the 30th annual international symposium on Computer architecture - ISCA '03
This work examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed cluster assignment techniques run into unique problems as issue width and cluster count increase. Realistic design conditions, such as variable data forwarding latencies between clusters and a heavily partitioned instruction window, increase the degree of difficulty for effective cluster assignment. In this work, the trace cache and fill unit are used to perform dynamic clusterdoi:10.1145/859648.859649 fatcat:yxonp4bgqfcbxbnnrtnuwvdnxm