Re:Otter, Fastest Go in-memory cache based on S3-FIFO algorithm
by falsandtru on Saturday December 23, 2023 @03:16PM
(#38747760)
Scan resistance and loop resistance are completely different. They are also distinguished in the papers.
[ Parent
| on HN ]
Re:Otter, Fastest Go in-memory cache based on S3-FIFO algorithm
by medler on Saturday December 23, 2023 @03:27PM
(#38747865)
None of the papers linked above or linked in the GitHub repo mention “loop resistance.”
Re:Otter, Fastest Go in-memory cache based on S3-FIFO algorithm
by senderista on Saturday December 23, 2023 @03:30PM
(#38747901)
Not completely different; they're both sequential access patterns and equivalent whenever the loop size exceeds cache size.
Re:Otter, Fastest Go in-memory cache based on S3-FIFO algorithm
by falsandtru on Saturday December 23, 2023 @03:56PM
(#38748157)
Not equivalent completely. Scan is a one-time access, so it never hits in scanning. Loop is multi-time accesses, so it can get many hits in looping if it has loop resistance. No hits on scan resistance in looping. Over.
Re:Otter, Fastest Go in-memory cache based on S3-FIFO algorithm
by falsandtru on Saturday December 23, 2023 @11:58PM
(#38751260)
I am disgusted by people who are repulsed by even the correction of a complete error. They must have bad grades in college. From now on, we have no choice but to leave it alone even if a false rumor is spread.