Search
7 articles for “LRU”
-
Improve the Performance of Proxy Caching Using LRU, AVL Tree and BST
Abstract: Proxy caching is increase the performance to access the web pages. Multiple computer in a network uses multiple cache for better performance. Caching of Multi-level normally works through testing the minimum load cache. Uncertainty you miss a lower level cache than the search for next level cache. This paper will study L1 cache such as the primary cache and L2 cache such as the secondary form of cache of the …
Published in Journal of Web Engineering & Technology · Vol. 7, Issue 1, 2020 · pp. 13–20 Read article
-
Evaluation of Write Sequence Reordering Based Buffer Replacement Algorithms for Flash Memory Based Systems
Abstract: Many page replacement algorithms have been developed for disk-based systems. All of them consider the hit rate as a key performance measure. Flash memory has different characteristics than hard disks, such as asymmetric I/O latency among read, write, and erase operations. The read operation is faster than the write and erase operation, and it does not support in-place updates. Besides, write operations shorten the life of flash memories. Therefore, the …
Published in Journal of Computer Technology & Applications · Vol. 14, Issue 2, 2023 · pp. 36–45 Read article
-
Page Replacement Techniques: A Review
Abstract: Page replacement algorithms are utilized for virtual memory the executives and it causes the OS to choose which memory page can be moved out, making space for the as of now required page. Each algorithm fulfills the objective of reducing the number of page faults and increase page hits in different manners that will increase the performance of the process. This paper tells about the main page replacement algorithms LRU, …
Published in Recent Trends in Parallel Computing · Vol. 8, Issue 3, 2021 · pp. 9–16 Read article
-
Developing Operating System Simulation Software for Windows Based System by C# .NET Framework and an Android Application by JAVA and XML
Abstract: AbstractThe academic course named operating system (OS) is very important for undergraduate students in computer science and engineering (CSE) related discipline. In this course, the teachers mainly deliver lectures on the fundamentals issues of OS, process scheduling, paging, deadlocks handling etc. In this paper, windows OS based desktop simulation software has been developed with a view to coordinating the teachers and students to conduct the OS course interactively. Also, the …
Published in Journal of Operating Systems Development & Trends · Vol. 4, Issue 1, 2017 · pp. 9–18 Read article
-
Caching Proposal Based on Least Recently Used Algorithm and AVL Tree
Abstract: In proxy caching, the cache server gets the request for an object from a consumer. A cache is most likely saved in memory or on disk. A memory cache is in the main greater hastily to study from than a disk cache. The Least Recently Used (LRU) cache replacement calculation is a straightforward and by and large utilized plan. Proxy caching is a unique procedure to lower network traffic and …
Published in Journal of Software Engineering Tools & Technology Trends · Vol. 5, Issue 2, 2018 · pp. 37–47 Read article
-
VHDL Design of ARINC 429 Bus Protocol
Abstract: ARINC 429 is a data transfer standard for aircraft avionics which is also known as the Mark 33 DITS Specification (Digital Information Transfer System). It makes use of self-clocking and self-synchronizing techniques. ARINC-429 bus interface is used as a controlling function. It is a two-wire point-to-point serial data bus for control communications in Avionics. The bus operates at the speed of 100kb/sec; the ARINC429 is developed to provide interchangeability and …
Published in Journal of Aerospace Engineering & Technology · Vol. 6, Issue 2, 2016 · pp. 21–27 Read article
-
Application of B-trees for Design of Optimal Page Replacement Technique in Modern Operating Systems
Abstract: Algorithms related to replacing the memory pages in operating systems are critical components of modern operating systems that manage virtual memory efficiently. Current algorithms such as LRU (Least Recently Used), Clock algorithms as well as FIFO (First-In-First-Out), often struggle with the increasing demands of contemporary applications and larger memory hierarchies. This research work proposes a novel approach utilizing B-tree data structures to design an optimal page replacement technique. The proposed …
Published in International Journal of Data Structure Studies · Vol. 3, Issue 2, 2025 · pp. 23–30 Read article