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

Stefan Bieschewski

dblp:20/993 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none

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

Systems, architecture and hardware · 2 · 2 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
1 paper
Processor architecture and microarchitecture · 50% Memory systems · 25% Energy-efficient computing · 25%

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

TopicWeightPapersLastEvidence papers
Memory systems
cache design
0.212016
An Energy-Efficient Memory Unit for Clustered Microarchitectures · IEEE Trans. Computers 2016
Processor architecture and microarchitecture › clustered architecture
clustered microarchitecture
0.212016
An Energy-Efficient Memory Unit for Clustered Microarchitectures · IEEE Trans. Computers 2016
Processor architecture and microarchitecture
load/store queue
0.212016
An Energy-Efficient Memory Unit for Clustered Microarchitectures · IEEE Trans. Computers 2016
Energy-efficient computing › low-power design
low-power processor design
0.212016
An Energy-Efficient Memory Unit for Clustered Microarchitectures · IEEE Trans. Computers 2016

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

late allocation · 0.2distributed memory pipeline · 0.2
YearPublicationVenuePosition
2016 An Energy-Efficient Memory Unit for Clustered Microarchitectures
abstract
Whereas clustered microarchitectures themselves have been extensively studied, the memory units for these clustered microarchitectures have received relatively little attention. This article discusses some of the inherent challenges of clustered memory units and shows how these can be overcome. Clustered memory pipelines work well with the late allocation of load/store queue entries and physically unordered queues. Yet this approach has characteristic problems such as queue overflows and allocation patterns that lead to deadlocks. We propose techniques to solve each of these problems and show that a distributed memory unit can offer significant energy savings and speedups over a centralized unit. For instance, compared to a centralized cache with a load/store queue of 64/24 entries, our four-cluster distributed memory unit with load/store queues of 16/8 entries each consumes 31 percent less energy and performs 4,7 percent better on SPECint and consumes 36 percent less energy and performs 7 percent better for SPECfp.
Stefan Bieschewski, Joan-Manuel Parcerisa, Antonio González 0001
IEEE Trans. Computers1
2005 Memory Bank Predictors
abstract
Cache memories are commonly implemented through multiple memory banks to improve bandwidth and latency. The early knowledge of the data cache bank that an instruction will access can help to improve the performance in several ways. One scenario that is likely to become increasingly important is clustered microprocessors with a distributed cache. This work presents a study of different cache bank predictors. We show that effective bank predictors can be implemented with relatively low cost. For instance, a predictor of approximately 4 Kbytes is shown to achieve an average hit rate of 78% for SPECint2000 when used to predict accesses to an 8-bank cache memory in a contemporary superscalar processor. We also show how a predictor can be used to reduce the communication latency caused by memory accesses in a clustered microarchitecture with a distributed cache design.
Stefan Bieschewski, Joan-Manuel Parcerisa, Antonio González 0001
ICCD1