Bibliography on paging and related topics
AJ Smith - ACM SIGOPS Operating Systems Review, 1978 - dl.acm.org
* Partial support for the author's research in memory hierarchies has been provided by the
National Science Foundation under grants MCS75, 0676~ and MCS77-28429 and the …
National Science Foundation under grants MCS75, 0676~ and MCS77-28429 and the …
[PDF][PDF] On the Bayesian approach to optimal performance of page storage hierarchies
A Benczúr, A Krámli, J Pergel - Acta Cybernetica, 1977 - cyber.bibl.u-szeged.hu
In connection with the work of operating systems or interactive data base systems or large
program systems of any other. destination on computers with hierarchical memory arises the …
program systems of any other. destination on computers with hierarchical memory arises the …
FIFO anomaly is unbounded
P Fornai, A Iványi - arxiv preprint arxiv:1003.1336, 2010 - arxiv.org
Virtual memory of computers is usually implemented by demand paging. For some page
replacement algorithms the number of page faults may increase as the number of page …
replacement algorithms the number of page faults may increase as the number of page …
Dynamic placement of records and the classical occupancy problem
M Arato, A Benczur - Computers & Mathematics with Applications, 1981 - Elsevier
This paper considers some mathematical problems of dynamic allocation as customers
arrive to a linear storage. We show the connection between the placement problem and the …
arrive to a linear storage. We show the connection between the placement problem and the …
On Optimal Performance in Self-Organizing Paging Algorithams
RI Phelps, LC Thomas - Journal of Information and Optimization …, 1980 - Taylor & Francis
A brief survey is given of developments in the study of self organizing paging algorithms and
the associated library problem. It has been conjectured that two related algorithms …
the associated library problem. It has been conjectured that two related algorithms …
[PDF][PDF] On optimal performance in self-organizing paging algorithms
RI Phelps, LC Thomas - Acta Cybernetica, 1980 - cyber.bibl.u-szeged.hu
A large body of literature has grown up concerned with paging algorithms [eg 1, 3, 4, 6, 10].
In the terminology of Arato [2] a program's address space is divided into equal size blocks …
In the terminology of Arato [2] a program's address space is divided into equal size blocks …
A general treatment of rearrangement problems in a linear storage
M Arató, A Benczur - Performance Evaluation, 1982 - Elsevier
Different cost models of allocation and rearrangement of a set {F 1, F 2… F n} of files are
investigated in the paper. It is assumed that the distribution p 1 (t) of the reference string ξ (t) …
investigated in the paper. It is assumed that the distribution p 1 (t) of the reference string ξ (t) …
On the Bayesian approach to optimal performance
A BENCZŰR, A KRÁMLI - researchgate.net
In connection with the work of operating systems or interactive data base systems or large
program systems of any other destination on computers with hierarchical memory arises the …
program systems of any other destination on computers with hierarchical memory arises the …
[PDF][PDF] ACTA CYBERNETICA
A ÁDÁM, F CSÁKI, S CSIBI, B DÖMÖLKI, T FREY… - core.ac.uk
ACTA CYBERNETICA sms Tomus 2. Fasciculus 1. ACTA CYBERNETICA FORUM
CENTRALE PUBLICATIONUM CYSERNETICARUM HUNGARICUM REDIGIT: L. KALMÁR …
CENTRALE PUBLICATIONUM CYSERNETICARUM HUNGARICUM REDIGIT: L. KALMÁR …
[PS][PS] BELADY'S ANOMALY IS UNBOUNDED
AM Ivanyi, P Fornai - 2001 - compalg.inf.elte.hu
Virtual memory of computers is usually implemented by demand paging. For some page
replacement algorithms the number of page faults may increase as the number of page …
replacement algorithms the number of page faults may increase as the number of page …