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

Moritz Hoffmann 0001

dblp:188/9957-1 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2019
0000-0002-8427-5380ORCID · conflict

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

Software engineering, systems software and programming languages · 3Systems, architecture and hardware · 1Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 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
Distributed systems · 36% Cloud and datacenter computing · 18% Memory systems · 17%
Network and information security
1 paper
Systems and software security · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.422019
Three steps is all you need: fast, accurate, automatic scaling decisions for distributed streaming dataflows · OSDI 2018
Megaphone: Latency-conscious state migration for distributed streaming dataflows · Proc. VLDB Endow. 2019
Parallel and multicore computing › parallel computation models
distributed dataflow
0.412019
Megaphone: Latency-conscious state migration for distributed streaming dataflows · Proc. VLDB Endow. 2019
Memory systems
non-volatile memory
0.412019
Memory-Side Protection With a Capability Enforcement Co-Processor · ACM Trans. Archit. Code Optim. 2019
Memory systems › non-volatile memory › persistent memory
secure persistent memory
0.412019
Memory-Side Protection With a Capability Enforcement Co-Processor · ACM Trans. Archit. Code Optim. 2019
Distributed systems
state migration
0.412019
Megaphone: Latency-conscious state migration for distributed streaming dataflows · Proc. VLDB Endow. 2019
Distributed systems
stream processing
0.412019
Megaphone: Latency-conscious state migration for distributed streaming dataflows · Proc. VLDB Endow. 2019
Cloud and datacenter computing
autoscaling
0.312018
Three steps is all you need: fast, accurate, automatic scaling decisions for distributed streaming dataflows · OSDI 2018
Electronic design automation › timing analysis
critical path analysis
0.312018
SnailTrail: Generalizing Critical Paths for Online Analysis of Distributed Dataflows · NSDI 2018
Distributed systems › stream processing
distributed stream processing
0.312018
Three steps is all you need: fast, accurate, automatic scaling decisions for distributed streaming dataflows · OSDI 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
Parallel and multicore computing
parallel programming models
0.212016
Machine-Aware Atomic Broadcast Trees for Multicores · OSDI 2016
Hardware reliability and fault tolerance
reconfiguration
0.112019
Megaphone: Latency-conscious state migration for distributed streaming dataflows · Proc. VLDB Endow. 2019
Storage systems
storage reliability
0.112019
Memory-Side Protection With a Capability Enforcement Co-Processor · ACM Trans. Archit. Code Optim. 2019

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

memory controller design · 0.8capability model · 0.8migration granularity · 0.4ahead-of-time preparation · 0.4
YearPublicationVenuePosition
2019 Megaphone: Latency-conscious state migration for distributed streaming dataflows
abstract
We design and implement Megaphone, a data migration mechanism for stateful distributed dataflow engines with latency objectives. When compared to existing migration mechanisms, Megaphone has the following differentiating characteristics: (i) migrations can be subdivided to a configurable granularity to avoid latency spikes, and (ii) migrations can be prepared ahead of time to avoid runtime coordination. Megaphone is implemented as a library on an unmodified timely dataflow implementation, and provides an operator interface compatible with its existing APIs. We evaluate Megaphone on established benchmarks with varying amounts of state and observe that compared to naïve approaches Megaphone reduces service latencies during reconfiguration by orders of magnitude without significantly increasing steady-state overhead.
Moritz Hoffmann 0001, Andrea Lattuada 0001, Frank McSherry, Vasiliki Kalavri, John Liagouris, Timothy Roscoe
Proc. VLDB Endow.1
2019 Memory-Side Protection With a Capability Enforcement Co-Processor
abstract
Byte-addressable nonvolatile memory (NVM) blends the concepts of storage and memory and can radically improve data-centric applications, from in-memory databases to graph processing. By enabling large-capacity devices to be shared across multiple computing elements, fabric-attached NVM changes the nature of rack-scale systems and enables short-latency direct memory access while retaining data persistence properties and simplifying the software stack. An adequate protection scheme is paramount when addressing shared and persistent memory, but mechanisms that rely on virtual memory paging suffer from the tension between performance (pushing toward large pages) and protection granularity (pushing toward small pages). To address this tension, capabilities are worth revisiting as a more powerful protection mechanism, but the long time needed to introduce new CPU features hampers the adoption of schemes that rely on instruction-set architecture support. This article proposes the Capability Enforcement Co-Processor (CEP), a programmable memory controller that implements fine-grain protection through the capability model without requiring instruction-set support in the application CPU. CEP decouples capabilities from the application CPU instruction-set architecture, shortens time to adoption, and can rapidly evolve to embrace new persistent memory technologies, from NVDIMMs to native NVM devices, either locally connected or fabric attached in rack-scale configurations. CEP exposes an application interface based on memory handles that get internally converted to extended-pointer capabilities. This article presents a proof of concept implementation of a distributed object store (Redis) with CEP. It also demonstrates a capability-enhanced file system (FUSE) implementation using CEP. Our proof of concept shows that CEP provides fine-grain protection while enabling direct memory access from application clients to the NVM, and that by doing so opens up important performance optimization opportunities (up to 4× reduction in latency in comparison to software-based security enforcement) without compromising security. Finally, we also sketch how a future hybrid model could improve the initial implementation by delegating some CEP functionality to a CHERI-enabled processor.
Leonid Azriel, Lukas Humbel, Reto Achermann, Alex Richardson 0001, Moritz Hoffmann 0001, Avi Mendelson, Timothy Roscoe, Robert N. M. Watson, Paolo Faraboschi, Dejan S. Milojicic
ACM Trans. Archit. Code Optim.5
2018 SnailTrail: Generalizing Critical Paths for Online Analysis of Distributed Dataflows
Moritz Hoffmann 0001, Andrea Lattuada 0001, John Liagouris, Vasiliki Kalavri, Desislava C. Dimitrova, Sebastian Wicki, Zaheer Chothia, Timothy Roscoe
NSDI1
2018 Three steps is all you need: fast, accurate, automatic scaling decisions for distributed streaming dataflows
Vasiliki Kalavri, John Liagouris, Moritz Hoffmann 0001, Desislava C. Dimitrova, Matthew Forshaw, Timothy Roscoe
OSDI3
2017 Separating Translation from Protection in Address Spaces with Dynamic Remapping
abstract
It is time to reconsider memory protection. The emergence of large non-volatile main memories, scalable interconnects, and rack-scale computers running large numbers of small "micro services" creates significant challenges for memory protection based solely on MMU mechanisms. Central to this is a tension between protection and translation: optimizing for translation performance often comes with a cost in protection flexibility.
Reto Achermann, Chris I. Dalton, Paolo Faraboschi, Moritz Hoffmann 0001, Dejan S. Milojicic, Geoffrey Ndu, Alex Richardson 0001, Timothy Roscoe, Adrian L. Shaw, Robert N. M. Watson
HotOS4
2016 Machine-Aware Atomic Broadcast Trees for Multicores
Stefan Kaestle, Reto Achermann, Roni Haecki, Moritz Hoffmann 0001, Sabela Ramos, Timothy Roscoe
OSDI4