Glossary
| Term | Meaning in Blockflow |
|---|---|
| Block | One work region in a phase’s grid; its image read may extend beyond the output it owns. |
| Core | The output region assigned to a block. Neighboring cores partition the output. |
| Reach | An operation’s declared dependency beyond its output, expressed in a named coordinate space. |
| Halo | Extra region provisioned around a core to satisfy dependencies. Reach is a requirement; halo is what the plan supplies. |
| Read region | The source extent fetched for a block, after applying geometry and boundary constraints. |
| Trustworthy region | Output positions whose declared dependencies are satisfied by the available input. |
| Valid region | The part of a block’s core that is trustworthy. Valid regions must cover the intended output exactly. |
| Operation | An algorithm with declared input, output, dependency and resource contracts. Some algorithms are resident helpers rather than planned operations. |
| Chain | A composition of block operations evaluated within a phase. |
| Phase | A planned stage with its block geometry, work definition and output identity. |
| Task | One block’s work in one phase, ordered by the task dependency graph. |
| Plan | The binding decomposition: phase partition, block grids, read geometry and correctness-visible contracts. |
| Hint | A performance or retention preference that execution can vary without changing the declared image computation. |
| Environment | The storage interface used by the executor, such as arrays or Zarr-backed images. |
| Barrier | A synchronization contract requiring earlier phases to finish before this phase’s work begins. |
| Reduction | A global combination of partial results, often producing small shared state for later block computations. Its state may still grow with the data. |
| Fragment | A per-block byte output, such as encoded rows or partial measurements, with declared coverage and lifetime. |
| Materialisation | Storing an intermediate image or fragment set so later tasks can read it. |
| Fusion | Combining work to avoid a phase boundary or intermediate storage; changing task priority alone does not accomplish it. |
| Scratch | Temporary algorithm workspace beyond its input and output buffers. |
| Slab | A subdivision of a block for intra-block execution where the operation supports safe slicing. |
Start with the data model and halos for the geometric relationship between these terms.
Distinctions that prevent common mistakes
Reach versus halo. A radius-two filter requires two samples on each side. That requirement belongs to the operation. The halo is the margin supplied by the plan to satisfy it. A generous grant may waste work; an insufficient grant cannot be justified by asking the operation how much it received. The halo page explains the named coordinate spaces and axis variants used to express the requirement.
Core versus read region. A core owns output. A read region supplies evidence and can overlap other tasks’ read regions. Overlap does not authorize duplicate commits or duplicate detections. BlockGeometry records image geometry; BlockView exposes the owned core and read/valid regions to a fragment phase.
Block versus chunk. BlockGrid divides computation. A storage chunk is the unit decoded by a source backend. One block can touch many chunks, and one chunk can serve several overlapping block reads. Confusing them can produce a plan with convenient I/O boundaries but poor halo amplification or memory use.
Phase versus task. A phase is one planned stage. A task is one phase/block pair. With three phases over eight spatial blocks, the run can have 24 ordinary tasks even though there are only eight spatial positions. TaskGraph records the dependencies, not merely a list of phase names.
Barrier versus whole-image read. A barrier waits for earlier evidence to be complete. It need not request all image pixels for every block. A whole-axis image dependency requests data, while a barrier requests synchronization. A reduction can still retain too much global state even when its image reads are small.
Plan versus hint. Decomposition records geometry and correctness-visible choices. Hints expresses execution preferences such as concurrency and retention. A preference can be ignored while preserving the computation; a required source window cannot.
Composition versus loop fusion. Chain::sequence can avoid a stored image between kernels inside one phase while retaining local intermediate buffers. It does not automatically generate one machine-code pixel loop. Likewise, SchedulePriority::BlockMajor changes task ranking and does not eliminate phase images. Name the actual optimization when discussing its expected cost.