{
  "slug": "sievestore",
  "term": "SieveStore",
  "aliases": [
    "SieveStore-D",
    "SieveStore-C"
  ],
  "definition": "SieveStore is a shared block-cache design that filters admissions to reduce cache-fill writes while retaining frequently accessed blocks.",
  "note": "SieveStore-D selects blocks from access logs at epoch boundaries. SieveStore-C admits blocks after repeated misses, using an imprecise first-stage counter table followed by precise per-block tracking. The latter prevents hash collisions alone from qualifying low-reuse blocks. [paper]\n\nA read miss can cause a write when its fetched block enters an SSD cache. Choosing an eviction victim does not eliminate that admission write. Cache-fill writes and internal NAND copying are separate accounting layers. [paper] [accounting]\n\nThe 2010 SieveStore design is distinct from the 2024 SIEVE eviction algorithm. [paper] [sieve]",
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "The evaluation used a week of block traces from 13 servers. Its minute-level drive-demand model ignores queueing and does not establish request tail latency.",
      "citationIds": [
        "paper"
      ]
    }
  ],
  "related": [
    "cache-admission",
    "cache-pollution",
    "sieve-eviction",
    "write-amplification",
    "lru-replacement"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "citations": [
    {
      "id": "paper",
      "title": "Pritchett and Thottethodi. SieveStore. ISCA 2010, pp. 163-174, sections 3-5 and Table 2. DOI: 10.1145/1815961.1815982.",
      "url": "https://engineering.purdue.edu/~mithuna/pubs/isca10.pdf",
      "accessed": "2026-11-21"
    },
    {
      "id": "sieve",
      "title": "Zhang et al. SIEVE is Simpler than LRU. NSDI 2024, pp. 1229-1246.",
      "url": "https://www.usenix.org/conference/nsdi24/presentation/zhang-yazhuo",
      "accessed": "2026-11-21"
    },
    {
      "id": "accounting",
      "title": "Hesela: SieveStore allocation-write accounting and the total-versus-increment denominator.",
      "url": "https://hesela.com/analyses/ssd-overprovisioning-denominators/#sievestore-allocation",
      "accessed": "2026-11-21"
    }
  ],
  "provenance": [
    "Full ISCA 2010 paper reviewed, including the accounting table and evaluation assumptions. The linked code reconstructs Table 2 arithmetic, not the trace-driven simulator or an SSD benchmark."
  ],
  "updated": "2026-11-21"
}
