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 Kaestle

dblp:145/5124 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
1since 2021 · last 2023
—ORCID · unresolved

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

Systems, architecture and hardware · 4 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 2 · 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
5 papers
Cloud and datacenter computing · 37% Memory systems · 26% Parallel and multicore computing · 23%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%
Network and information security
1 paper
Blockchain and cryptocurrency security · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
serverless computing
0.712023
Decentralized and Stateful Serverless Computing on the Internet Computer Blockchain · USENIX ATC 2023
Cloud and datacenter computing › serverless computing
stateful serverless
0.712023
Decentralized and Stateful Serverless Computing on the Internet Computer Blockchain · USENIX ATC 2023
Parallel and multicore computing
parallel programming models
0.532016
Machine-Aware Atomic Broadcast Trees for Multicores · OSDI 2016
Callisto-RTS: Fine-Grain Parallel Loops · USENIX ATC 2015
Shoal: Smart Allocation and Replication of Memory For Parallel Programs · USENIX ATC 2015
Memory systems
memory management
0.422018
Analytics with smart arrays: adaptive and efficient language-independent data · EuroSys 2018
Shoal: Smart Allocation and Replication of Memory For Parallel Programs · USENIX ATC 2015
Runtime systems and virtual machines
managed runtime
0.312018
Analytics with smart arrays: adaptive and efficient language-independent data · EuroSys 2018
Memory systems › non-uniform memory access
NUMA data placement
0.312018
Analytics with smart arrays: adaptive and efficient language-independent data · EuroSys 2018
Distributed systems › group communication
atomic broadcast
0.212016
Machine-Aware Atomic Broadcast Trees for Multicores · OSDI 2016
Distributed systems
distributed coordination
0.212016
Machine-Aware Atomic Broadcast Trees for Multicores · OSDI 2016
Memory systems › memory management
memory allocation
0.212015
Shoal: Smart Allocation and Replication of Memory For Parallel Programs · USENIX ATC 2015
Parallel and multicore computing › parallelization strategies › loop parallelism
parallel loop execution
0.212015
Callisto-RTS: Fine-Grain Parallel Loops · USENIX ATC 2015
Parallel and multicore computing › parallel scheduling
runtime scheduling
0.112015
Callisto-RTS: Fine-Grain Parallel Loops · USENIX ATC 2015

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

bit compression · 1.0adaptive data placement · 1.0
YearPublicationVenuePosition
2023 Decentralized and Stateful Serverless Computing on the Internet Computer Blockchain
Maksym Arutyunyan, Andriy Berestovskyy, Adam Bratschi-Kaye, Ulan Degenbaev, Manu Drijvers, Islam El-Ashi, Stefan Kaestle, Roman Kashitsyn, Maciej Kot, Yvonne-Anne Pignolet, Rostislav Rumenov, Dimitris Sarlis, Alin Sinpalean, Alexandru Uta, Bogdan Warinschi, Alexandra Zapuc
USENIX ATC7
2018 Analytics with smart arrays: adaptive and efficient language-independent data
abstract
This paper introduces smart arrays, an abstraction for providing adaptive and efficient language-independent data storage. Their smart functionalities include NUMA-aware data placement across sockets and bit compression. We show how our single C++ implementation can be used efficiently from both native C++ and compiled Java code. We experimentally evaluate smart arrays on a diverse set of C++ and Java analytics workloads. Further, we show how their smart functionalities affect performance and lead to differences in hardware resource demands on multicore machines, motivating the need for adaptivity. We observe that smart arrays can significantly decrease the memory space requirements of analytics workloads, and improve their performance by up to 4x. Smart arrays are the first step towards general smart collections with various smart functionalities that enable the consumption of hardware resources to be traded-off against one another.
Iraklis Psaroudakis, Stefan Kaestle, Matthias Grimmer, Jean-Pierre Lozi, Tim Harris 0001
EuroSys2
2016 Machine-Aware Atomic Broadcast Trees for Multicores
Stefan Kaestle, Reto Achermann, Roni Haecki, Moritz Hoffmann 0001, Sabela Ramos, Timothy Roscoe
OSDI1
2015 Callisto-RTS: Fine-Grain Parallel Loops
Tim Harris 0001, Stefan Kaestle
USENIX ATC2
2015 Shoal: Smart Allocation and Replication of Memory For Parallel Programs
Stefan Kaestle, Reto Achermann, Timothy Roscoe, Tim Harris 0001
USENIX ATC1
2013 We Need to Talk About NICs
Pravin Shinde, Antoine Kaufmann, Timothy Roscoe, Stefan Kaestle
HotOS4