Tianyu Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Tianyu Li has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Amadou Latyr Ngom
EECS, Massachusetts Institute of Technology, Cambridge, MA, USA
1 shared publication - Badrish Chandramouli
Microsoft Research, Redmond, USA
1 shared publication - Ferdi Kossmann
CSAIL, MIT, Cambridge, MA, USA
1 shared publication - Geoffrey X. Yu
CSAIL, MIT, Cambridge, MA, USA
1 shared publication - Markos Markakis
CSAIL, MIT, Cambridge, MA, USA
1 shared publication - Samuel Madden
MIT CSAIL Cambridge MA USA
1 shared publication
Latest Publications
- Open Access
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 271-274
Virtualizing Cloud Data Infrastructures with BRAD
- 22 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 271-274
Open AccessVirtualizing Cloud Data Infrastructures with BRAD
- Open Access
- 17 June 2024
- Published by Springer Nature in The VLDB Journal
- Vol. 33 (6) , 1793-1812
Performant almost-latch-free data structures using epoch protection in more depth
Multi-core scalability presents a major implementation challenge for data system designers today. Traditional methods such as latching no longer scale in today’s highly parallel architectures. While the designer can make use of techniques such as latch-free programming to painstakingly design specialized, highly-performant solutions, such solutions are often intricate to build and difficult to reason about. Of particular interest to data system designers is a class of data structures we call almost-latch-free; such data structures can be made scalable in the common case, but have rare complications (e.g., dynamic resizing) that prevent full latch-free implementations. In this work, we present a new programming framework called Epoch-Protected Version Scheme (EPVS) to make it easy to build such data structures. EPVS makes use of epoch protection to preserve performance in the common case of latch-free operations, while allowing users to specify critical sections that execute under mutual exclusion for the rare, non-latch-free operations. We showcase the use of EPVS-based concurrency primitives in a few practical systems to demonstrate its competitive performance and intuitive guarantees. EPVS is available in open source as part of Microsoft’s FASTER project (Epoch Protected Version Scheme (source code) 2022; Microsoft FASTER 2022).
- 17 June 2024
- Published by Springer Nature in The VLDB Journal
- Vol. 33 (6) , 1793-1812
Open AccessPerformant almost-latch-free data structures using epoch protection in more depth
Multi-core scalability presents a major implementation challenge for data system designers today. Traditional methods such as latching no longer scale in today’s highly parallel architectures. While the designer can make use of techniques such as latch-free programming to painstakingly design specialized, highly-performant solutions, such solutions are often intricate to build and difficult to reason about. Of particular interest to data system designers is a class of data structures we call almost-latch-free; such data structures can be made scalable in the common case, but have rare complications (e.g., dynamic resizing) that prevent full latch-free implementations. In this work, we present a new programming framework called Epoch-Protected Version Scheme (EPVS) to make it easy to build such data structures. EPVS makes use of epoch protection to preserve performance in the common case of latch-free operations, while allowing users to specify critical sections that execute under mutual exclusion for the rare, non-latch-free operations. We showcase the use of EPVS-based concurrency primitives in a few practical systems to demonstrate its competitive performance and intuitive guarantees. EPVS is available in open source as part of Microsoft’s FASTER project (Epoch Protected Version Scheme (source code) 2022; Microsoft FASTER 2022).