2019 International Conference on Information Science and Communication Technology (ICISCT) 2019
DOI: 10.1109/cisct.2019.8777407
|View full text |Cite
|
Sign up to set email alerts
|

Second Chance Page Replacement Algorithm with Optimal (SCAO)

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 1 publication
0
1
0
Order By: Relevance
“…LFO2 marks the request as to-cache only if its likelihood is higher than a threshold, known as Likelihood Threshold in this paper. The idea of giving objects that are about to be evicted a second chance has been shown to be enhance performance in areas such as memory paging [28]. Note that it is inevitable that LFO2 mistakenly marks a request as to-cache when trying to give the request a second chance.…”
Section: Lfo2 Algorithmmentioning
confidence: 99%
“…LFO2 marks the request as to-cache only if its likelihood is higher than a threshold, known as Likelihood Threshold in this paper. The idea of giving objects that are about to be evicted a second chance has been shown to be enhance performance in areas such as memory paging [28]. Note that it is inevitable that LFO2 mistakenly marks a request as to-cache when trying to give the request a second chance.…”
Section: Lfo2 Algorithmmentioning
confidence: 99%