Skip to search formSkip to main contentSkip to account menu

LIRS caching algorithm

Known as: LIRS, The LIRS caching algorithm 
LIRS (Low Inter-reference Recency Set) is a page replacement algorithm with an improved performance over LRU (Least Recently Used) and many other… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
InfinispanLocality of referenceMySQLNetBSD

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
E-GOVERNANCE, REVENUE GENERATION AND PUBLIC SERVICE DELIVERY IN NIGERIA: AN OVERVIEW OF THE E- TAXATION SYSTEM IN LAGOS STATE
  • 2017
  • Corpus ID: 169586453
In the early 90s, e-governance became a global pursuit towards improving public service delivery. Nigeria joined the bandwagon of… 
2013
2013
X REVENUE GENERATION AND ENGAGEMENT OF TAX CONSULTANTS IN LAGOS STATE , NIGERIA : CONTINUOUS TAX EVASION AND IRREGULARITIES
equirement of governments to provide public goods and execute other developmental projects that would improve living standard of… 
2013
2013
On scientific research information system
The presented paper proposes a design of a scientific research information system (SRIS), intended for real world use according… 
Review
2013
Review
2013
Review and Comparison of Various Feature Extraction Techniques in CBIR
In fields such as medical, art galleries, museums, archaeology, medical imaging, trademark databases, criminal investigations… 
2012
2012
Column wise DCT plane sectorization in CBIR
Content Based Image Retrieval (CBIR) is the application of computer vision techniques used to retrieve digital images from a… 
2011
2011
An LIRS-Based Replica Replacement Strategy for Data-Intensive Applications
Data Replication, creating identical copies of data on different sites geographically, is one of the effective optimization… 
2010
2010
DCT Sectorization for Feature Vector Generation in CBIR
We have introduced a novel idea of sectorization of DCT transformed components. In this paper we have proposed two different… 
2001
2001
Characterization results of all shortest paths interval routing schemes
We give complete characterizations for the classes of graphs with uniform cost links that admit optimum all shortest paths 1… 
1999
1999
Lower bounds for linear interval routing
Linear interval routing is a space-efficient routing method for point-to-point communication networks. It is a restricted variant… 
1997
1997
Real-time edge detection of obstacles in range image by automatically thresholding the normalized range difference
This paper presents a new method for rapidly detecting obstacles in a spherical coordinate system using range images sensed by a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)