Jonas Fietz

dblp:117/6977 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · none

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

Systems, architecture and hardware · 3 · 2 first-authorComputer networks · 1

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
Cloud and datacenter computing · 56% Distributed systems · 44%
Computer networks
1 paper
Software-defined and programmable networks · 77% Network measurement and analytics · 23%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
datacenter RPC
0.412019
R2P2: Making RPCs first-class datacenter citizens · USENIX ATC 2019
Distributed systems
remote procedure call
0.412019
R2P2: Making RPCs first-class datacenter citizens · USENIX ATC 2019
Software-defined and programmable networks
network function virtualization
0.312018
Automated synthesis of adversarial workloads for network functions · SIGCOMM 2018
Cloud and datacenter computing › datacenter network
datacenter communication
0.112019
R2P2: Making RPCs first-class datacenter citizens · USENIX ATC 2019

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

datacenter networking · 0.4RPC optimization · 0.4directed symbolic execution · 0.3cache modeling · 0.3LLVM · 0.3
YearPublicationVenuePosition
2019 R2P2: Making RPCs first-class datacenter citizens
Marios Kogias, George Prekas, Adrien Ghosn, Jonas Fietz, Edouard Bugnion
USENIX ATC4
2018 Automated synthesis of adversarial workloads for network functions
abstract
Software network functions promise to simplify the deployment of network services and reduce network operation cost. However, they face the challenge of unpredictable performance. Given this performance variability, it is imperative that during deployment, network operators consider the performance of the NF not only for typical but also adversarial workloads. We contribute a tool that helps solve this challenge: it takes as input the LLVM code of a network function and outputs packet sequences that trigger slow execution paths. Under the covers, it combines directed symbolic execution with a sophisticated cache model to look for execution paths that incur many CPU cycles and involve adversarial memory-access patterns. We used our tool on 11 network functions that implement a variety of data structures and discovered workloads that can in some cases triple latency and cut throughput by 19% relative to typical testing workloads.
Luis Pedrosa, Rishabh Iyer 0002, Arseniy Zaostrovnykh, Jonas Fietz, Katerina J. Argyraki
SIGCOMM4
2016 VNToR: Network Virtualization at the Top-of-Rack Switch
abstract
Cloud providers typically implement abstractions for network virtualization on the server, within the operating system that hosts the tenant virtual machines or containers. Despite being flexible and convenient, this approach has fundamental problems: incompatibility with bare-metal support, unnecessary performance overhead, and susceptibility to hypervisor breakouts. To solve these, we propose to offload the implementation of network-virtualization abstractions to the top-of-rack switch (ToR). To show that this is feasible and beneficial, we present VNToR, a ToR that takes over the implementation of the security-group abstraction. Our prototype combines commodity switching hardware with a custom software stack and is integrated in OpenStack Neutron. We show that VNToR can store tens of thousands of access rules, adapts to traffic-pattern changes in less than a millisecond, and significantly outperforms the state of the art.
Jonas Fietz, Sam Whitlock, George Ioannidis, Katerina J. Argyraki, Edouard Bugnion
SoCC1
2012 Optimized Hybrid Parallel Lattice Boltzmann Fluid Flow Simulations on Complex Geometries
Jonas Fietz, Mathias J. Krause, Christian Schulz 0003, Peter Sanders 0001, Vincent Heuveline
Euro-Par1