Vojtech Aschenbrenner

dblp:167/3831 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-4113-8239ORCID · corroborated

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 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
2 papers
Storage systems · 81% Cloud and datacenter computing · 19%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Operating systems › resource management › storage management
file systems
0.712023
Enabling High-Performance and Secure Userspace NVM File Systems with the Trio Architecture · SOSP 2023
Storage systems › file systems › file system design
persistent memory file system
0.712023
Enabling High-Performance and Secure Userspace NVM File Systems with the Trio Architecture · SOSP 2023
Storage systems › file systems › file system design
secure file systems
0.712023
Enabling High-Performance and Secure Userspace NVM File Systems with the Trio Architecture · SOSP 2023
Cloud and datacenter computing
cloud storage
0.612022
Beating the I/O bottleneck: a case for log-structured virtual disks · EuroSys 2022
Storage systems
object storage
0.612022
Beating the I/O bottleneck: a case for log-structured virtual disks · EuroSys 2022
Storage systems › storage architecture › block storage
virtual disks
0.612022
Beating the I/O bottleneck: a case for log-structured virtual disks · EuroSys 2022

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

userspace architecture · 1.3
YearPublicationVenuePosition
2023 Enabling High-Performance and Secure Userspace NVM File Systems with the Trio Architecture
abstract
Userspace library file systems (LibFSes) promise to unleash the performance potential of non-volatile memory (NVM) by directly accessing it and enabling unprivileged applications to customize their LibFSes to their workloads. Unfortunately, such benefits pose a significant challenge to ensuring metadata integrity. Existing works either underutilize NVM's performance or forgo critical file system security guarantees.
Diyu Zhou, Vojtech Aschenbrenner, Tao Lyu 0004, Sudarsun Kannan, Sanidhya Kashyap
SOSP2
2022 Beating the I/O bottleneck: a case for log-structured virtual disks
abstract
With the increasing dominance of SSDs for local storage, today's network mounted virtual disks can no longer offer competitive performance. We propose a Log-Structured Virtual Disk (LSVD) that couples log-structured approaches at both the cache and storage layer to provide a virtual disk on top of S3-like storage. Both cache and backend store are order-preserving, enabling LSVD to provide strong consistency guarantees in case of failure. Our prototype demonstrates that the approach preserves all the advantages of virtual disks, while offering dramatic performance improvements over not only commonly used virtual disks, but the same disks combined with inconsistent (i.e. unsafe) local caching.
Mohammad Hossein Hajkazemi, Vojtech Aschenbrenner, Mania Abdi, Emine Ugur Kaynar, Amin Mossayebzadeh, Orran Krieger, Peter Desnoyers
EuroSys2
2018 Lifted Relational Neural Networks: Efficient Learning of Latent Relational Structures
abstract
We propose a method to combine the interpretability and expressive power of firstorder logic with the effectiveness of neural network learning. In particular, we introduce a lifted framework in which first-order rules are used to describe the structure of a given problem setting. These rules are then used as a template for constructing a number of neural networks, one for each training and testing example. As the different networks corresponding to different examples share their weights, these weights can be efficiently learned using stochastic gradient descent. Our framework provides a flexible way for implementing and combining a wide variety of modelling constructs. In particular, the use of first-order logic allows for a declarative specification of latent relational structures, which can then be efficiently discovered in a given data set using neural network learning. Experiments on 78 relational learning benchmarks clearly demonstrate the effectiveness of the framework.
Gustav Sír, Vojtech Aschenbrenner, Filip Zelezný, Steven Schockaert, Ondrej Kuzelka
J. Artif. Intell. Res.2