An analysis of prepaging
From MaRDI portal
Publication:598802
DOI10.1007/BF02243562zbMATH Open0413.68025OpenAlexW2151367571MaRDI QIDQ598802FDOQ598802
Authors: Kishor S. Trivedi 
Publication date: 1979
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02243562
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- MIN—an optimal variable-space page replacement algorithm
- A Modified Working Set Paging Algorithm
- Title not available (Why is that?)
- Characteristics of program localities
- Prepaging and Applications to Array Algorithms
- On the Paging Performance of Array Algorithms
- Title not available (Why is that?)
- A model for masking rotational latency by dynamic disk allocation
- An analysis of paging and program behaviour
- Title not available (Why is that?)
- Principles of Optimal Page Replacement
- Title not available (Why is that?)
This page was built for publication: An analysis of prepaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598802)
