Show simple item record

dc.contributor.authorAcosta Ojeda, Carmelo Alexis
dc.contributor.authorFalcón Samper, Ayose Jesús
dc.contributor.authorRamírez Bellido, Alejandro
dc.contributor.authorValero Cortés, Mateo
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2017-12-20T10:25:26Z
dc.date.available2017-12-20T10:25:26Z
dc.date.issued2005
dc.identifier.citationAcosta, C. A., Falcón, A., Ramírez, A., Valero, M. A complexity-effective simultaneous multithreading architecture. A: International Conference on Parallel Processing. "2005 International Conference on Parallel Processing: 14-17 June 2005, Oslo, Norway: proceedings". Oslo: Institute of Electrical and Electronics Engineers (IEEE), 2005, p. 157-164.
dc.identifier.isbn0-7695-2380-3
dc.identifier.urihttp://hdl.handle.net/2117/112312
dc.description.abstractDifferent applications may exhibit radically different behaviors and thus have very different requirements in terms of hardware support. In simultaneous multithreading (SMT) architectures, the hardware is shared among multiple running applications in order to better profit from it. However, current architectures are designed for the common case, and try to satisfy a number of different application classes with a single design. That is, current designs are usually overdesigned for most cases, obtaining high performance, but wasting a lot of resources to do so. In this paper we present an alternative SMT architecture, the heterogeneously distributed SMT (hdSMT). Our architecture is based in a novel combination of SMT and clustering techniques in a heterogeneity-aware fashion. The hardware is designed to match the heterogeneous application behavior with the statically and heterogeneously partitioned resources. Such a design is aimed for minimizing the amount of resources wasted to achieve a given performance rate. On top of our statically partitioned architecture, we propose a heuristic policy to map threads to clusters so that each cluster matches the characteristics of the running threads and overall hardware usage is optimized. We compare our hdSMT architecture with a monolithic SMT processor, where all threads compete for the same resources, and with a homogeneous clustered SMT, where resources are statically and equally partitioned across clusters. Our results show that hdSMT architectures obtain an average improvement of 13% and 14% in optimizing performance per area over monolithic SMT and homogeneously clustered SMT respectively.
dc.format.extent8 p.
dc.language.isoeng
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
dc.subject.lcshParallel processing (Electronic computers)
dc.subject.lcshMicroprocessors
dc.subject.lcshSimultaneous multithreading processors
dc.subject.otherSMT
dc.subject.otherCMP
dc.subject.otherClustering
dc.subject.otherComplexity-effective
dc.subject.otherHeterogeneity-awareness
dc.subject.otherMapping policies
dc.titleA complexity-effective simultaneous multithreading architecture
dc.typeConference report
dc.subject.lemacProcessament en paral·lel (Ordinadors)
dc.subject.lemacMicroprocessadors
dc.contributor.groupUniversitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
dc.identifier.doi10.1109/ICPP.2005.7
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://ieeexplore.ieee.org/document/1488611/
dc.rights.accessOpen Access
drac.iddocument2401943
dc.description.versionPostprint (published version)
upcommons.citation.authorAcosta, C. A., Falcón, A., Ramírez, A., Valero, M.
upcommons.citation.contributorInternational Conference on Parallel Processing
upcommons.citation.pubplaceOslo
upcommons.citation.publishedtrue
upcommons.citation.publicationName2005 International Conference on Parallel Processing: 14-17 June 2005, Oslo, Norway: proceedings
upcommons.citation.startingPage157
upcommons.citation.endingPage164


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