Microprogramming: A Program Beneath an Instruction

The problem in the selected paper

Wilkes and Stringer’s introduction connects complicated control circuitry with maintenance difficulty. They propose describing machine operations through elementary micro-operations, with micro-orders held in a rapid-access permanent store. Their example proposes a diode matrix and includes conditional sequencing.

Sources for this section: [1]

Three levels, three different descriptions

Consider an invented machine that can transfer values between a memory, a temporary register and an accumulator. Its programmer-visible instruction is ADD location. The instruction’s meaning is that the value at that location is added to the accumulator. It does not specify a physical wire, clock period or particular register arrangement.

One possible implementation first requests the memory value, waits until it is available, places that value at the arithmetic unit, selects addition and saves the result. Another implementation might combine some actions or use a different temporary register. Both can satisfy the same visible instruction if their observable results agree. This invented sequence is not the circuit sequence printed in the historical paper.

What a control store changes

The historical proposal permits an order code to be changed through the stored control arrangement rather than ad hoc redesign of each instruction’s circuitry. That is a design argument about organization; it is not a promise that every control change is costless or that the arithmetic hardware can perform an unsupported operation.

In the invented machine, suppose a revised control sequence waits for a memory-ready signal before saving a value. The visible ADD instruction need not change. Conversely, renaming ADD as COMBINE in an application does not alter that internal sequence. These are changes at different levels, even if a casual account calls both “reprogramming.”

Sources for this section: [1]

A useful reading test

When a source says a computer is programmable, identify the thing being varied. Is the user choosing a sequence of machine instructions? Is an engineer specifying the internal sequence that implements an instruction? Or is someone changing the physical data path itself? Ask which part stays fixed under each change.

For the invented machine, a control sequence cannot create a second independent adder merely by naming one. It can reuse the existing adder over time. Likewise, a stored control design does not establish the speed, writable-update capability or security properties of a modern processor. The selected paper provides the historical idea, while the example isolates its levels of description.