Agree on timing without knowing the world’s time

Cross-Domain EchoesShared pattern · Synchronization

Picture and sound recorded on separate devices can be aligned using a shared visible and audible event. The editor needs the tracks to agree with each other, even if neither device recorded the correct wall-clock time. A group of computers using the Berkeley algorithm also seeks internal agreement: a leader compares their clocks and sends adjustments toward a group time. Both distinguish relative alignment from absolute accuracy. Their corrections differ, however. Film editing can shift recorded tracks after capture; the clock algorithm adjusts running clocks and must handle message delay, drift and failures. A single alignment event does not make either system immune to later drift.

Written comparison

Independent timing

Film production

Camera and audio recorder

Distributed computing

Participant computer clocks

Separate clocks can disagree even when their processes belong to the same coordinated activity.

A basis for comparison

Film production

A common sync event or reference

Distributed computing

A delay-adjusted group estimate

Alignment needs a declared reference relation. A physical shared event and a computed average are different ways to obtain one.

An alignment operation

Film production

Offset correction in editing

Distributed computing

Adjustments to running clocks

The correction targets mutual timing agreement, not necessarily a true external time standard.

What carries across

Ask whether a task needs agreement between participants or accuracy against an external clock; they are different promises.

Where the comparison stops

Post-production aligns saved recordings. Berkeley synchronizes active clocks under network uncertainty. An offset between tracks is not the same thing as a clock-control policy.

• A single sync event identifies an offset but does not by itself remove drift over a long recording.
• Berkeley’s group average does not guarantee absolute UTC accuracy; message asymmetry and leader failure still matter.
• No clock-error bound, polling interval or editing procedure transfers automatically between the cases.

Conditions for this comparison

• The picture and sound belong to the same identified take, with frame/sample conventions and drift checks.
• The computer system specifies delay estimation, outlier handling and a safe clock-adjustment policy.

Source entries

Shared pattern

Synchronization

Prime

Core Idea

the alignment of timing across multiple oscillating, repeating, or sequenced processes such that key events co-occur or maintain stable phase relationships.

Film production

Double-system recording

Domain-specific abstraction

Core Idea

Double-system recording separates optimal camera and audio capture while creating a synchronization obligation handled by slates, timecode, clock discipline, metadata, and editorial alignment. Camera and recorder capture concurrently to independent media; a common visual-acoustic event or time reference establishes offset, take identifiers link files, and post-production aligns and verifies the tracks. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

What It Is Not

- It is not the neighboring catalog concept Single-system recording. Single-system recording embeds synchronized sound with picture at capture; double-system recording uses independent devices and must reconcile their clocks and media later.

Distributed computing

Berkeley algorithm

Domain-specific abstraction

Core Idea

It supplies internal agreement rather than absolute UTC accuracy, leader failure and network asymmetry require handling and clocks should be slewed or adjusted under monotonicity constraints. The leader polls followers, corrects reported times for message delay, computes a robust group average and sends each node an offset rather than a timestamp so the group converges without a trusted reference clock. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

What It Is Not

- It is not the neighboring catalog concept Cristian’s algorithm. Cristian synchronizes clients to an externally accurate server; Berkeley averages peer clocks when no node is assumed to know absolute time.