{
  "slug": "ttflash",
  "term": "TTFLASH",
  "aliases": [
    "Tiny-Tail Flash",
    "ttFlash"
  ],
  "definition": "TTFLASH is a research SSD design that combines fine-grained garbage collection scheduling, parity reconstruction and protected buffering to reduce GC-induced latency.",
  "note": "Plane isolation: copyback leaves other planes available. Parity can reconstruct a read whose target is busy, while rotating collection normally limits each stripe's plane group to one active GC. Collections in different groups can overlap. [slides]\n\nReconstruction is conditional: extra reads contend for channels, so a short remaining GC can be cheaper to wait for. Protected RAM lets writes complete before flash eviction, with GC-tolerant flushing handling busy destinations. [paper]\n\nInterpretation: low GC delay is not a guarantee of low latency from every cause, nor proof of data integrity. Read the scheduling, buffering and error-correction assumptions together.",
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "Heavy write bursts can force multiple collections in one group to prevent free-page exhaustion.",
      "citationIds": [
        "paper"
      ]
    },
    {
      "text": "Copyback bypasses controller ECC; foreground reads retain ECC checking. Background scrubbing was proposed, not evaluated.",
      "citationIds": [
        "paper"
      ]
    }
  ],
  "related": [
    "rain",
    "nand-copyback",
    "dwpd"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-16",
  "citations": [
    {
      "id": "paper",
      "title": "Yan et al. Tiny-Tail Flash: Near-Perfect Elimination of Garbage Collection Tail Latencies in NAND SSDs. FAST 2017, sections 4-7 and Appendix A.",
      "url": "https://files.usenix.org/s3fs-public/cdn/fast17-yan.pdf",
      "accessed": "2026-11-16"
    },
    {
      "id": "slides",
      "title": "Yan et al. Tiny-Tail Flash. FAST 2017 presentation, slides 19-41.",
      "url": "https://files.usenix.org/s3fs-public/conference/protected-files/fast17_slides_yan_0.pdf",
      "accessed": "2026-11-16"
    },
    {
      "id": "record",
      "title": "USENIX FAST 2017 publication record: Tiny-Tail Flash, pp. 15-28.",
      "url": "https://www.usenix.org/conference/fast17/technical-sessions/presentation/yan",
      "accessed": "2026-11-16"
    },
    {
      "id": "hesela",
      "title": "Hesela: NAND copyback, faster relocation is not fewer writes.",
      "url": "https://hesela.com/analyses/nand-copyback-ecc-boundary/",
      "accessed": "2026-11-16"
    }
  ],
  "provenance": [
    "Published evaluation used SSDSim simulation and VSSIM-based emulation, not a completed TTFLASH hardware prototype. [paper]",
    "Source synthesis, not a Hesela benchmark reproduction. The linked DWPD record explains the paper's eight-hour workload convention."
  ]
}
