Show simple item record

dc.contributor.authorCristal Kestelman, Adrián
dc.contributor.authorOrtega, Daniel
dc.contributor.authorLlosa Espuny, José Francisco
dc.contributor.authorValero Cortés, Mateo
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.identifier.citationCristal, A., Ortega, D., Llosa, J., Valero, M. Out-of-order commit processors. A: International Symposium on High-Performance Computer Architecture. "IEE Proceedings- Software". Madrid: Institute of Electrical and Electronics Engineers (IEEE), 2004, p. 48-59.
dc.description.abstractModern out-of-order processors tolerate long latency memory operations by supporting a large number of in-flight instructions. This is particularly useful in numerical applications where branch speculation is normally not a problem and where the cache hierarchy is not capable of delivering the data soon enough. In order to support more in-flight instructions, several resources have to be up-sized, such as the reorder buffer (ROB), the general purpose instructions queues, the load/store queue and the number of physical registers in the processor. However, scaling-up the number of entries in these resources is impractical because of area, cycle time, and power consumption constraints. We propose to increase the capacity of future processors by augmenting the number of in-flight instructions. Instead of simply up-sizing resources, we push for new and novel microarchitectural structures that achieve the same performance benefits but with a much lower need for resources. Our main contribution is a new checkpointing mechanism that is capable of keeping thousands of in-flight instructions at a practically constant cost. We also propose a queuing mechanism that takes advantage of the differences in waiting time of the instructions in the flow. Using these two mechanisms our processor has a performance degradation of only 10% for SPEC2000fp over a conventional processor requiring more than an order of magnitude additional entries in the ROB and instruction queues, and about a 200% improvement over a current processor with a similar number of entries.
dc.format.extent12 p.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors
dc.subject.lcshMicroprocessors -- Energy consumption
dc.subject.lcshParallel processing (Electronic computers)
dc.subject.lcshBuffer storage (Computer science)
dc.subject.otherSystem recovery
dc.subject.otherInstruction sets
dc.subject.otherParallel architectures
dc.subject.otherBuffer storage
dc.titleOut-of-order commit processors
dc.typeConference report
dc.subject.lemacMicroprocessadors -- Consum d'energia
dc.subject.lemacProcessament en paral·lel (Ordinadors)
dc.contributor.groupUniversitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
dc.description.peerreviewedPeer Reviewed
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
upcommons.citation.authorCristal, A.; Ortega, D.; Llosa, J.; Valero, M.
upcommons.citation.contributorInternational Symposium on High-Performance Computer Architecture
upcommons.citation.publicationNameIEE Proceedings- Software

Files in this item


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