Sean Bauer

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

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

Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Cloud and datacenter computing · 86% Memory systems · 14%
Computer graphics and multimedia
1 paper
Computer animation and physical simulation · 62% Rendering · 19% Geometric modeling and processing · 19%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
datacenter network
0.412019
Snap: a microkernel approach to host networking · SOSP 2019
Cloud and datacenter computing › virtualization › network virtualization
network function virtualization
0.412019
Snap: a microkernel approach to host networking · SOSP 2019
Cloud and datacenter computing
userspace networking
0.412019
Snap: a microkernel approach to host networking · SOSP 2019
Computer animation and physical simulation
fluid simulation
0.212014
SPGrid: a sparse paged grid structure applied to adaptive smoke simulation · ACM Trans. Graph. 2014
Memory systems
virtual memory management
0.212014
SPGrid: a sparse paged grid structure applied to adaptive smoke simulation · ACM Trans. Graph. 2014
Operating systems › kernel › kernel design › microkernel
microkernel design
0.112019
Snap: a microkernel approach to host networking · SOSP 2019
Geometric modeling and processing
multigrid solver
0.112014
SPGrid: a sparse paged grid structure applied to adaptive smoke simulation · ACM Trans. Graph. 2014
Rendering
physically based rendering
0.112014
SPGrid: a sparse paged grid structure applied to adaptive smoke simulation · ACM Trans. Graph. 2014

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

kernel bypass · 0.8RDMA · 0.8virtual memory paging · 0.4stencil computation · 0.4multigrid preconditioned conjugate gradient · 0.4
YearPublicationVenuePosition
2019 Snap: a microkernel approach to host networking
abstract
This paper presents our design and experience with a microkernel-inspired approach to host networking called Snap. Snap is a userspace networking system that supports Google's rapidly evolving needs with flexible modules that implement a range of network functions, including edge packet switching, virtualization for our cloud platform, traffic shaping policy enforcement, and a high-performance reliable messaging and RDMA-like service. Snap has been running in production for over three years, supporting the extensible communication needs of several large and critical systems.
Michael Marty, Marc de Kruijf, Jacob Adriaens, Christopher Alfeld, Sean Bauer, Carlo Contavalli, Michael Dalton, Nandita Dukkipati, William C. Evans, Steve D. Gribble, Nicholas Kidd, Roman Kononov, Gautam Kumar 0001, Carl Mauer, Emily Musick, Lena E. Olson, Erik Rubow, Michael Ryan, Kevin Springborn, Valas Valancius, Amin Vahdat
SOSP5
2014 SPGrid: a sparse paged grid structure applied to adaptive smoke simulation
abstract
We introduce a new method for fluid simulation on high-resolution adaptive grids which rivals the throughput and parallelism potential of methods based on uniform grids. Our enabling contribution is SPGrid , a new data structure for compact storage and efficient stream processing of sparsely populated uniform Cartesian grids. SPGrid leverages the extensive hardware acceleration mechanisms inherent in the x86 Virtual Memory Management system to deliver sequential and stencil access bandwidth comparable to dense uniform grids. Second, we eschew tree-based adaptive data structures in favor of storing simulation variables in a pyramid of sparsely populated uniform grids, thus avoiding the cost of indirect memory access associated with pointer-based representations. We show how the costliest algorithmic kernels of fluid simulation can be implemented as a composition of two kernel types: (a) stencil operations on a single sparse uniform grid, and (b) structured data transfers between adjacent levels of resolution, even when modeling non-graded octrees. Finally, we demonstrate an adaptive multigrid-preconditioned Conjugate Gradient solver that achieves resolution-independent convergence rates while admitting a lightweight implementation with a modest memory footprint. Our method is complemented by a new interpolation scheme that reduces dissipative effects and simplifies dynamic grid adaptation. We demonstrate the efficacy of our method in end-to-end simulations of smoke flow.
Rajsekhar Setaluri, Mridul Aanjaneya, Sean Bauer, Eftychios Sifakis
ACM Trans. Graph.3