This simple algorithm from Carnegie Mellon is taking the world by storm.
@gkcs_7.3万 位关注者
50,761 次观看 #SystemDesign #Caching
11 条评论
评论来自 X (Twitter) 上的原帖

@rameshdhan45955
Ive seen what youve done there 🤣, great explanation though.
4 个赞

@gkcs_
Ek akela 😛
2 个赞

@techmegatrends
🚨 CrowdStrike's software meltdown wasn't a hack, but the chaos was REAL. This incident proves the vulnerability of our digital infrastructure. Educate yourself about cybersecurity. "Cybersecurity Dictionary for Everyone" is a great start! On Amazon:
1,646 个赞

@Aki0x137
Paper Link for anyone interested: I skimmed through it, and looks like it outperforms 2Q caching as well on 1-hit scenarios.
4 个赞

@AshishSingh5186
Fantastic Bhai Watching you for last 2 years
1 个赞

@antona23
Thanks for sharing Gaurav
1 个赞

@gkcs_
Cheers!

@aman_kharbas
This is gold, and that was funny 😅
1 个赞

@BeholderBeast
What determines how fast the pointer deletes unvisited links?

@LouisLibre
This 'informative reel' format in Twitter is goated

@harshal83
Nicely explained 🫡 Well, the algorithm's name comes from its "sifting" mechanism, which filters out unpopular objects over time while retaining popular ones, functioning like a metaphorical sieve through cached objects. 🕺🏼
