Filters








41 Hits in 4.5 sec

An analysis of the performance of the page fault frequency (PFF) replacement algorithm

E. Sadeh
1975 Proceedings of the fifth symposium on Operating systems principles - SOSP '75  
The page fault frequency (PFF) algorithm adapts to dynamic changes in program behavior during execution.  ...  The PFF algorithm uses the measured page fault frequency (by actually monitoring the Inter-pagefault interval) as the basic parameter for memory allocation decision process.  ...  Kaln of the University of Minesota, the Department of Electrical Engineering, for his helpful comments and discussions and his advice which was very instrumental in the writing of the Ph.D. thesis on part  ... 
doi:10.1145/800213.806516 dblp:conf/sosp/Sadeh75 fatcat:tpnlemos5jfprd7xwlvfqtfihe

Anomalies with variable partition paging algorithms

M. A. Franklin, G. Scott Graham, R. K. Gupta
1978 Communications of the ACM  
Two paging algorithms, the page fault frequency and working set algorithms, are examined in terms of their anomaly potential, and reference string examples of various anomalies are presented.  ...  One type of anomaly, for example, concerns the fact that, with certain reference strings and paging algorithms, an increase in mean memory allocation may result in an increase in fault rate.  ...  Anomalies with the PFF Algorithm: The PFF paging algorithm can be described in terms of an allocation and a replacement process [3] .  ... 
doi:10.1145/359361.359451 fatcat:hmhslv65jzgqbjfumirfl74nrm

Efficient memory control for avionics and embedded systems

Pinchas Weisberg, Yair Wiseman
2013 International Journal of Embedded Systems  
In order to reduce the electricity consumed by these systems, we suggest detecting the portion of the computer memory that is actually used.  ...  The other portion can be temporarily shut down and turned on again when needed. Such a shut down can notably reduce the electricity consumption of the avionics systems.  ...  PFF replacement considers high frequency of page faults as an indication of an increase in the current working set.  ... 
doi:10.1504/ijes.2013.057702 fatcat:gtwfv6qohvan7op2avbu7tmgou

Application Level Scheduling (AppLes) In Grid with Quality of Service (Qos)

Laxmi CH V T E V, Somasundaram K
2014 International Journal of Grid Computing & Applications  
In this paper we proposed architecture for Application Level Scheduling system with a resource manager and we also proposed Page fault frequency replacement algorithm (PFFR) for the Application Level Scheduling  ...  An Application-Level scheduling system (AppLeS) is applied in the grid computing to measure the performance of the application on a specific site resource and utilizes this information to make resource  ...  Table 1 Representing information of resource descriptor 3.3The Page Fault frequency replacement algorithm (PFFR) The Page Fault Frequency Replacement (PFFR) Algorithm uses the measured page fault frequency  ... 
doi:10.5121/ijgca.2014.5201 fatcat:tuoblzcitfbyzgkrr2q77figze

Working Sets Past and Present

P.J. Denning
1980 IEEE Transactions on Software Engineering  
Gelenbe, who invited me to write this paper and then patiently pored through the lengthy draft.  ...  In 1972, Chu and Opderbeck proposed the page fault frequency (PFF) policy, which was to be an easily-implemented alternative to WS [25] .  ...  Note that 1/0 can be interpreted as the maximum tolerable frequency of page faults.  ... 
doi:10.1109/tse.1980.230464 fatcat:oin5z43qlfcnjd2roasdpzffqi

Principles of database buffer management

Wolfgang Effelsberg, Theo Haerder
1984 ACM Transactions on Database Systems  
Three basic tasks have to be performed by the buffer manager: buffer search, allocation of frames to concurrent transactions, and page replacement.  ...  ; the notion of referencing versus addressing of database pages is introduced; and the concept of fixing pages in the buffer to prevent uncontrolled replacement is explained.  ...  We are grateful to Michael Brunner and Paul Hirsch for their support of the empirical study. The helpful comments of the referees are gratefully acknowledged.  ... 
doi:10.1145/1994.2022 fatcat:gcmdgt5c2rh6pmc5zbomrf7tam

An analytical study of strategy-oriented restructuring algorithms

Jehan-François Pâris, Domenico Ferrari
1984 Performance evaluation (Print)  
Acknowledgements The work reported here was supported in part by the NSF grant MeS fJQa 12900.  ...  The first P.R. algorithms based their restructuring matriX on the analySIS of the stalic structure of programs.  ...  ,J:'I'} and an upper bound of the same page fault frequl;-ncy given by n 1m., =~~Pr[r,=jnj.  ... 
doi:10.1016/0166-5316(84)90006-3 fatcat:ax2afbgc3rd2xdbtbydmm2qxuu

Active splitting strategy searching approach based on MISOCP with consideration of power island stability

Yifan ZHOU, Wei HU, Yong MIN, Le ZHENG
2019 Journal of Modern Power Systems and Clean Energy  
By considering the island stability constraints in the SSS, the proposed approach can avoid the splitting strategies with poor stability performance.  ...  Numerical simulation of a realistic provincial power system in central China demonstrates the validity of the proposed approach and the necessity of considering the island stability issues.  ...  An out-of-step oscillation between the two generator groups is clearly induced by the fault.  ... 
doi:10.1007/s40565-019-0503-z fatcat:kuur6xs6ebenjht2t4ik3wdvni

A Thread-Oriented Memory Resource Management Framework for Mobile Edge Computing

Zongwei Zhu, Fan Wu, Jing Cao, Xi Li, Gangyong Jia
2019 IEEE Access  
Increasing the number of cores is one of the most effective methods to enhance performance.  ...  However, an extensive experimental study on mobile edge computing (e.g., Android devices) indicates that the memory management system has gradually become a key performance bottleneck.  ...  In this plug-in, a new attribute called page fault frequency (PFF) is created for the thread, which is a metric to represent the thread's memory requirements [11] , TOMML organizes a red-black tree based  ... 
doi:10.1109/access.2019.2909642 fatcat:z4cddngpvberlakq4m7ufk7qwq

Generalized working sets for segment reference strings

Peter J. Denning, Donald R. Slutz
1978 Communications of the ACM  
Special cases of the cost structure allow GWS and GOPT to simulate any known stack algorithm, the working set, and VMIN.  ...  The GWS is a model for the entire class of demand-fetching memory policies that satisfy a resident-set inclusion property.  ...  Smith for comments as the many revisions of this manuscript evolved2  ... 
doi:10.1145/359588.359598 fatcat:px4u7hys5fhfljke6m6gjnyqla

Dynamic tracking of page miss ratio curve for memory management

Pin Zhou, Vivek Pandey, Jagadeesan Sundaresan, Anand Raghuraman, Yuanyuan Zhou, Sanjeev Kumar
2004 ACM SIGOPS Operating Systems Review  
of 5.86 and reduce the number of page faults by up to 63.1%.  ...  Our simulation results show that this monitor has negligible performance and energy overheads. The second method is an OS-only implementation that can track MRC at coarse time granularity.  ...  ACKNOWLEDGMENTS We thank the anonymous reviewers for useful feedback, the UIUC Opera groups for useful discussions, Paul Sack and Radu Teodorescu for proofreading the paper, and Professor Alvin R.  ... 
doi:10.1145/1037949.1024415 fatcat:gcgoazhzpfdkvlom3chcorse7y

Dynamic tracking of page miss ratio curve for memory management

Pin Zhou, Vivek Pandey, Jagadeesan Sundaresan, Anand Raghuraman, Yuanyuan Zhou, Sanjeev Kumar
2004 Proceedings of the 11th international conference on Architectural support for programming languages and operating systems - ASPLOS-XI  
of 5.86 and reduce the number of page faults by up to 63.1%.  ...  Our simulation results show that this monitor has negligible performance and energy overheads. The second method is an OS-only implementation that can track MRC at coarse time granularity.  ...  ACKNOWLEDGMENTS We thank the anonymous reviewers for useful feedback, the UIUC Opera groups for useful discussions, Paul Sack and Radu Teodorescu for proofreading the paper, and Professor Alvin R.  ... 
doi:10.1145/1024393.1024415 dblp:conf/asplos/ZhouPSRZK04 fatcat:nljtwgnd45gi7mri5ks2ne6qji

Multiprogrammed memory management

P.J. Denning, G.S. Graham
1975 Proceedings of the IEEE  
Properties of page fault functions are set forth in terms of a locality model of program behavior. Memory mani!  ...  IEEE .Abstract: A queueing network is used to show that the page fault rate functions of active programs are the critical factors in system processing efficiency.  ...  Their procedure, known as PFF (page fault frequency), recomputes a program's working set at each page fault time t of that program, using the timp interval since the prior page fault of that program (time  ... 
doi:10.1109/proc.1975.9857 fatcat:nhh4olypkbg4nft6kgerl2psly

Compiler directed memory management policy for numerical programs

Mohammad Malkawi, Janek Patel
1985 Proceedings of the tenth ACM symposium on Operating systems principles - SOSP '85  
The high level source codes of numerical programs contain useful information which can be used by a compiler to determine the memory requirements of a program.  ...  The new policy is compared with LRU and WS policies. Empirical results presented in this paper sliow that the CD policy can out-perform LRU and WS by a wide margin.  ...  (WS) [Dcnn68] and Page Fault Frequency (PFF) [ChOp72].  ... 
doi:10.1145/323647.323638 dblp:conf/sosp/MalkawiP85 fatcat:zeowi6h3mngpzklqiwobr3pz7y

Phase-change memory

Omer Zilberberg, Shlomo Weiss, Sivan Toledo
2013 ACM Computing Surveys  
This article surveys the current state of phase-change memory (PCM) as a nonvolatile memory technology set to replace flash and DRAM in modern computerized systems.  ...  Some physical properties of the technology are also discussed, providing a basis for architectural discussions. Also briefly shown are other architectural alternatives, such as FeRAM and MRAM.  ...  This of course means that upon page fault, the page that is brought into the DRAM buffer has its present bit set to 0.  ... 
doi:10.1145/2480741.2480746 fatcat:lvyy3ibbuvaszdk3wazh2tiowy
« Previous Showing results 1 — 15 out of 41 results