An analysis of prepaging

DOI10.1007/BF02243562zbMath0413.68025OpenAlexW2151367571MaRDI QIDQ598802

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

zbMATH Keywords

pagingprepaging

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• MIN—an optimal variable-space page replacement algorithm
• Characteristics of program localities
• A Modified Working Set Paging Algorithm
• Prepaging and Applications to Array Algorithms
• On the Paging Performance of Array Algorithms
• A model for masking rotational latency by dynamic disk allocation
• An analysis of paging and program behaviour
• Principles of Optimal Page Replacement
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An analysis of prepaging