An analysis of prepaging

DOI10.1007/BF02243562MaRDI QIDQ598802zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

pagingprepaging

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites work

• scientific article; zbMATH DE number 3502789 (Why is no real title available?)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 3592939 (Why is no real title available?)
• scientific article; zbMATH DE number 3316542 (Why is no real title available?)
• scientific article; zbMATH DE number 3349178 (Why is no real title available?)
• scientific article; zbMATH DE number 3408885 (Why is no real title available?)
• A Modified Working Set Paging Algorithm
• A model for masking rotational latency by dynamic disk allocation
• An analysis of paging and program behaviour
• Characteristics of program localities
• MIN—an optimal variable-space page replacement algorithm
• On the Paging Performance of Array Algorithms
• Prepaging and Applications to Array Algorithms
• Principles of Optimal Page Replacement

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)