SIGN IN
SIGN UP
An analysis of the performance of the page fault frequency (PFF) replacement algorithm.
Full Text:
PDF
Buy this Article
Author:
E. Sadeh
Published in:
· Proceeding
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
Pages 6-13
ACM
New York, NY
, USA
©1975
table of contents
doi>
10.1145/800213.806516
· Newsletter
ACM SIGOPS Operating Systems Review
Homepage
Volume 9 Issue 5, November 1975
Pages 6 - 13
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1067629.806516
1975 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 15
· Downloads (cumulative): 452
· Citation Count: 4
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SOSP '13
Share:
|
Tags:
algorithms
allocation/deallocation strategies
imbedded markov chain
memory requirement process
model development
page fault rate
paged virtual memory systems
performance
pff replacement algorithm
reference string
space time product
verification
virtual memory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder