{
  "slug": "page-validity-bitmap",
  "term": "Page validity bitmap",
  "aliases": [
    "PVB",
    "page liveness bitmap"
  ],
  "definition": "A page validity bitmap is per-physical-page FTL metadata used to identify data that must be retained when reclaiming a flash block.",
  "note": "Validity concerns whether stored data remains logically current, not whether its bytes pass a checksum. An overwritten page can become invalid without being erased. Address translation locates a logical page; validity tracking helps garbage collection decide which physical pages still need preservation. [gecko2016]\n\nBit meaning: In the Gecko papers, 1 marks an invalid page. Erasing a block clears its bits because its pages become free, not because they contain live data. A zero bit alone is therefore not proof of a programmed, current page. Interpret the bitmap with its allocation state and update rules. [gecko2016]\n\nDelayed updates: In the 2015 Lazy Gecko design, an overwrite may not know the previous physical address when its mapping is absent from cache. Translation-page reads resolve delayed invalidations; reverse-map and cached-state checks reconcile remaining obsolete pages before migration. Lazy Gecko is the paper's garbage collector, not LazyFTL. [gecko2015]\n\nA flat one-bit-per-page bitmap needs ceil(N/8) payload bytes for N physical pages, before alignment or indexing overhead. N counts represented physical pages, including provisioned spare space, rather than only host-visible logical addresses. Logarithmic Gecko instead buffers invalidations and stores merged summaries in flash. [gecko2016]\n\nSizing example: With 4 KiB pages, 1 TiB of represented physical space needs 32 MiB. Covering 1.25 TiB instead needs 40 MiB. For 1 TiB host-visible capacity, this is 25% additional physical space and an 8 MiB underestimate if sized from logical capacity alone. These are bitmap payloads, not total controller RAM. [sizing-code]",
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "A validity summary alone does not identify the logical owner of each physical page or establish crash-recovery ordering.",
      "citationIds": [
        "gecko2016",
        "gecko2015"
      ]
    }
  ],
  "related": [
    "geckoftl",
    "mapping-cache",
    "garbage-collection",
    "reverse-mapping-ftl",
    "nand-erase-block",
    "ftl"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-17",
  "citations": [
    {
      "id": "gecko2016",
      "title": "Dayan, Bonnet and Idreos. GeckoFTL. SIGMOD 2016, sections 2-3.1; DOI 10.1145/2882903.2915219.",
      "url": "https://stratos.seas.harvard.edu/sites/g/files/omnuum4611/files/stratos/files/geckoftl.pdf",
      "accessed": "2026-11-17"
    },
    {
      "id": "gecko2015",
      "title": "Dayan and Bonnet. Garbage Collection Techniques for Flash-Resident Page-Mapping FTLs. arXiv:1504.01666v1, sections 3.1 and 5.",
      "url": "https://arxiv.org/html/1504.01666v1",
      "accessed": "2026-11-17"
    },
    {
      "id": "mapping-guide",
      "title": "Hesela: SSD mapping caches, memory roles and recovery contracts.",
      "url": "https://hesela.com/analyses/ssd-mapping-cache-hmb/",
      "accessed": "2026-11-17"
    },
    {
      "id": "sizing-code",
      "title": "Hesela: exact physical-page bitmap sizing examples (JavaScript).",
      "url": "https://hesela.dev/research/page-validity-sizing.mjs",
      "accessed": "2026-11-17"
    }
  ],
  "provenance": [
    "The worked designs are research systems; status does not classify every commercial controller. No device measurements or implementation replication are supplied.",
    "Bit polarity follows the named Gecko designs, not a universal bitmap format. The 2015 precursor and the 2016 paper are distinct sources.",
    "The 2015 section 5.2.4 live-page Hamming-weight sentence conflicts with its section 5.1 definition and Algorithm 1 (1 means invalid); that count sentence is not used.",
    "Sizing examples are hypothetical exact arithmetic, not measurements of an SSD. The public script uses integer page counts and rounds partial bytes upward."
  ]
}
