2019 International Conference on Computing, Networking and Communications (ICNC) 2019
DOI: 10.1109/iccnc.2019.8685590
|View full text |Cite
|
Sign up to set email alerts
|

Flexible Evaluation Caching Using FATE

Abstract: Many algorithms have been presented to enhance caching in the Internet, and LRU (Least Recently Used) is the defacto standard used to evict data due to its ease of implementation and good performance. A limitation in creating a new caching algorithm is the cost associated with its development, testing, analysis, and efficiency in specific scenarios. The Functional Algebraic aTomic Evaluators (FATE) is introduced to address this problem. FATE is an information processing engine that evaluates information (such … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 12 publications
(10 reference statements)
0
1
0
Order By: Relevance
“…These algorithms have time complexity O(1) and widely used in many applications such as YouTube, Twitter, Facebook [69][70][71][72]. The SBS only decides eviction when dissimilarity and SBS'cache are full.…”
Section: Cache Replacement Policies (Crp)mentioning
confidence: 99%
“…These algorithms have time complexity O(1) and widely used in many applications such as YouTube, Twitter, Facebook [69][70][71][72]. The SBS only decides eviction when dissimilarity and SBS'cache are full.…”
Section: Cache Replacement Policies (Crp)mentioning
confidence: 99%