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

Tycho Nightingale

dblp:66/6694 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2024
0009-0003-6334-8979ORCID · corroborated

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

Systems, architecture and hardware · 4 · 1 first-author · 1 since 2021

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
3 papers
Memory systems · 65% Storage systems · 35%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems
storage reliability
0.122002
RAPID-Cache-A Reliable and Inexpensive Write Cache for High Performance Storage Systems · IEEE Trans. Parallel Distributed Syst. 2002
RAPID-Cache - A Reliable and Inexpensive Write Cache for Disk I/O Systems · HPCA 1999
Memory systems › cache › cache organization
write cache
0.122002
RAPID-Cache-A Reliable and Inexpensive Write Cache for High Performance Storage Systems · IEEE Trans. Parallel Distributed Syst. 2002
RAPID-Cache - A Reliable and Inexpensive Write Cache for Disk I/O Systems · HPCA 1999
Memory systems › non-volatile memory
non-volatile memory cache
0.022002
RAPID-Cache-A Reliable and Inexpensive Write Cache for High Performance Storage Systems · IEEE Trans. Parallel Distributed Syst. 2002
RAPID-Cache - A Reliable and Inexpensive Write Cache for Disk I/O Systems · HPCA 1999
Memory systems › cache management
storage caching
0.012002
RAPID-Cache-A Reliable and Inexpensive Write Cache for High Performance Storage Systems · IEEE Trans. Parallel Distributed Syst. 2002
Operating systems › i/o › i/o subsystem
device drivers
0.011999
The Design and Implementation of a DCD Device Driver for Unix · USENIX ATC, General Track 1999
Storage systems › file systems › write-optimized file system
log-structured file system
0.012002
RAPID-Cache-A Reliable and Inexpensive Write Cache for High Performance Storage Systems · IEEE Trans. Parallel Distributed Syst. 2002
Memory systems
non-volatile memory
0.011999
RAPID-Cache - A Reliable and Inexpensive Write Cache for Disk I/O Systems · HPCA 1999

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

trace-driven simulation · 0.1analytical modeling · 0.0
YearPublicationVenuePosition
2024 Towards Swap-Free, Continuous Ballooning for Fast, Cloud-Based Virtual Machine Migrations
abstract
We have a production need to reduce the time for customers to live migrate their application virtual machine (VM) in the cloud. A single customer of ours migrates their nested, cloud-based, user virtual machines tens of thousands of times a month.
Kevin Alarcón Negy, Tycho Nightingale, Hakim Weatherspoon, Zhiming Shen
SoCC2
2002 RAPID-Cache-A Reliable and Inexpensive Write Cache for High Performance Storage Systems
abstract
Modern high performance disk systems make extensive use of nonvolatile RAM (NVRAM) write caches. A single-copy NVRAM cache creates a single point of failure while a dual-copy NVRAM cache is very expensive because of the high cost of NVRAM. This paper presents a new cache architecture called RAPID-Cache for Redundant, Asymmetrically Parallel, and Inexpensive Disk Cache. A typical RAPID-Cache consists of two redundant write buffers on top of a disk system. One of the buffers is a primary cache made of RAM or NVRAM and the other is a backup cache containing a two-level hierarchy: a small NVRAM buffer on top of a log disk. The small NVRAM buffer combines small write data and writes them into the log disk in large sizes. By exploiting the locality property of I/O accesses and taking advantage of well-known Log-structured File Systems, the backup cache has nearly equivalent write performance as the primary RAM cache. The read performance of the backup cache is not as critical because normal read operations are performed through the primary RAM cache and reads from the backup cache happen only during error recovery periods. The RAPID-Cache presents an asymmetric architecture with a fast-write-fast-read RAM being a primary cache and a fast-write-slow-read NVRAM-disk hierarchy being a backup cache. The asymmetrically parallel architecture and an algorithm that separates actively accessed data from inactive data in the cache virtually eliminate the garbage collection overhead, which are the major problems associated with previous solutions such as Log-structured File Systems and Disk Caching Disk. The asymmetric cache allows cost-effective designs for very large write caches for high-end parallel disk systems that would otherwise have to use dual-copy, costly NVRAM caches. It also makes it possible to implement reliable write caching for low-end disk I/O systems since the RAPID-Cache makes use of inexpensive disks to perform reliable caching. Our analysis and trace-driven simulation results show that the RAPID-Cache has significant reliability/cost advantages over conventional single NVRAM write caches and has great cost advantages over dual-copy NVRAM caches. The RAPID-Cache architecture opens a new dimension for disk system designers to exercise trade-offs among performance, reliability, and cost.
Yiming Hu, Tycho Nightingale, Qing Yang 0001
IEEE Trans. Parallel Distributed Syst.2
1999 RAPID-Cache - A Reliable and Inexpensive Write Cache for Disk I/O Systems
abstract
This paper presents a new cache architecture called RAPID-Cache for Redundant, Asymmetrically Parallel, and Inexpensive Disk Cache. A typical RAPID-Cache consists of two redundant write buffers on top of a disk system. One of the buffers is a primary cache made of RAM or NVRAM and the other is a backup cache containing a two level hierarchy: a small NVRAM buffer on top of a log disk. The backup cache has nearly equivalent write performance as the primary RAM cache, while the read performance of the backup cache is not as critical because normal read operations are performed through the primary RAM cache and reads from the backup cache happen only during error recovery periods. The RAPID-Cache presents an asymmetric architecture with a fast-write-fast-read RAM being a primary cache and a fast-write-slow-read NVRAM-disk hierarchy being a backup cache. The asymmetric cache architecture allows cost-effective designs for very large write caches for high-end disk I/O systems that would otherwise have to use dual-copy, costly NVRAM caches. It also makes it possible to implement reliable write caching for low-end disk I/O systems since the RAPID-Cache makes use of inexpensive disks to perform reliable caching. Our analysis and trace-driven simulation results show that the RAPID-Cache has significant reliability/cost advantages over conventional single NVRAM write caches and has great cost advantages over dual-copy NVRAM caches. The RAPID-Cache architecture opens a new dimension for disk system designers to exercise trade-offs among performance, reliability and cost.
Yiming Hu, Qing Yang 0001, Tycho Nightingale
HPCA3
1999 The Design and Implementation of a DCD Device Driver for Unix
Tycho Nightingale, Yiming Hu, Qing Yang 0001
USENIX ATC, General Track1