This article explores the limitations of Deterministic PushDown Automaton (DPDA) transitions to ensure determinism.
Continue readingTomasulo’s Algorithm – Example
An example walkthrough of a set of loop instructions undergoing Tomasulo’s algorithm. Each stage of the lifecycle is explained in detail.
Continue readingTomasulo’s Algorithm – Instruction Lifecycle
This article discusses the lifecycle (issue, execute, write, commit) of an instruction following Tomasulo’s Algorithm.
Continue readingClosure Properties of Context-Free Languages
Proofs for closure of Context-Free Languages (CFL) under Union, Concatenation, Star, Reversal, Prefix and Subsequence.
Continue readingTomasulo’s Algorithm – Common Data Bus (CDB)
A short explanation of the role of Common Data Bus.
Continue readingConverting a PushDown Automaton to a Context-Free Grammar
The article discusses, with the help of an example, a step-by-step approach to convert a Pushdown Automaton (PDA) to a Context-Free Grammar (CFG).
Continue readingTomasulo’s Algorithm – Reservation Stations (RS)
This article discusses the concept and structure of Reservation Stations to buffer instructions for Function Units.
Continue readingTomasulo’s Algorithm – Re-Order Buffer (ROB)
This article discusses the use of a Re-Order Buffer (ROB) to allow out-of-order execution but in-order commit.
Continue readingConverting a Context-Free Grammar to a PushDown Automaton
The article discusses, with the help of an example, a step-by-step approach to convert a Context-Free Grammar (CFG) to a Pushdown Automaton (PDA).
Continue readingVirtual Memory – Cache-TLB interaction
The Cache and the TLB serve as an intermediary between the CPU accessing memory. Three different organizations and their pros and cons are discussed.
Continue reading