2015 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS) 2015
DOI: 10.1109/spects.2015.7285291
|View full text |Cite
|
Sign up to set email alerts
|

New caching algorithms performance evaluation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 7 publications
0
4
0
Order By: Relevance
“…In this direction, there is work that (1) searches for the best way to optimise memory allocation (Radhakrishnan, 2004;Ghandeharizadeh et al, 2015); (2) improves admission or replacement algorithms (Qin et al, 2014;Venketesh and Venkatesan, 2009;Ali Ahmed and Shamsuddin, 2011;Yang and Zhang, 2003;Saemundsson et al, 2014;Santhanakrishnan et al, 2006;Ali et al, 2012); (3) provides adaptive caching policies (Alici et al, 2012;Subramanian et al, 2006;Megiddo and Modha, 2004); or (4) automatically manages the caching at the server side (Ports et al, 2010). In addition, there are approaches (Xu et al, 2014;Zaidenberg et al, 2015;Hwang and Wood, 2013) that focus on addressing issues of a specific cache component, namely Memcached. Given that caching opportunities are often located at the application boundaries, there are approaches that focus on specific locations to cache.…”
Section: Application-level Cachingmentioning
confidence: 99%
“…In this direction, there is work that (1) searches for the best way to optimise memory allocation (Radhakrishnan, 2004;Ghandeharizadeh et al, 2015); (2) improves admission or replacement algorithms (Qin et al, 2014;Venketesh and Venkatesan, 2009;Ali Ahmed and Shamsuddin, 2011;Yang and Zhang, 2003;Saemundsson et al, 2014;Santhanakrishnan et al, 2006;Ali et al, 2012); (3) provides adaptive caching policies (Alici et al, 2012;Subramanian et al, 2006;Megiddo and Modha, 2004); or (4) automatically manages the caching at the server side (Ports et al, 2010). In addition, there are approaches (Xu et al, 2014;Zaidenberg et al, 2015;Hwang and Wood, 2013) that focus on addressing issues of a specific cache component, namely Memcached. Given that caching opportunities are often located at the application boundaries, there are approaches that focus on specific locations to cache.…”
Section: Application-level Cachingmentioning
confidence: 99%
“…Blott et al [ 16 ] proposed a hybrid solution by combining DRAMs and serial-attached flash memory. Zaidenberg et al [ 17 ] proposed five new algorithms in place of LRU for Memcached. Memcached can work with single and clustered nodes; Bakar et al [ 18 ] discussed the difference in Memcached servers’ behavior in both scenarios.…”
Section: Related Workmentioning
confidence: 99%
“…In a separate study about general caching, Zaidenberg, Gavish, and Meir [17] discussed novel caching algorithms that could potentially be applied to a Lastly, Anand and Barua [1] discussed the use of locking mechanisms in instruction cache in order to improve system performance, specifically that found in embedded systems. By locking particular lines of cache, they could assure certain elements remain in the cache for the duration of some system activity or event.…”
Section: Related Workmentioning
confidence: 99%
“…LFU involves keeping track of the number of times a particular UEC element in the cache is accessed. In the event that eviction needs to be performed when the cache is full and space is needed for new elements, the element with the lowest number of accesses will be evicted [17].…”
Section: Baseline Comparisonsmentioning
confidence: 99%