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

James G. Thompson

dblp:95/4015 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1989
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorSoftware 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
2 papers
Memory systems · 69% Storage systems · 27% Performance modeling and evaluation · 4%

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

TopicWeightPapersLastEvidence papers
Memory systems
cache
0.011989
Efficient (Stack) Algorithms for Analysis of Write-Back and Sector Machines · ACM Trans. Comput. Syst. 1989
Memory systems › cache › cache organization
sectored cache
0.011989
Efficient (Stack) Algorithms for Analysis of Write-Back and Sector Machines · ACM Trans. Comput. Syst. 1989
Memory systems › cache › cache organization
write cache
0.011989
Efficient (Stack) Algorithms for Analysis of Write-Back and Sector Machines · ACM Trans. Comput. Syst. 1989
Storage systems
file systems
0.011985
A Trace-Driven Analysis of the UNIX 4.2 BSD File System · SOSP 1985
Storage systems › file systems
file system workload
0.011985
A Trace-Driven Analysis of the UNIX 4.2 BSD File System · SOSP 1985
Performance modeling and evaluation
trace analysis
0.011985
A Trace-Driven Analysis of the UNIX 4.2 BSD File System · SOSP 1985

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

stack analysis simulation · 0.0prefetching · 0.0trace analysis · 0.0
YearPublicationVenuePosition
1989 Efficient (Stack) Algorithms for Analysis of Write-Back and Sector Machines
abstract
For the class of replacement algorithms known as stack algorithms, existing analysis techniques permit the computation of memory miss ratios for all memory sizes simultaneously in one pass over a memory reference string. We extend the class of computations possible by this methodology in two ways. First, we show how to compute the effects of copy-backs in write-back caches. The key observation here is that a given block is clean for all memory sizes less than or equal to C blocks and is dirty for all larger memory sizes. Our technique permits efficient computations for algorithms or systems using periodic write-back and/or block deletion. The second extension permits stack analysis simulation for sector (or subblock) caches in which a sector (associated with an address tag) consists of subsectors (or subblocks) that can be loaded independently. The key observation here is that a subsector is present only in caches of size C or greater. Load forward prefetching in a sector cache is shown to be a stack algorithm and is easily simulated using our technique. Running times for our methods are only slightly higher than for a simulation of a single memory size using nonstack techniques.
James G. Thompson, Alan Jay Smith
ACM Trans. Comput. Syst.1
1985 A Trace-Driven Analysis of the UNIX 4.2 BSD File System
abstract
Article Free Access Share on A trace-driven analysis of the UNIX 4.2 BSD file system Authors: John K. Ousterhout Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CA Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CAView Profile , Hervé Da Costa Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CA Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CAView Profile , David Harrison Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CA Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CAView Profile , John A. Kunze Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CA Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CAView Profile , Mike Kupfer Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CA Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CAView Profile , James G. Thompson Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CA Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CAView Profile Authors Info & Claims SOSP '85: Proceedings of the tenth ACM symposium on Operating systems principlesDecember 1985 Pages 15–24https://doi.org/10.1145/323647.323631Published:01 December 1985Publication History 390citation1,640DownloadsMetricsTotal Citations390Total Downloads1,640Last 12 Months127Last 6 weeks18 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
John K. Ousterhout, Hervé Da Costa, David Harrison, John A. Kunze, Michael D. Kupfer, James G. Thompson
SOSP6