Scoreboarding

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Scoreboarding is a centralized method, first used in the CDC 6600 computer, for dynamically scheduling instructions so that they can execute out of order when there are no conflicts and the hardware is available. In a scoreboard, the data dependencies of every instruction are logged, tracked and strictly observed at all times. Instructions are released only when the scoreboard determines that there are no conflicts with previously issued ("in flight") instructions. If an instruction is stalled because it is unsafe to issue (or there are insufficient resources), the scoreboard monitors the flow of executing instructions until all dependencies have been resolved before the stalled instruction is issued. In essence: reads proceed on the absence of write hazards, and writes proceed in the absence of read hazards. Scoreboarding is essentially a hardware implementation of the same underlying algorithm seen in dataflow languages, creating a directed acyclic graph, where the same logic is applied in the programming language runtime.

Scoreboarding is a centralized method, first used in the CDC 6600 computer, for dynamically scheduling instructions so that they can execute out of order when there are no conflicts and the hardware is available. In a scoreboard, the data dependencies of every instruction are logged, tracked and strictly observed at all times. Instructions are released only when the scoreboard determines that there are no conflicts with previously issued ("in flight") instructions. If an instruction is stalled because it is unsafe to issue (or there are insufficient resources), the scoreboard monitors the flow of executing instructions until all dependencies have been resolved before the stalled instruction is issued. In essence: reads proceed on the absence of write hazards, and writes proceed in the absence of read hazards. Scoreboarding is essentially a hardware implementation of the same underlying algorithm seen in dataflow languages, creating a directed acyclic graph, where the same logic is applied in the programming language runtime. R j [FU] ← Q j [FU]

0; R k [FU] ← Q k [FU]

0; Result[dst] ← FU; function read_operands(FU) wait until (R j [FU] AND R k [FU]); R j [FU] ← No; R k [FU] ← No; function execute(FU) // Execute whatever FU must do function write_back(FU) wait until (∀f {(F j [f]≠F i [FU] OR R j [f]=No) AND (F k [f]≠F i [FU] OR R k [f]=No)}) foreach f do if Q j [f]=FU then R j [f] ← Yes; if Q k [f]=FU then R k [f] ← Yes; Result[F i [FU]] ← 0; // 0 means no FU generates the register's result RegFile[F i [FU]] ← computed value; Busy[FU] ← No;

Text derived from https://en.wikipedia.org/w/index.php?oldid=1370335600 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001370335600 · captured 1787230416.0 · version history

Cite this page as: encyclopegia.org, “Scoreboarding”, snapshot enwiki-001370335600. https://encyclopegia.org/a/scoreboarding

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.