Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Enrique F. Torres

dblp:95/2030 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 4 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Memory systems · 61% Processor architecture and microarchitecture · 34% Parallel and multicore computing · 6%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems › cache › cache organization
multibanked data cache
0.122009
Store Buffer Design for Multibanked Data Caches · IEEE Trans. Computers 2009
Store Buffer Design in First-Level Multibanked Data Caches · ISCA 2005
Processor architecture and microarchitecture › load/store queue
store buffer
0.122009
Store Buffer Design for Multibanked Data Caches · IEEE Trans. Computers 2009
Store Buffer Design in First-Level Multibanked Data Caches · ISCA 2005
Memory systems
memory hierarchy
0.112009
Store Buffer Design for Multibanked Data Caches · IEEE Trans. Computers 2009
Memory systems
cache
0.112005
Store Buffer Design in First-Level Multibanked Data Caches · ISCA 2005
Parallel and multicore computing › task scheduling › dynamic scheduling
dynamically-scheduled processor
0.012009
Store Buffer Design for Multibanked Data Caches · IEEE Trans. Computers 2009
Processor architecture and microarchitecture › out-of-order execution
out-of-order processor
0.012005
Store Buffer Design in First-Level Multibanked Data Caches · ISCA 2005

Methods — techniques the papers use, named apart from their topics

speculative forwarding · 0.1fault injection · 0.1simulation · 0.1
YearPublicationVenuePosition
2009 Store Buffer Design for Multibanked Data Caches
abstract
This paper focuses on how to design a Store Buffer (STB) well suited to first-level multibanked data caches. The goal is to forward data from in-flight stores into dependent loads within the latency of a cache bank. Taking into account the store lifetime in the processor pipeline and the data forwarding behavior, we propose a particular two-level STB design in which forwarding is done speculatively from a distributed first-level STB made of extremely small banks, whereas a centralized, second-level STB enforces correct store-load ordering. Besides, the two-level STB admits two simplifications that leave performance almost unchanged. Regarding the second-level STB, we suggest to remove its data forwarding capability, while for the first-level STB, it is possible to: 1) remove the instruction age checking and 2) compare only the less significant address bits. Experimentation covers both integer and floating point codes executing in dynamically scheduled processors. Following our guidelines and running SPEC-2K over an 8-way processor, a two-level STB with four 8-entry banks in the first level performs similar to an ideal, single-level STB with 128-entry banks working at the first-level cache latency. Also, we show that the proposed two-level design is suitable for a memory-latency-tolerant processor.
Enrique F. Torres, Pablo Ibáñez 0001, Víctor Viñals, José María Llabería
IEEE Trans. Computers1
2005 Store Buffer Design in First-Level Multibanked Data Caches
abstract
This paper focuses on how to design a store buffer (STB) well suited to first-level multibanked data caches. Our goal is to forward data from in-flight stores to dependent loads with the latency of a cache bank. For that we propose a particular two-level STB design in which forwarding is done speculatively from a distributed first-level STB made of extremely small banks, while a centralized, second-level STB enforces correct store-load ordering a few cycles later. To that end we have identified several important design decisions: i) delaying allocation of first-level STB entries until stores execute; ii) deallocating first-level STB entries before stores commit; and iii) selecting a recovery policy well-matched to data forwarding misspeculations. Moreover, the two-level STB admits two enhancements that simplify the design leaving performance almost unchanged: i) removing the data forwarding capability from the second-level STB; and ii) not checking instruction age in first-level STB prior to forwarding data to loads. Following our guidelines and running SPECint-2K over an 8-way out-of-order processor, a two-level STB (first level with four STB banks of 8 entries each) performs similarly to an ideal, single-level STB with 128-entry banks working at the first-level cache latency.
Enrique F. Torres, Pablo Ibáñez 0001, Víctor Viñals, José María Llabería
ISCA1
2004 Contents Management in First-Level Multibanked Data Caches
Enrique F. Torres, Pablo Ibáñez 0001, Víctor Viñals, José María Llabería
Euro-Par1
2003 Counteracting Bank Misprediction in Sliced First-Level Caches
Enrique F. Torres, Pablo Ibáñez 0001, Víctor Viñals, José María Llabería
Euro-Par1