CSEIT2062123 | Accepted : 15 April 2020 | Published : 24 April 2020 | March-April-2020 [ 6 (2) : 433-439 ] International Journal of Scientific Research in Computer Science, Engineering and Information Technology © 2020 IJSRCSEIT | Volume 6 | Issue 2 | ISSN : 2456-3307 DOI : https://doi.org/10.32628/CSEIT2062123 433 Hybrid Page Replacement Algorithm in real time Operating System Pallab Banerjee 1 , Biresh Kumar 2 , Amarnath Singh 3 , Shipra Sinha 4 , Medha Sawan 5 1,2,3 Assistant Professor, Department of Computer Science and Engineering, Amity University Jharkhand, Ranchi, India 4,5 B.Tech Scholar, Department of Computer Science and Engineering, Amity University Jharkhand, Ranchi, India ABSTRACT Programming codes are of variable length. When the size of codes becomes greater than that of primary memory, the concept of virtual memory comes into play. As the name suggests, virtual memory allows to outstretch the use of primary memory by using storage devices such as disks. The implementation of virtual memory can be done by using the paging approach. Allocation of memory frames to each and every program is done by the operating system while loading them into the memory. Each program is segregated into pages as per the size of frames. Equal size of pages and frames enhance the usability of memory. As, the process or program which is being executed is provided with a certain amount of memory frames; therefore, swap out technique is necessary for the execution of each and every page. This swap out technique is termed as Page Replacement. There are many algorithms proposed to decide which page needs to be replaced from the frames when new pages come. In this paper, we have proposed a new page replacement technique. This new technique is based on the approach of reading and counting of the pages from secondary storage. Whenever the page fault is detected, the needed page is fetched from the secondary storage. This process of accessing the disc is slow as compared to the process in which the required page is retrieved from the primary storage. In the proposed technique, the pages having least occurrence will be replaced by the new page and the pages having same count will be replaced on the basis of LRU page replacement algorithm. In this method, the paged are retrieved from the secondary storage hence, possibility of page hit will be increased and as a result, the execution time of the processes will be decreased as the possibility of page miss will be decreased. Keywords : Page Replacement, Page Fault, Page Hit, Page Miss, LRU (Least Recently Used) I. INTRODUCTION Memory management is the service provided by the Operating System. This manages primary memory. The processes are carried back and forth from secondary storage such as disc to the main memory or primary memory [1]. The process of carrying processes from primary storage to secondary storage for execution to make the memory available for other processes is known as swapping. A processor can use more memory for execution than the amount of primary memory. This extra amount of memory is called virtual memory. Virtual memory is nothing but a section of hard disk that imitates as primary memory. Virtual memory is generally attained with the demand paging. Segmentation is also used to provide virtual memory. Demand segmentation is one of the techniques to provide virtual memory.