Mostra el registre d'ítem simple
Introducing runahead threads
dc.contributor.author | Ramírez García, Tanausu |
dc.contributor.author | Pajuelo González, Manuel Alejandro |
dc.contributor.author | Santana Jaria, Oliverio J. |
dc.contributor.author | Valero Cortés, Mateo |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors |
dc.date.accessioned | 2017-09-28T11:28:43Z |
dc.date.available | 2017-09-28T11:28:43Z |
dc.date.issued | 2007-07 |
dc.identifier.citation | Ramírez, T., Pajuelo, M.A., Santana, O., Valero, M. "Introducing runahead threads". 2007. |
dc.identifier.uri | http://hdl.handle.net/2117/108084 |
dc.description.abstract | Simultaneous 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.extent | 17 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | UPC-DAC-RR-CAP-2007-21 |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Arquitectura de computadors |
dc.subject.lcsh | Simultaneous multithreading processors |
dc.subject.lcsh | Parallel processing (Electronic computers) |
dc.title | Introducing runahead threads |
dc.type | External research report |
dc.subject.lemac | Multiprocessadors |
dc.subject.lemac | Processament en paral·lel (Ordinadors) |
dc.contributor.group | Universitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions |
dc.rights.access | Open Access |
local.identifier.drac | 514100 |
dc.description.version | Postprint (published version) |
local.citation.author | Ramírez, T.; Pajuelo, M.A.; Santana, O.; Valero, M. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [58]
-
Reports de recerca [181]