Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
164
Performance Analysis of LRU Page Replacement Algorithm with Reference to different Data Structure
"... The process takes less time for handling instructions then would be speedy and efficient. The speed of the process is not only depends on architectural features and operational frequency, but also depends on the algorithm and data structure, which is used for that process. There are many page replac ..."
Abstract
- Add to MetaCart
replacement algorithms such as Least Recently Used ((LRU), First-In-First-Out (FIFO), etc. are available in memory management. Performance of any page replacement algorithm depends on data structure which is used to implement a page table. Now a day, hash table is widely used to implement a page table because
Visualizing Page Replacement Techniques based on Page Frequency and Memory Access Pattern
"... Abstract — Virtual memory technique is used by many operating systems. This technique requires an efficient page replacement technique because it severely affects the performance of a computer system. Some of the page replacement techniques are first in first out, least recently used, optimal etc. O ..."
Abstract
- Add to MetaCart
rapidly than the histogram of least recently used one. Also pages of large frequency of occurrence contribute much to the total number of page faults in both least recently used and optimal page replacement algorithms. It visualizes and concludes that lru follows optimal in memory access pattern for page
Histogram based Analysis of Page Replacement Techniques
"... Modern operating systems use virtual memory concept because of its advantages but they use different page replacement techniques.An efficient page replacement technique is required so as to produce minimum number of page faults. Some of the page replacement techniques are FIFO, LRU, OPTIMAL etc.Opti ..."
Abstract
- Add to MetaCart
number of page faults in both LRU and optimal page replacement algorithms. General Terms Operating system, virtual replacement techniques. memory, simulation of page
A Throughput Analysis on Page Replacement Algorithms in Cache Memory Management
"... Abstract: The less time any processor takes in handling instructions the more would be its speed and efficiency. The speed of a processing device is not only based on it’s Architectural features or Operational frequencies but also it needs to be dependent on the Memory mapping. A processors memory m ..."
Abstract
- Add to MetaCart
be brought to fast extent by fast replacements of pages. This paper presents the various replacement algorithms with their performance analysis.
A Two Layered approach to perform Effective Page Replacement
"... Abstract: -In a multi processor system, when the request are performed more frequently, more effective management of cache is required. Cache is small size memory available in system that holds both data and instruction. In case of shared cache, the management of cache is more critical. Cache memor ..."
Abstract
- Add to MetaCart
. In this work a two level cache is been defined. In first level the prioritization of the cache contents is been defined based on the type of contents. At the second level the replacement is been performed by analyzing the page utility and the frequency of the access. The analysis of the work is been performed
Abstract EELRU: Simple and Effective Adaptive Page Replacement
"... Despite the many replacement algorithms proposed through-out the years, approximations of Least Recently Used (LRU) replacement are predominant in actual virtual memory man-agement systems because of their simplicity and efficiency. LRU, however, exhibits well-known performance problems for regular ..."
Abstract
- Add to MetaCart
several principles which could be widely useful for adaptive page replacement al-gorithms: (1) it adapts to changes in program behavior, distinguishing important behavior characteristics for each workload. In particular, EELRU is not affected by high-frequency behavior (e.g., loops much smaller than
Least-Recently-Used Caching with Dependent Requests
- Theoretical Computer Science
, 2002
"... We investigate a widely popular Least-Recently-Used (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility for modeling strong statistical correlation, including the widely reported long-range dependence in the World Wide Web page request ..."
Abstract
-
Cited by 24 (6 self)
- Add to MetaCart
We investigate a widely popular Least-Recently-Used (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility for modeling strong statistical correlation, including the widely reported long-range dependence in the World Wide Web page
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication.> REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < 1 A Meth
"... Abstract—A general method for fault detection and isolation is proposed and applied to inverter faults in drives of electric vehicles. This method is based on a change-detection algorithm, which allows multiple fault indices to be combined for retrieving the most likely state of the drive. The drive ..."
Abstract
- Add to MetaCart
Abstract—A general method for fault detection and isolation is proposed and applied to inverter faults in drives of electric vehicles. This method is based on a change-detection algorithm, which allows multiple fault indices to be combined for retrieving the most likely state of the drive
Impact of large wind power generation on frequency stability
- in Proc. IEEE Power Eng. Soc. Gen. Meeting
, 2006
"... Abstract-- 1 This paper explores the available control options for enabling wind power generation plants to participate on the maintenance of system frequency following a major power imbalance. Taking the currently employed control structures for wind generators as the baseline case, possible expan ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
considered to be the exclusive responsibility of conventional power plants. Moreover, the performance of the wind generating plants during a contingency situation, particularly their fault ride-through capability, and the impact that the wind plants make on the rest of the system is an issue of immense
ALGEBRAIC ALGORITHMS1
, 2012
"... This is a preliminary version of a Chapter on Algebraic Algorithms in the up- ..."
Abstract
- Add to MetaCart
This is a preliminary version of a Chapter on Algebraic Algorithms in the up-
Results 1 - 10
of
164
