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

Satoshi Asami

dblp:24/2057 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 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
1 paper
Storage systems · 91% Memory systems · 9%

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

TopicWeightPapersLastEvidence papers
Storage systems
file systems
0.011992
Non-Volatile Memory for Fast, Reliable File Systems · ASPLOS 1992
Storage systems › file systems › file system design
persistent memory file system
0.011992
Non-Volatile Memory for Fast, Reliable File Systems · ASPLOS 1992
Storage systems › buffer management
write buffering
0.011992
Non-Volatile Memory for Fast, Reliable File Systems · ASPLOS 1992
Memory systems
non-volatile memory
0.011992
Non-Volatile Memory for Fast, Reliable File Systems · ASPLOS 1992

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

trace-driven simulation · 0.0
YearPublicationVenuePosition
1992 Non-Volatile Memory for Fast, Reliable File Systems
abstract
Given the decreasing cost of non-volatile RAM (NVRAM), by the late 1990’s it will be feasible for most workstations to include a megabyte or more of NVRAM, enabling the design of higher-performance, more reliable systems. We present the trace-driven simulation and analysis of two uses of NVRAM to improve I/O performance in distributed file systems: non-volatile file caches on client workstations to reduce write traffic to file servers, and write buffers for write-optimized file systems to reduce server disk accesses. Our results show that a megabyte of NVRAM on diskless clients reduces the amount of file data written to the server by 40 to 50%. Increasing the amount of NVRAM shows rapidly diminishing returns, and the particular NVRAM block replacement policy makes little difference to write traffic. Closely integrating the NVRAM with the volatile cache provides the best total traffic reduction. At today’s prices, volatile memory provides a better performance improvement per dollar than NVRAM for client caching, but as volatile cache sizes increase and NVRAM becomes cheaper, NVRAM will become cost effective. On the server side, providing a one-half megabyte write-buffer per file system reduces disk accesses by about 20 % on most of the measured logstructured file systems (LFS), and by 90 % on one heavilyused file system that includes transaction-processing workloads. 1.
Mary Baker, Satoshi Asami, Etienne Deprit, John K. Ousterhout, Margo I. Seltzer
ASPLOS2