#4504
100%

Ran 25 Jul 2024 05:09PM UTC

Jobs 1

Files 78

Run time 1min

Badge

Embed ▾

Committed 25 Jul 2024 09:05AM UTC coverage: 98.961% (-0.01%) from 98.974%

Build # #4504

Build Type

push

github

Committed by

ben-manes

Commit Message

add a clairvoyant admission policy to the simulator

Like Bélády's optimal policy for eviction, this estimates the upper
bound for an admission policy by using future knowledge to make the
best decision. The candidate entry is only admitted if its next access
time is less than the victim's.

While the optimal replacement policy is able to dictate the working
set, the optimal admission policy is only able to advise whether to
keep the given candidate or victim entry. Thus, the eviction policy's
choices may result in a sequence where a more naive admission policy
outperforms the clairvoyant one. The intent is to show the upper
bounds of an adaptive admission policy based on its best guess rather
than the upper bound of the overall cache hit rate.

Run Details

7621 of 7701 relevant lines covered (98.96%)

0.99 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
1	#4504.1	25 Jul 2024 05:09PM UTC	0	98.96

Source Files on build #4504

Detailed source file information is not available for this build.

ben-manes / caffeine / #4504
100%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build #4504

ben-manes / caffeine / #4504 100%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build #4504

ben-manes / caffeine / #4504
100%

README BADGES
x