跳过导航
This simple algorithm from Carnegie Mellon is taking the world by storm.
0:00 / 1:09

This simple algorithm from Carnegie Mellon is taking the world by storm.

Gaurav Sen

@gkcs_7.3万 位关注者

在 X 上查看
1,187 个赞下载原帖

50,761 次观看 #SystemDesign #Caching

This simple algorithm from Carnegie Mellon is taking the world by storm. SIEVE is a caching algorithm worth noting. #SystemDesign #Caching

11 条评论

评论来自 X (Twitter) 上的原帖

  • ramesh dhanraj 的头像

    @rameshdhan45955

    Ive seen what youve done there 🤣, great explanation though.

    4 个赞

  • Gaurav Sen 的头像

    @gkcs_

    Ek akela 😛

    2 个赞

  • SecBriefs | Making Cybersecurity Simple 的头像

    @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 个赞

  • Akiii 的头像

    @Aki0x137

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

    4 个赞

  • Ashish Singh 的头像

    @AshishSingh5186

    Fantastic Bhai Watching you for last 2 years

    1 个赞

  • Anton Ansalmar 的头像

    @antona23

    Thanks for sharing Gaurav

    1 个赞

  • Gaurav Sen 的头像

    @gkcs_

    Cheers!

  • aman kharbas 的头像

    @aman_kharbas

    This is gold, and that was funny 😅

    1 个赞

  • Anonykun 的头像

    @BeholderBeast

    What determines how fast the pointer deletes unvisited links?

  • Louis Libre ⚡️ 的头像

    @LouisLibre

    This 'informative reel' format in Twitter is goated

  • Harshal Mahajan 的头像

    @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. 🕺🏼