A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit <a rel="external noopener" href="https://upcommons.upc.edu/bitstream/handle/2117/113049/01410081.pdf;jsessionid=BDB2468A52D38D9A3CFC3B1D5F120D31?sequence=1">the original URL</a>. The file type is <code>application/pdf</code>.
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/n7ljjecrpje5pj66pk4pvx65qu" style="color: black;">10th International Symposium on High Performance Computer Architecture (HPCA'04)</a>
Simultaneous Multithreading (SMT) is an architectural technique that allows for the parallel execution of several threads simultaneously. Fetch performance has been identified as the most important bottleneck for SMT processors. The commonly adopted solution has been fetching from more than one thread each cycle. Recent studies have proposed a plethora of fetch policies to deal with fetch priority among threads, trying to increase fetch performance. In this paper we demonstrate that the<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hpca.2004.10003">doi:10.1109/hpca.2004.10003</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/hpca/FalconRV04.html">dblp:conf/hpca/FalconRV04</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ugjdcpgbwzfvtidmf7yiftx5mq">fatcat:ugjdcpgbwzfvtidmf7yiftx5mq</a> </span>
more »... eous sharing of the fetch unit, apart from increasing the complexity of the fetch unit, can be counterproductive in terms of performance. We evaluate the use of high-performance fetch units in the context of SMT. Our new fetch architecture proposal allows us to feed an 8-way processor fetching from a single thread each cycle, reducing complexity, and increasing the usefulness of proposed fetch policies. Our results show that using new high-performance fetch units, like the FTB or the stream fetch, provides higher performance than fetching from two threads using common SMT fetch architectures. Furthermore, our results show that our design obtains better average performance for any kind of workloads (both ILP and memory bounded benchmarks), in contrast to previously proposed solutions.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719111515/https://upcommons.upc.edu/bitstream/handle/2117/113049/01410081.pdf;jsessionid=BDB2468A52D38D9A3CFC3B1D5F120D31?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3d/a2/3da2ab1a84773ba2770b6b83d63a5ba688d2ec19.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/hpca.2004.10003"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>