.png){kind=icon}
Return
A Recommended Replacement Algorithm for the Scalable Asynchronous Cache Consistency Scheme
.png){kind=icon}
PRE
AI
DOI：10.1007/978-981-10-6451-7_11.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Acknowledging the widespread prevalence of mobile computing and the prominence of data caching in mobile networks has led to a myriad of efforts to alleviate their associated problems. These challenges are inherited from the mobile environment because of low bandwidth, limited battery power, and mobile disconnectedness. Many caching techniques were presented in literature; however, Scalable Asynchronous Cache Consistency Scheme (SACCS) that proved to be highly scalable with minimum database management overhead. SACCS was initially implemented with Least Recently Used (LRU) as a cache replacement policy. In this project we adopted the Extended LRU (E-LRU) as a cache replacement strategy to be applied in SACCS. A simulation of SACCS was done with the E-LRU, Least Recently Used, Most Recently Used, Most Frequently Used, and Least Frequently Used; and the comparative evaluation showed that SACCS with E-LRU is superior in terms of delay time, hit ratio, miss ratio and data downloaded per query.
Keywords:
Mobile computing
Cache consistency
Replacement policy
Invalidation strategy
Hybrid algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
0
Papers:
1
Citations:
0
Organization
Cited Papers
ShareSaveShareSaveBand gap engineering of Si-Ge alloys for mid-temperature thermoelectric applications.png)
AIP Advances
OAAI
AIP AdvancesIF0
OAAIShareSave no more
no more