Skip to main content
SpringerLink
Log in

A page replacement algorithm based on a fuzzy approach to improve cache memory performance

  • Foundations
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The memory management in the operating system includes a part called the page replacement algorithms. Replacement algorithms in environments that require high-performance computing are considered as an important issue. For example, these algorithms are very important in cache management in microprocessors, web caching, replication strategies in distributed information systems and so on. Due to the important role of replacement algorithms in overcoming the problem of performance caused by the difference in processor speeds and memory, many algorithms were proposed. Most of them are the developed schemes of the least frequently used (LFU) and least recently used (LRU). Although most proposed designs can solve the LRU and LFU defects, they are implemented in a difficult way. The most important advantage of LRU and LFU is their simple implementation. This research proposes a page replacement algorithm that is simple to implement. The algorithm, which uses three parameters to cluster cache pages, is called the fuzzy page replacement algorithm. Whenever a miss occurs, it selects a page of the cluster with the lowest priority which has the smallest Euclidean distance with its center and then exits the cache. The most significant advantage of the algorithm is using the FCM (fuzzy c-means) algorithm to cluster pages, resulting in better replacement and hence higher memory performance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Abid SM, Youssef H (2010) Impact of one-timer/N-timer object classification on the performance of web cache replacement algorithms. In: 2010 IEEE/WIC/ACM international conference on web intelligence and intelligent agent technology (WI-IAT) 1, pp 208–211

  • Akbari BD, Jazayeri RADH, Berenjian G (2012) An improvement in WRP block replacement policy with reviewing and solving its problems. Adv Comput Res 3:67–75

    Google Scholar 

  • Albayrak S, Amasyali F (2003) Fuzzy c-means clustering on medical diagnostic systems. In: Proceedings of international twelfth turkish symposium on artificial intelligence and neural networks (TAINN 2003), Canakkale, Turkey (July 2003), pp 1–3

  • Bagchi S (2016) Distributed scheduling with probabilistic and fuzzy classifications of processes. Future Gener Comput Syst 62:1–16

    Article  Google Scholar 

  • Bansal S, Modha DS (2004) CAR: clock with adaptive replacement. FAST 4:187–200

    Google Scholar 

  • Batra GK, Tomar P (2017) A novel longest distance first page replacement algorithm. Sci Technol 10:1–6

    Google Scholar 

  • Bezdek JC, Ehrlich R, Full W (1984) FCM: the fuzzy c-means clustering algorithm. Comput Geosci 10:191–203

    Article  Google Scholar 

  • Borst S, Gupta V, Walid (2010) A distributed caching algorithms for content distribution networks. In: 2010 Proceedings of INFOCOM. IEEE, pp 1–9

  • Chen K, Jin P, Yue L (2014) A novel page replacement algorithm for the hybrid memory architecture involving PCM and DRAM. In: IFIP international conference on network and parallel computing, pp 108–119

  • Cho S, Moakar LA (2009) Augmented Fifo cache replacement policies for low-power embedded processors. J Circuits Syst Comput 18:1081–1092

    Article  Google Scholar 

  • Gupta MR, Tokekar S (2010a) A novel pair of replacement algorithms on L1 and L2 cache for FFT. Int J Comput Sci Eng 2:92–97

    Google Scholar 

  • Gupta R, Tokekar S (2010b) Proficient pair of replacement algorithms on L1 and L2 cache for merge sort. Computing 2:2151–9617

    Google Scholar 

  • Hosseini-Khayat S (2000) On Optimal replacement of nonuniform cache objects. IEEE Trans Comput 49:769–778

    Article  Google Scholar 

  • Khaleel MSA, Osman SEF, Sirour HAN (2017) Average least frequency used (ALFUR) cache replacement technology USING intelligent agents. In: International conference on communication, control, computing and electronics engineering (ICCCCEE) (2017), pp 1–5

  • Kim S, Hwang SH, Kwak JW (2018) Adaptive-classification CLOCK: page replacement policy based on read/write access pattern for hybrid DRAM and PCM main memory. Microprocess Microsyst 57:65–75

    Article  Google Scholar 

  • Kumaar R, Sharma A, Bhaskar M (2016) Reference table based cache design using LRU replacement algorithm for Last Level Cache. In: Region 10 conference (TENCON), 2016. IEEE, pp 2219–2223

  • Kushwah JS, Tamrakar S (2017) An extensive review of webs caching techniques to reduce cache pollution. Imp J Interdiscip Res 3:111–118

    Google Scholar 

  • Liu Y, Ni W, Ge Z (2017) Fuzzy decision fusion system for fault classification with analytic hierarchy process approach. Chemom Intell Lab Syst 166:61–68

    Article  Google Scholar 

  • Ma T, Hao Y, Shen W, Tian Y, Al-dhelaan A, Al-Rodhaan M (2018a) An improved web cache replacement algorithm based on weighting and cost. IEEE Access 6:27010–27017

    Article  Google Scholar 

  • Ma T, Qu J, Shen W, Tian Y, Al-Dhelaan A, Al-Rodhaan M (2018b) Weighted greedy dual size frequency based caching replacement algorithm. IEEE Access 6:7214–7223

    Article  Google Scholar 

  • Matick RE, Moreno JH, Ware MS (2011) Cache line replacement techniques allowing choice of LFU or MFU cache line replacement. International Business Machines Corp, U.S. Patent 7,958,311

  • Megiddo N, Modha DS (2003) ARC: a self-tunning, low overhead replacement cache. In: Proceedings of Usenix conference on file and storage technologies (FAST 2003), pp 115–130

  • Melin P, Castillo O (2014) A review on type-2 fuzzy logic applications in clustering, classification and pattern recognition. Appl Soft Comput 21:568–577

    Article  Google Scholar 

  • Negrão PA, Roque C, Ferreira P, Veiga L (2015) An adaptive semantics-aware replacement algorithm for web caching. Internet Serv Appl 6:1–14

    Article  Google Scholar 

  • O’Neil EJ, O’Neil PE, Weikum G (1999) An optimality proof of the LRU-K page replacement algorithm. J ACM 46:92–112

    Article  MathSciNet  Google Scholar 

  • Olanrewaju RF, Azman AW, Yaacob M (2016) Intelligent web proxy cache replacement algorithm based on adaptive weight ranking policy via dynamic aging. Indian J Sci Technol 9:0974–5645

    Google Scholar 

  • Park S, Jung D, Kang J, Kim J, Lee J (2006) CFLRU: a replacement algorithm for flash memory. In: CASES ‘06 Proceedings of the 2006 international conference on compilers, architecture and synthesis for embedded systems, pp 234–241

  • Prischepa VV (2004) An efficient web caching algorithm based on LFU-K replacement policy. In: Proceedings of the spring young researcher’s colloquium on database and information. IEEE, pp 23–26

  • Priya BK, Kumar S, Begum BS, Ramasubramanian N (2019) Cache lifetime enhancement technique using hybrid cache-replacement-policy. Microelectron Reliab 97:1–15

    Article  Google Scholar 

  • Samiee K (2009) A replacement algorithm based on weighting and ranking cache objects. Int J Hybrid Inf Technol 2:93–104

    Google Scholar 

  • Sayiraman S, Dayalan SK, Subbiah SM (2002) A framework for MF-LRU replacement policy. School of Computer Science and Engineering, College of Engineering Guindy, Anna University, Chennai, India, pp 1–5

  • Sheu JP, Chuo YC (2016) Wildcard rules caching and cache replacement algorithms in software-defined networking. IEEE Trans Netw Serv Manag 13:19–29

    Article  Google Scholar 

  • Songwattana A, Theeramunkong T, Vinh PC (2014) A learning-based approach for web cache management. Mobile Netw Appl 19:258–271

    Article  Google Scholar 

  • Tam HH, Leung MF, Wang Z, Ng SC, Cheung CC, Lui AK (2016) Improved adaptive global replacement scheme for MOEA/D-AGR. INn: 2016 IEEE Congress on evolutionary computation (CEC), pp 2153–2160

  • Tsai HB, Lei CL (2017) A page replacement algorithm based on frequency derived from reference history. In: Proceedings of the symposium on applied computing, Marrakech, Morocco, April 3–7, pp 1522–1527

  • Vijendran AS, Thavamani S (2014) Least recently used replica replacement technique in distributed computing network. In: 2014 International conference on intelligent computing applications (ICICA), pp 104–108

  • Wang YL, Lee BJ, Lee JJ, Youn HY (2015) A PSO-Based buffer management scheme for improving hit ratio of solid state drive. In: 5th international conference on IT convergence and security (ICITCS), pp 1–5

  • Wang Y, Yang Y, Han C, Ye L, Ke Y, Wang Q (2019) LR-LRU: a PACS-Oriented intelligent cache replacement policy. IEEE Access 7:8073–58084

    Google Scholar 

  • Xu F, Li Y, Gu J (2015) Semantic cache replacement strategy for XML algebra-based query optimization. Wuhan Univ J Natl Sci 20:165–172

    Article  MathSciNet  Google Scholar 

  • Yang P, Wang Q, Ye H, Zhang Z (2019) Partially shared cache and adaptive replacement algorithm for NoC-based many-core systems. Syst Archit 98:424–433

    Article  Google Scholar 

  • Zhao Y, Ma T, Hao Y, Shen W, Tian Y, Al-Dhelaan A (2019) ICRA: index based cache replacement algorithm for cloud storage. Int J Sens Netw 29:48–57

    Article  Google Scholar 

  • Zhu Q, Shankar A, Zhou Y (2004) PB-LRU: a selftuning power aware storage cache replacement algorithm for conserving disk energy. Department of Computer Science University of Illinois at Urbana Champaign, Urbaba, IL 61801, ICS’04, June 26–July 1, Malo, France, pp 79–88

  • Zou X, Chen C (2016) HQ: an architecture for web cache replacement algorithms in distributed systems. In: International conference on computer and communication engineering (ICCCE), pp 78–83

Download references

Acknowledgements

The authors would like to thank the anonymous reviewers and the associate editor for their insightful comments and suggestions.

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Babol Branch, Islamic Azad University, Babol, Iran

    Davood Akbari Bengar & Mehdi Golsorkhtabaramiri

  2. Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran

    Ali Ebrahimnejad

  3. Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran

    Homayun Motameni

Authors
  1. Davood Akbari Bengar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ali Ebrahimnejad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Homayun Motameni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mehdi Golsorkhtabaramiri
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ali Ebrahimnejad.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by A. Di Nola.

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Akbari Bengar, D., Ebrahimnejad, A., Motameni, H. et al. A page replacement algorithm based on a fuzzy approach to improve cache memory performance. Soft Comput 24, 955–963 (2020). https://doi.org/10.1007/s00500-019-04624-w

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-04624-w

Keywords

Search

Navigation