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.

William N. Joy

dblp:52/6819 · also Bill Joy 0001 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none

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

Software engineering, systems software and programming languages · 2Systems, architecture and hardware · 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
Memory systems · 38% Performance modeling and evaluation · 34% Storage systems · 28%
Software engineering, system software, and programming languages
2 papers
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems
file systems
0.011984
A Fast File System for UNIX · ACM Trans. Comput. Syst. 1984
Performance modeling and evaluation › workload characterization
locality analysis
0.011984
A Fast File System for UNIX · ACM Trans. Comput. Syst. 1984
Operating systems › resource management › memory management
page replacement
0.011981
Converting a Swap-Based System to do Paging in an Architecture Lacking Page-Reference Bits · SOSP 1981
Memory systems › memory management › virtual memory
paging
0.011981
Converting a Swap-Based System to do Paging in an Architecture Lacking Page-Reference Bits · SOSP 1981
Memory systems › memory management
virtual memory
0.011981
Converting a Swap-Based System to do Paging in an Architecture Lacking Page-Reference Bits · SOSP 1981
Operating systems › resource management › storage management › file systems
file system interface
0.011984
A Fast File System for UNIX · ACM Trans. Comput. Syst. 1984
Performance modeling and evaluation
benchmarking
0.011981
Converting a Swap-Based System to do Paging in an Architecture Lacking Page-Reference Bits · SOSP 1981

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

throughput measurement · 0.0block allocation policy design · 0.0
YearPublicationVenuePosition
1989 Objects in their Eyes (Panel)
Esther Dyson, Bertrand Meyer 0001, Daniel L. Weinreb, William N. Joy
OOPSLA4
1984 A Fast File System for UNIX
abstract
A reimplementation of the UNIX TM file system is described.The reimplementation provides substantially higher throughput rates by using more flexible allocation policies that allow better locality of reference and can be adapted to a wide range of peripheral and processor characteristics.The new file system clusters data that is sequentially accessed and provides two block sizes to allow fast access to large files while not wasting large amounts of space for small files.File access rates of up to ten times faster than the traditional UNIX file system are experienced.Long-needed enhancements to the programmers' interface are discussed.These include a mechanism to place advisory locks on files, extensions of the name space across file systems, the ability to use long file names, and provisions for administrative control of resource usage.
Marshall K. McKusick, William N. Joy, Samuel J. Leffler, Robert S. Fabry
ACM Trans. Comput. Syst.2
1981 Converting a Swap-Based System to do Paging in an Architecture Lacking Page-Reference Bits
abstract
This paper discusses the modifications made to the UNIX operating system for the VAX-11/780 to convert it from a swap-based segmented system to a paging-based virtual memory system. Of particular interest is that the host machine architecture does not include page-referenced bits. We discuss considerations in the design of page-replacement and load-control policies for such an architecture, and outline current work in modeling the policies employed by the system. We describe our experience with the chosen algorithms based on benchmark-driven studies and production system use.
Özalp Babaoglu, William N. Joy
SOSP2