Jacob van den Berg

dblp:22/4901 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · unresolved

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

Theory of computation · 2Systems, architecture and hardware · 1 · 1 first-author

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.

Theoretical computer science
2 papers
Distributed computing theory · 50% Computational complexity · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 67% Performance modeling and evaluation · 33%

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

TopicWeightPapersLastEvidence papers
Distributed computing theory › distributed algorithms
anonymous networks
0.021994
Computing Boolean Functions on Anonymous Networks · Inf. Comput. 1994
Computing Boolean Functions on Anonymous Networks · ICALP 1990
Computational complexity
boolean function computation
0.021994
Computing Boolean Functions on Anonymous Networks · Inf. Comput. 1994
Computing Boolean Functions on Anonymous Networks · ICALP 1990
Performance modeling and evaluation
analytical modeling
0.011993
Properties of the Miss Ratio for a 2-Level Storage Model with LRU or FIFO Replacement Strategy and Independent References · IEEE Trans. Computers 1993
Memory systems
cache
0.011993
Properties of the Miss Ratio for a 2-Level Storage Model with LRU or FIFO Replacement Strategy and Independent References · IEEE Trans. Computers 1993
Memory systems › cache management
cache replacement
0.011993
Properties of the Miss Ratio for a 2-Level Storage Model with LRU or FIFO Replacement Strategy and Independent References · IEEE Trans. Computers 1993

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

stochastic modeling · 0.0queueing theory · 0.0
YearPublicationVenuePosition
1994 Computing Boolean Functions on Anonymous Networks
Evangelos Kranakis, Danny Krizanc, Jacob van den Berg
Inf. Comput.3
1993 Properties of the Miss Ratio for a 2-Level Storage Model with LRU or FIFO Replacement Strategy and Independent References
abstract
The behavior of a two-level storage system operating with the least recently used (LRU) or the first-in, first-out (FIFO) replacement strategy, where accesses to the main storage are described by the independent reference model (IRM), is discussed. Let the size of main storage be m. It is proved that the miss ratio (i.e., the steady-state probability that the item currently required is not in main storage) exhibits the following properties: the miss ratio is a convex function of m under LRU, the function (1-miss ratio)/m is nonincreasing in m under FIFO, and the miss ratio is a Schur-convex function of the reference probabilities under FIFO.>
Jacob van den Berg, Don Towsley
IEEE Trans. Computers1
1990 Computing Boolean Functions on Anonymous Networks
Evangelos Kranakis, Danny Krizanc, Jacob van den Berg
ICALP3