DESIGN AND SIMULATION OF PROBABILISTIC TECHNIQUES FOR CACHE REPLACEMENT

Subscribe to access this work and thousands more
ABSTRACT
We analyze a class of randomized Least-Recently-Used (LRU) cache replacement algorithms under the independent reference model with generalized Zipf’s law request probabilities. The randomization was recently proposed for Web caching as a mechanism that discriminates between different document sizes. In particular, a requested document that is not found in the cache either replaces a necessary number of least recently used documents with probability depending on its size or the cache is left unchanged. In this framework, we provide explicit asymptotic characterization of the cache fault probability. Using the derived result we prove that the asymptotic performance of this class of algorithms is optimized when the randomization probabilities are chosen inversely proportional to document sizes. In addition, for this optimized and easy to implement policy, we show that its performance is within a constant factor from the optimal static algorithm. An excellent agreement between our approximation and simulation experiments, even for small cache sizes, further validates our asymptotic results 

TABLE OF CONTENTS
TITLE PAGE
CERTIFICATION
DEDICATION 
ACKNOWLEDGEMENT 
ORGANIZATION OF WORK
ABSTRACT
TABLE OF CONTENT

CHAPTER ONE 
1.0INTRODUCTION 
1.1STATEMENT OF THE PROBLEM 
1.2PURPOSE OF THE STUDY
1.3AIM AND OBJECTIVES 
1.4SCOPE OF STUDY
1.5CONSTRAINTS 
1.6ASSUMPTION
1.7DEFINITION OF TERMS

CHAPTER TWO
2.0LITERATURE REVIEW

CHAPTER THREE
3.0DESCRIPTION AND ANALYSIS OF THE EXISTING SYSTEM 
3.1FACT FINDING METHODS USED 
3.11REFERENCES TO WRITTEN DOCUMENT
3.1.2BROWSING OF INTERNET
3.2INPUT, PROCESS, OUTPUT ANALYSIS
3.2.1INPUT, ANALYSIS
3.2.2INPUT FORMAT
3.2.3PROCESS,  ANALYSIS
3.2.4OUTPUT, ANALYSIS
3.2.5INPUT FORMAT
3.3PROBLEM OF THE EXISTING SYSTEM
3.4OBJECTIVE OF THE EXISTING SYSTEM
3.5JUSTIFICATION OF THE NEW EXISTING SYSTEM

CHAPTER FOUR 
4.0THE DESIGN OF THE NEW SYSTEM 
4.1OUTPUT SPECIFICATION AND DESIGN
4.2INPUT SPECIFICATION  AND DESIGN
4.3FILE DESIGN
4.4FILE STRUCTURE
4.5PROCEDURE CHART
4.6SYSTEM FLOWCHART
4.7SYSTEM REQUIREMENT
4.71HARDWARE REQUIREMENT
4.72SOFT WARE REQUIREMENT
5.0IMPLEMENTATION 
5.1PROGRAM DESIGN
5.2PSEUDO CODE
5.3PROGRAM FLOWCHART
6.0DOCUMENTATION
6.1CHOICE OF LANGUAGE
6.2LANGUAGE INTRODUCTION
6.3CHANGE OVER METHOD
7.0CHAPTER FIVE
8.0CONCLUSION
7.1RECOMMENDATION
BIBLIOGRAPHY 

Subscribe to access this work and thousands more
Save
Overall Rating

0

5 Star
(0)
4 Star
(0)
3 Star
(0)
2 Star
(0)
1 Star
(0)
APA

Possibility, A. (2018). DESIGN AND SIMULATION OF PROBABILISTIC TECHNIQUES FOR CACHE REPLACEMENT. Afribary. Retrieved from https://afribary.com/works/design-and-simulation-of-probabilistic-techniques-for-cache-replacement-9912

MLA 8th

Possibility, Aka "DESIGN AND SIMULATION OF PROBABILISTIC TECHNIQUES FOR CACHE REPLACEMENT" Afribary. Afribary, 29 Jan. 2018, https://afribary.com/works/design-and-simulation-of-probabilistic-techniques-for-cache-replacement-9912. Accessed 22 Feb. 2024.

MLA7

Possibility, Aka . "DESIGN AND SIMULATION OF PROBABILISTIC TECHNIQUES FOR CACHE REPLACEMENT". Afribary, Afribary, 29 Jan. 2018. Web. 22 Feb. 2024. < https://afribary.com/works/design-and-simulation-of-probabilistic-techniques-for-cache-replacement-9912 >.

Chicago

Possibility, Aka . "DESIGN AND SIMULATION OF PROBABILISTIC TECHNIQUES FOR CACHE REPLACEMENT" Afribary (2018). Accessed February 22, 2024. https://afribary.com/works/design-and-simulation-of-probabilistic-techniques-for-cache-replacement-9912