Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Bisynchronous FIFOs and the FITO Category Mistake: Silicon-Proven Interaction Primitives for Distributed Coordination

Paul Borrill

TL;DR

The central claim is that interaction-based synchronization primitives -- handshakes, mutual exclusion, and causal flow control -- can replace timestamp-based coordination at the most demanding levels of digital engineering, directly undermining the FITO assumption in protocols such as PTP, TSN, and conventional Ethernet.

Abstract

Bisynchronous FIFOs -- hardware buffers that mediate data transfer between independent clock domains without a shared global timebase -- have been designed, formally verified, and commercially deployed in silicon for over four decades. We survey this literature from Chapiro's 1984 GALS thesis through Cummings's Gray-code pointer techniques, Chelcea and Nowick's mixed-timing interfaces, Greenstreet's STARI protocol, and the 2015 NVIDIA pausible bisynchronous FIFO, and argue that this body of work constitutes a silicon-proven existence proof against the Forward-In-Time-Only (FITO) assumption that pervades distributed systems. The central claim is that interaction-based synchronization primitives -- handshakes, mutual exclusion, and causal flow control -- can replace timestamp-based coordination at the most demanding levels of digital engineering, directly undermining the FITO assumption in protocols such as PTP, TSN, and conventional Ethernet. We draw a structural parallel between on-chip bisynchronous coordination and the Open Atomic Ethernet (OAE) architecture, and identify the handshake -- not the timestamp -- as the fundamental primitive for coordination between independent causal domains.

Bisynchronous FIFOs and the FITO Category Mistake: Silicon-Proven Interaction Primitives for Distributed Coordination

TL;DR

The central claim is that interaction-based synchronization primitives -- handshakes, mutual exclusion, and causal flow control -- can replace timestamp-based coordination at the most demanding levels of digital engineering, directly undermining the FITO assumption in protocols such as PTP, TSN, and conventional Ethernet.

Abstract

Bisynchronous FIFOs -- hardware buffers that mediate data transfer between independent clock domains without a shared global timebase -- have been designed, formally verified, and commercially deployed in silicon for over four decades. We survey this literature from Chapiro's 1984 GALS thesis through Cummings's Gray-code pointer techniques, Chelcea and Nowick's mixed-timing interfaces, Greenstreet's STARI protocol, and the 2015 NVIDIA pausible bisynchronous FIFO, and argue that this body of work constitutes a silicon-proven existence proof against the Forward-In-Time-Only (FITO) assumption that pervades distributed systems. The central claim is that interaction-based synchronization primitives -- handshakes, mutual exclusion, and causal flow control -- can replace timestamp-based coordination at the most demanding levels of digital engineering, directly undermining the FITO assumption in protocols such as PTP, TSN, and conventional Ethernet. We draw a structural parallel between on-chip bisynchronous coordination and the Open Atomic Ethernet (OAE) architecture, and identify the handshake -- not the timestamp -- as the fundamental primitive for coordination between independent causal domains.
Paper Structure (25 sections, 1 figure)

This paper contains 25 sections, 1 figure.

Table of Contents

  1. Introduction: The Synchronization Problem
  2. Historical Development
  3. Precursors: FIFOs Across Timing Boundaries
  4. IEEE P896 Futurebus (1979--1987): Handshake Protocols at the Backplane
  5. Chapiro (1984): The GALS Thesis
  6. Cummings (2001--2008): The Gray-Code Bisynchronous FIFO
  7. Chelcea and Nowick (2001--2004): Mixed-Timing Interfaces
  8. Greenstreet and Chakraborty (1990--2003): STARI and Self-Timed Interfaces
  9. Keller, Fojtik, and Khailany (2015): The NVIDIA Pausible Bisynchronous FIFO
  10. Miro-Panades and Greiner (2007): The Bi-Synchronous FIFO for NoC
  11. Taxonomy of Synchronization Approaches
  12. Significance for the FITO / Category Error Debate
  13. The FITO Assumption in Distributed Systems
  14. Bisynchronous FIFOs as Existence Proof
  15. The Handshake as the Fundamental Primitive
  16. ...and 10 more sections

Figures (1)

  • Figure 1: Fully interlocked handshake protocols, from Borrill's 1986 taxonomy borrill1986futurebus, originally developed for the IEEE P896 Futurebus standard (working group est. 1979; see also borrill1984futurebus). The figure classifies single-source, single-destination, source-and-destination (four-event and two-event variants), and the TRI handshake for multi-party coordination. The rectangular pulse widths represent the wired-OR protocol window: the leading edge marks the moment the fastest module asserts the wire, and the trailing edge marks the moment the slowest module releases it. This is fundamentally different from source-timed protocols, where the transmitter holds a signal for a fixed, technology-dependent interval. The wired-OR handshake is technology-independent by design: because the wire itself reports when all participants have responded, the protocol scales to any backplane length and any future silicon technology without modification. This taxonomy predates by several years the formalizations of four-phase and two-phase handshakes in the asynchronous VLSI literature (Sutherland 1989, Chelcea and Nowick 2001).