this post was submitted on 22 Aug 2026
9 points (100.0% liked)

Linux

67399 readers
942 users here now

From Wikipedia, the free encyclopedia

Linux is a family of open source Unix-like operating systems based on the Linux kernel, an operating system kernel first released on September 17, 1991 by Linus Torvalds. Linux is typically packaged in a Linux distribution (or distro for short).

Distributions include the Linux kernel and supporting system software and libraries, many of which are provided by the GNU Project. Many Linux distributions use the word "Linux" in their name, but the Free Software Foundation uses the name GNU/Linux to emphasize the importance of GNU software, causing some controversy.

Rules

Related Communities

Community icon by Alpár-Etele Méder, licensed under CC BY 3.0

founded 7 years ago
MODERATORS
 

I can't seem to find anything like it, neither as a Fuse fs. Is there really no file system, that just evicts the oldest entries once it's full? I mean, it could be a simple queue.

This would have been the ideal tool for cache; no bothering with size limits and background daemons.

you are viewing a single comment's thread
view the rest of the comments
[–] MajorasMaskForever@lemmy.world 5 points 1 week ago (1 children)

You probably can't find it because you're mixing mutually exclusive terminology.

A stack is a First-In Last-Out data structure. If your entry criteria is time, the oldest files will persist and the newer ones will get purged first.

If you want to remove oldest files first, you want a First In First Out queue.

Both of these will permanently delete the original file.

Caches are just a copy of real data, sitting somewhere that ideally has faster access times but smaller storage space. The real original file does not get modified. A cache will typically hold onto as much data as it can until it hits some cap, at which point a replacement algorithm is used to select which entry or entries to make space for the newly requested item. Very rarely will a cache delete entries on its own to minimize actively used space, but if they do they will likely just run the replacement algorithm without backfilling the space

[–] MonkderVierte@lemmy.zip 2 points 1 week ago

Right, yeah, queue, not stack, thanks.

About the last sentence, that's literally the freedesktop definition that cache can get deleted at any time. Important runtime data is state data.

A queue is imho ideal, because only the oldest cache no process cares anymore, gets purged.