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

Vasilis Spiliopoulos

dblp:320/8156 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 since 2021

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
Memory systems · 87% Hardware accelerators and domain-specific architectures · 13%

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

TopicWeightPapersLastEvidence papers
Memory systems
memory bandwidth
0.612022
GBDI: Going Beyond Base-Delta-Immediate Compression with Global Bases · HPCA 2022
Memory systems
memory compression
0.612022
GBDI: Going Beyond Base-Delta-Immediate Compression with Global Bases · HPCA 2022
Hardware accelerators and domain-specific architectures › domain-specific accelerator
compression accelerator
0.212022
GBDI: Going Beyond Base-Delta-Immediate Compression with Global Bases · HPCA 2022

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

clustering algorithm · 0.6
YearPublicationVenuePosition
2022 GBDI: Going Beyond Base-Delta-Immediate Compression with Global Bases
abstract
Memory bandwidth is limiting performance for many emerging applications. While compression techniques can unlock a higher memory bandwidth, prior art offers only modestly better bandwidth. This paper contributes with a new compression method – Global Base Delta Immediate compression (GBDI) – that offers substantially higher memory bandwidth by, unlike prior art, selecting base values across memory blocks. GBDI uses a novel clustering algorithm through data analysis in the background. The presented accelerator infrastructure offers low area overhead and latency. This paper shows that GBDI offers a compression ratio of 2.3×, and yields 1.5× higher bandwidth and 1.1× higher performance compared with a baseline without compression support, on average, for SPEC2017 benchmarks requiring medium to high memory bandwidth.
Alexandra Angerd, Angelos Arelakis, Vasilis Spiliopoulos, Erik Sintorn, Per Stenström
HPCA3