Minimal instruction set computer (MISC) is a central processing unit (CPU) architecture, usually in the form of a microprocessor, with a very small number of basic operations and corresponding opcodes, together forming an instruction set. Such sets are commonly stack-based rather than register-based to reduce the size of operand specifiers.
Such a stack machine architecture is inherently simpler since all instructions operate on the top-most stack entries. One result of the stack architecture is an overall smaller instruction set, allowing a smaller and faster instruction decode unit with overall faster operation of individual instructions.
This section needs additional citations for verification .(March 2023) |
Separate from the stack definition of a MISC architecture, is the MISC architecture being defined by the number of instructions supported.
Also, the instruction pipelines of MISC as a rule tend to be very simple. Instruction pipelines, branch prediction, out-of-order execution, register renaming, and speculative execution broadly exclude a CPU from being classified as a MISC architecture.[ citation needed ]
This section needs additional citations for verification .(March 2023) |
Some of the first tube-based digital computers implemented with instruction sets are by modern definition minimal instruction set computers. All are serial computers except for Whirlwind.
Probably the most commercially successful MISC was the original Inmos transputer architecture that has no floating-point unit. It has sixteen primary and sixteen secondary instructions.
The Signetics 8X300 is an 8-bit microprocessor introduced in 1976. It has eight instructions.
Each STEREO spacecraft includes two P24 MISC CPUs and two CPU24 soft processors. [5] [6] [7] [8]
The disadvantage of a MISC is that instructions tend to have more sequential dependencies, reducing overall instruction-level parallelism .[ citation needed ]
MISC architectures have much in common with some features of some programming languages such as Forth's use of the stack, and the Java virtual machine. Both are weak in providing full instruction-level parallelism. However, one could employ macro-op fusion as a means of executing common instruction phrases as individual steps (e.g., ADD,FETCH to perform a single indexed memory read).