Distributed Systems

Tanenbaum, A. S., & van Steen, M. (2007). Distributed Systems: Principles and Paradigms. Pearson.

Type

Book

Intellectual base

Textbook

Year

2007

Link

https://www.distributed-systems.net/index.php/books/ds3/

Cited from

computer_science, logistics_supply_chain, mathematics

Cited by

6 citations across 6 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Bottleneck

  • This sourceBiblio reference (never cited in body).

• Concurrency
  • The clarifying force is to make coordination requirements checkable and to turn implicit temporal assumptions into explicit guards

    This sourceCanonical distributed-systems text covering synchronization, coordination, consistency, and replication. SUPPORTS marker 052 (clarity: turning implicit temporal assumptions into explicit guards) and marker 054 (independent agents overlapping in time without corrupting each other's work). DOI/link is the archive.org copy. NOTE: the embedded annotation in the source ('load balancing as distributing divisible work ... distribution vs provisioning') is a mismatched carry-over from another prime's use of this text; the book nonetheless supports the general coordination/clarity claims on 052/054.

• Idempotence
  • .

    This sourceChapters on messaging and at-least-once delivery establish idempotency in message-passing protocols.

• Load Balancing
  • Its essence is spreading demand over parallel resources according to a routing rule, exploiting the fact that aggregate capacity is only useful if demand can be steered toward wherever spare capacity currently exists.

    This sourceCanonical distributed-systems textbook: develops load balancing as distributing divisible work across a pool of interchangeable units behind one logical endpoint, treating the pool as a single elastic resource and distinguishing distribution (shape of the load) from provisioning (its mean).

• Scalability
  • The architectural strategies that transform the bottleneck: replication, partitioning (sharding), caching, asynchronous processing, load balancing, or workflow restructuring

    This sourceCanonical distributed-systems textbook: develops load balancing as distributing divisible work across a pool of interchangeable units behind one logical endpoint, treating the pool as a single elastic resource and distinguishing distribution (shape of the load) from provisioning (its mean).

Domain-specific

• Bully algorithm
  • … transfers from A canonical instance directly demonstrates that under the synchronous timing and reliable-communication assumptions the highest nonfailed process is eventually uniquely announced coordinator. to An applied instance preserves the same invariant under changed scale, notation, or implementation..

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. Neither this nor any other of the 6 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://archive.org/details/distributedsyste0000tane_i6v1 ×1

Registry ID ref:5ff94f87dd3f · see in the full table