Abstract
Virtual memory techniques are available in modern operating system will permits the execution of a program even if it is partially available in memory thus providing an illusion of very large memory to the user and freeing the user from the concern of large program size. The primary storage size has increased by multiple order of magnitude. With several gigabytes of primary memory, algorithms that require a periodic check of each and every memory frame are becoming less and least practical. Some basic assumptions used by the traditional page replacement algorithms were invalidated, resulting in a revival of research area. Currently the usage of the object oriented programming is much higher than the structured programming. Hence the locality of reference of user software has weakened. Due to the above problem for the page replacement methods also we have to think about new methods. In this paper mainly focused on the improvement of the processor performance. In order to achieve this, the number of page faults are tried to reduce, by using the page replacement method in the correct way. In modern operating systems mainly make use of the Least Recently Used (LRU) page replacement method, in which only the arrival time of the pages to the page frame are make used. Here we made an attempt to consider both the arrival time and the number of reference done on the page is considered. By consider these two parameter we developed a new algorithm Least Recently Used and Least Frequently Used (LRU-LFU) which will give a better performance than LRU page replacement method.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Silberschatz A (1999) Peter bear. In: 1999 operating systems concepts, 5th edn. Wiley, New York
O’Neill EJ, O’Neill PE, Weikum G (1993) The LRU-K page replacement algorithm for database disk buffering SIGMOD. ACM, Washington, DC, USA
Khajoueinejad S, Sabeghi M, Sadeghzadeh A (2006) A fuzzy cache replacement policy and its experimental performance assessment. IEEE
Juurlink B (2004) Approximating the optimal replacement algorithm. CF04 April 14–16 2004. ACM 158113/149/04/0004
Jianga S, Zhangb X (2004) Token-ordered LRU: an effective page replacement policy and its implementation in Linux systems. Elsevier
Sobell MG A practical guide to solaris. Addison Wesley
Tanenbaum AS, Woodhull AS Operating system design and implementation. PHI
Das S UNIX concept and applications, 4th edn. Tata McGraw-Hill
Bryant RE, O’Hallaron D Computer systems a programmer’s perspective. Pearson Education
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media Singapore
About this paper
Cite this paper
Abraham, J.P., Mathew, S. (2017). A Novel Approach to Improve the System Performance by Proper Scheduling in Memory Management. In: Attele, K., Kumar, A., Sankar, V., Rao, N., Sarma, T. (eds) Emerging Trends in Electrical, Communications and Information Technologies. Lecture Notes in Electrical Engineering, vol 394. Springer, Singapore. https://doi.org/10.1007/978-981-10-1540-3_9
Download citation
DOI: https://doi.org/10.1007/978-981-10-1540-3_9
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-1538-0
Online ISBN: 978-981-10-1540-3
eBook Packages: EngineeringEngineering (R0)