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.

C. Tung

dblp:14/2494 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1978
—ORCID · none

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

Databases, data management, data science and information retrieval · 1Theory of computation · 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.

Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 50% Indexing and storage engines · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 50% Memory systems · 50%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › sorting
external sorting
0.011978
The Rebound Sorter: An Efficient Sort Engine for Large Files · VLDB 1978
Memory systems › memory management › virtual memory
paging
0.011972
Locality in Page Reference Strings · SIAM J. Comput. 1972
Performance modeling and evaluation
queueing models
0.011972
Locality in Page Reference Strings · SIAM J. Comput. 1972
Memory systems › memory management
virtual memory
0.011972
Locality in Page Reference Strings · SIAM J. Comput. 1972
Performance modeling and evaluation
workload characterization
0.011972
Locality in Page Reference Strings · SIAM J. Comput. 1972

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

replacement selection · 0.0probabilistic model · 0.0external merge sort · 0.0LRU stack distance · 0.0
YearPublicationVenuePosition
1978 The Rebound Sorter: An Efficient Sort Engine for Large Files
Tien Chi Chen, Vincent Y. Lum, C. Tung
VLDB3
1972 Locality in Page Reference Strings
abstract
A probabilistic model is presented of program material in a paging machine. The sequences of page references in the model are associated with certain sequences of LRU stack distances and have reference patterns formalizing a notion of “locality” of reference. Values for parameters of the model can be chosen to make the page-exception characteristics of the generated sequences of page references consistent with those of actual program traces. The statistical properties of the execution intervals (times between page-exception) for sequences of references in the model are derived, and an application of these results is made to a queuing analysis of a simple multiprogrammed paging system. Some numerical results pertaining to the program model and the queuing analysis are given.
Gerald S. Shedler, C. Tung
SIAM J. Comput.2