Michael Swift
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Michael Swift has a total of 62 co-authors. Here are the top co-authors by number of shared publications:
- Sujay Yadalam
The University of Texas at Austin, Austin, USA
6 shared publications - Aditya Akella
The University of Texas at Austin, Austin, TX, USA
3 shared publications - Christopher J. Rossbach
University of Texas Austin and Microsoft, Austin, TX, USA
3 shared publications - Ashwin Poduval
Department of Computer Sciences, University of Wisconsin-Madison, Madison, WI, USA
2 shared publications - Bijan Tabatabai
University of Wisconsin-Madison, Computer Sciences, Madison, USA
2 shared publications - Ming Liu
University of Wisconsin-Madison, Madison, Wisconsin, USA
2 shared publications
Latest Publications
- Open Access
- 17 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 130-143
The Kernel Always Knows: Understanding Isolation via Kernel Objects
- 17 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 130-143
Open AccessThe Kernel Always Knows: Understanding Isolation via Kernel Objects
- Open Access
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1623-1638
Operating System Policies in the Wild
- 14 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1623-1638
Open AccessOperating System Policies in the Wild
- Open Access
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 27-34
To Tier, or Not? Evaluating Tiered Memory Systems on the Basis of Cost
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 27-34
Open AccessTo Tier, or Not? Evaluating Tiered Memory Systems on the Basis of Cost
- Open Access
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Regional Policies for Memory Tiering Systems
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessRegional Policies for Memory Tiering Systems
- Open Access
- 11 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 108-122
Bandwidth Speaks, We Listen: Dynamic Memory Interleaving for Tiering
- 11 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 108-122
Open AccessBandwidth Speaks, We Listen: Dynamic Memory Interleaving for Tiering
- Open Access
- 19 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 44 (4) , 1-34
Fast Integrity Checking for Secure Cloud Storage: A Quantitative Approach
Merkle hash trees are the standard method to protect the integrity and freshness of stored data. However, hash trees introduce additional compute and I/O costs on the I/O critical path, and prior efforts have not fully characterized these costs. In this paper, we quantify performance overheads of storage-level hash trees in realistic settings. We identify that hashing (CPU) costs are the primary performance bottleneck, and develop an analytical model demonstrating why this occurs. We then design an optimized tree structure called Dynamic Merkle Trees (DMTs) that exploits patterns in workloads to reduce tree traversal costs. We implement DMTs in a block device driver and a file system and through extensive evaluation show that DMTs can exploit patterns in workloads to deliver up to a 2.2 × throughput and latency improvement over the state of the art. Our novel approach provides a promising new direction to achieve integrity guarantees in storage efficiently and at scale.
- 19 May 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 44 (4) , 1-34
Open AccessFast Integrity Checking for Secure Cloud Storage: A Quantitative Approach
Merkle hash trees are the standard method to protect the integrity and freshness of stored data. However, hash trees introduce additional compute and I/O costs on the I/O critical path, and prior efforts have not fully characterized these costs. In this paper, we quantify performance overheads of storage-level hash trees in realistic settings. We identify that hashing (CPU) costs are the primary performance bottleneck, and develop an analytical model demonstrating why this occurs. We then design an optimized tree structure called Dynamic Merkle Trees (DMTs) that exploits patterns in workloads to reduce tree traversal costs. We implement DMTs in a block device driver and a file system and through extensive evaluation show that DMTs can exploit patterns in workloads to deliver up to a 2.2 × throughput and latency improvement over the state of the art. Our novel approach provides a promising new direction to achieve integrity guarantees in storage efficiently and at scale.
- Open Access
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 31-36
OQueue: Observable Communication in Learning Directed Operating Systems
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 31-36
Open AccessOQueue: Observable Communication in Learning Directed Operating Systems
- Open Access
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Striking the Right Chord: Parameter Tuning in Memory Tiering Systems
- 13 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessStriking the Right Chord: Parameter Tuning in Memory Tiering Systems
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 48-54
InXpect: Lightweight XDP Profiling
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 48-54
Open AccessInXpect: Lightweight XDP Profiling
- Open Access
- 7 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 33-44
Caplification: Bridging Capability-Aware and Capability-Oblivious Software
- 7 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 33-44
Open AccessCaplification: Bridging Capability-Aware and Capability-Oblivious Software