Show simple item record

dc.contributor.authorRamírez García, Tanausu
dc.contributor.authorPajuelo González, Manuel Alejandro
dc.contributor.authorSantana Jaria, Oliverio J.
dc.contributor.authorValero Cortés, Mateo
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2017-09-28T11:28:43Z
dc.date.available2017-09-28T11:28:43Z
dc.date.issued2007-07
dc.identifier.citationRamírez, T., Pajuelo, M.A., Santana, O., Valero, M. "Introducing runahead threads". 2007.
dc.identifier.urihttp://hdl.handle.net/2117/108084
dc.description.abstractSimultaneous Multithreading processors share their resources among multiple threads in order to improve performance. However, a resource control policy is needed to avoid resource conflicts and prevent some threads from monopolizing them. On the contrary, resource conflicts would cause other threads to suffer from resource starvation degrading the overall performance. This situation is especially sensitive for memory bounded threads, because they hold an important amount of resources while long latency accesses are being served. Several fetch policies and resource control techniques have been proposed to overcome these problems by limiting the per-thread resource utilization. Nevertheless, this limitation is harmful for memory bounded threads because it restricts the memory level parallelism available that hides the long latency memory accesses. In this paper, we propose Runahead threads on SMT scenarios as a valuable solution for both exploiting the memory-level parallelism and reducing the resource contention. This approach switches a memory-bounded eager resource thread to a speculative light thread, avoiding critical resource blocking among multiple threads. Furthermore, it improves the thread-level parallelism by removing long-latency memory operations from the instruction window, releasing busy resources. We compare an SMT architecture using Runahead threads (SMTRA) to both state-of-the-art static fetch and dynamic resource control policies. Our results show that the SMTRA combination performs better, in terms of throughput and fairness, than any of the other policies.
dc.format.extent17 p.
dc.language.isoeng
dc.relation.ispartofseriesUPC-DAC-RR-CAP-2007-21
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
dc.subject.lcshSimultaneous multithreading processors
dc.subject.lcshParallel processing (Electronic computers)
dc.titleIntroducing runahead threads
dc.typeExternal research report
dc.subject.lemacMultiprocessadors
dc.subject.lemacProcessament en paral·lel (Ordinadors)
dc.contributor.groupUniversitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
dc.rights.accessOpen Access
drac.iddocument514100
dc.description.versionPostprint (published version)
upcommons.citation.authorRamírez, T., Pajuelo, M.A., Santana, O., Valero, M.
upcommons.citation.publishedtrue


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder