Orthogonal instruction set

Short description: Type of computer instruction set

In computer engineering, an orthogonal instruction set is an instruction set architecture where all instruction types can use all addressing modes. It is "orthogonal" in the sense that the instruction type and the addressing mode may vary independently. An orthogonal instruction set does not impose a limitation that requires a certain instruction to use a specific register[1] so there is little overlapping of instruction functionality.[2]

Orthogonality was considered a major goal for processor designers in the 1970s, and the VAX-11 is often used as the benchmark for this concept. However, the introduction of RISC design philosophies in the 1980s significantly reversed the trend.

Modern CPUs often simulate orthogonality in a preprocessing step before performing the actual tasks in a RISC-like core. This "simulated orthogonality" in general is a broader concept, encompassing the notions of decoupling and completeness in function libraries, like in the mathematical concept: an orthogonal function set is easy to use as a basis into expanded functions, ensuring that parts don’t affect another if one part is changed.

## Contents

* 1 Basic concepts
* 1.1 Single instruction, single operand
* 1.2 Single instruction, multiple operands
* 1.3 Multiple data
* 2 Orthogonality
* 3 Orthogonality in practice
* 3.1 The PDP-11
* 3.2 The VAX-11
* 3.3 The MC68000 and similar
* 3.4 The 8080 and follow on designs
* 4 RISC
* 5 Notes
* 6 References

## Basic concepts

At their core, all general purpose computers work in the same underlying fashion; data stored in a main memory is read by the central processing unit (CPU) into a fast temporary memory (such as a set of CPU registers), acted on, and then written back to main memory. Memory consists of a collection of data values, encoded as numbers[lower-alpha 1] and referred to by their addresses, each also a numerical value. This means the same operations applied to the data can be applied to the addresses themselves.[lower-alpha 2] While being worked on, data can be temporarily held in processor registers, scratchpad values that can be accessed very quickly. Registers are used, for example, when adding up strings of numbers into a total.[3]

### Single instruction, single operand

In early computers, the instruction set architecture (ISA) often used a single register, in which case it was known as the accumulator. Instructions included an address for the operand. For instance, an `ADD address` instruction would cause the CPU to retrieve the number in memory found at that address and then add it to the value already in the accumulator. This very simple example ISA has a "one-address format" because each instruction includes the address of the data.[4]

One-address machines have the disadvantage that even simple actions like an addition require multiple instructions, each of which takes up scarce memory,[lower-alpha 3] and requires time to be read. Consider the simple task of adding two numbers in memory, 5 and 4. In this case, the program would have to load the value 5 from memory into the accumulator with the `LOAD address` instruction, use the `ADD address` instruction pointing to the 4, and finally `SAVE address` to store the result, 9, back to another memory location.[4]

### Single instruction, multiple operands

Further improvements can be found by providing the address of both of the operands in a single instruction, for instance, `ADD address 1, address 2`. Such "two-address format" ISAs are very common. One can further extend the concept to a "three-address format" where the `SAVE` is also folded into an expanded `ADD address 1, address 2, address of result`.[4]

It is often the case that the basic computer word is much larger than needed to hold just the instruction and an address, and in most systems, there are leftover bits that can be used to hold a constant instead of an address. Instructions can be further improved if they allow any one of the operands to be replaced by a constant. For instance, `ADD address 1, constant 1` eliminates one memory cycle, and `ADD constant 1, constant 2` another.[4]

### Multiple data

Complexity arises when one considers common patterns in which memory is accessed. One very common pattern is that a single operation may be applied across a large amount of similar data. For instance, one might want to add up 1,000 numbers. In a simple two-address format of instructions,[lower-alpha 4] there is no way to change the address, so 1,000 additions have to be written in the machine language. ISAs fix this problem with the concept of indirect addressing, in which the address of the next point of data is not a constant, but itself held in memory or a machine register. This means the programmer can change the address by performing addition on that memory location or register. ISAs also often include the ability to offset an address from an initial location, by adding a value held in one of its registers, in some cases a special index register. Others carry out this addition automatically as part of the instructions that use it.[4]

The variety of addressing modes leads to a profusion of slightly different instructions. Considering a one-address ISA, for even a single instruction, `ADD`, we now have many possible "addressing modes":

* Immediate (constant): `ADD.C constant 1` — adds the constant value to the result in the accumulator
* Direct address: `ADD.A address 1` — add the value stored at address 1
* Memory indirect: `ADD.M address 1` — read the value in address 1, use that value as another address and add that value

Many ISAs also have registers that can be used for addressing as well as math tasks. This can be used in a one-address format if a single address register is used. In this case, a number of new modes become available:

* Register direct: `ADD.R register 1` — add the value stored in the address held in register one
* Displacement: `ADD.D constant 1` — add the constant to the address register, then add the value found in memory at that resulting location
* Index: `ADD.I register 1` — add the value in register 1 to the address register to make a new address and then adds the value at that location to the accumulator
* Autoindex: `ADD.AI register 1` — as in the Index case, but automatically increments the address

## Orthogonality

Orthogonality is the principle that every instruction should be able to use any supported addressing mode. In this example, if the direct addressing version of `ADD` is available, all the others should be as well. The reason for this design is not aesthetic, the goal is to reduce the total size of a program's object code. By providing a variety of addressing modes, the ISA allows the programmer to choose the one that precisely matches the need of their program at that point, and thereby reduce the need to use multiple instructions to achieve the same end. This means the total number of instructions is reduced, both saving memory and improving performance. Orthogonality was often described as being highly "bit efficient".[5]

Keeping the addressing mode specifier bits separate from the opcode operation bits produces an orthogonal instruction set.

As the ultimate end of orthogonal design is simply to allow any instruction to use any type of address, implementing orthogonality is often simply a case of adding more wiring between the parts of the processor. However, it also adds to the complexity of the instruction decoder, the circuitry that reads an instruction from memory at the location pointed to by the program counter and then decides how to process it.[5]

In the example ISA outlined above, the `ADD.C` instruction using direct encoding already has the data it needs to run the instruction and no further processing is needed, the decoder simply sends the value into the arithmetic logic unit (ALU). However, if the `ADD.A` instruction is used, the address has to be read, the value at that memory location read, and then the ALU can continue. This series of events will take much longer to complete and requires more internal steps.[5]

As a result, the time needed to complete different variations of an instruction can vary widely, which adds complexity to the overall CPU design. Therefore, orthogonality represents a tradeoff in design; the computer designer can choose to offer more addressing modes to the programmer to improve code density at the cost of making the CPU itself more complex.[5]

When memory was small and expensive, especially during the era of drum memory or core memory, orthogonality was highly desirable. However, the complexity was often beyond what could be achieved using current technology. For this reason, most machines from the 1960s offered only partial orthogonality, as much as the designers could afford. It was in the 1970s that the introduction of large scale integration significantly reduced the complexity of computer designs and fully orthogonal designs began to emerge. By the 1980s, such designs could be implemented on a single-chip CPU.[5]

In the late 1970s, with the first high-powered fully orthogonal designs emerging, the goal widened to become the high-level language computer architecture, or HLLCA for short. Just as orthogonality was desired to improve the bit density of machine language, HLLCA's goal was to improve the bit density of high-level languages like ALGOL 68. These languages generally used an activation record, a type of complex stack that stored temporary values, which the ISAs generally did not directly support and had to be implemented using many individual instructions from the underlying ISA. Adding support for these structures would allow the program to be translated more directly into the ISA.[5]

## Orthogonality in practice

### The PDP-11

The PDP-11 is substantially orthogonal (primarily excepting its floating point instructions).[6] Most integer instructions operate on either 1-byte or 2-byte values and could access data stored in registers, stored as part of the instruction, stored in memory, or stored in memory and pointed to by addresses in registers or memory. Even the PC and the stack pointer could be affected by the ordinary instructions using all of the ordinary data modes. "Immediate" mode (hardcoded numbers within an instruction, such as `ADD #4, R1` (R1 = R1 + 4) is implemented as the mode "register indirect, autoincrement" and specifying the program counter (R7) as the register to use reference for indirection and to autoincrement. (Encoded as `ADD (PC)+,R1 .word 4.`)[7]

The PDP-11 uses 3-bit fields for addressing modes (0-7) so there are (electronically) eight addressing modes. An additional 3-bit field specifies the registers (R0–R5, SP, PC). Immediate and absolute address operands applying the two autoincrement modes to the program counter (R7), provide a total of ten conceptual addressing modes. Most two-operand instructions support all addressing modes for both parameters.[7]

The PDP-11 is so orthogonal that even nonsense instructions such as move immediate to immediate, `MOV #123,#456`, can be encoded and correctly executed.

### The VAX-11

The VAX-11 extended the PDP-11's orthogonality to all data types, including floating point numbers.[5] Instructions such as 'ADD' were divided into data-size dependent variants such as ADDB, ADDW, ADDL, ADDP, ADDF for add byte, word, longword, packed BCD and single-precision floating point, respectively. Like the PDP-11, the Stack Pointer and Program Counter were in the general register file (R14 and R15).[8]

The general form of a VAX-11 instruction would be:

opcode [ operand ] [ operand ]  ...

Each component being one byte, the opcode a value in the range 0–255, and each operand consisting of two nibbles, the upper 4 bits specifying an addressing mode, and the lower 4 bits (usually) specifying a register number (R0–R15).[8]

In contrast to the PDP-11's 3-bit fields, the VAX-11's 4-bit sub-bytes resulted in 16 addressing modes (0–15). However, addressing modes 0–3 were "short immediate" for immediate data of 6 bits or less (the 2 low-order bits of the addressing mode being the 2 high-order bits of the immediate data, when prepended to the remaining 4 bits in that data-addressing byte). Since addressing modes 0-3 were identical, this made 13 (electronic) addressing modes, but as in the PDP-11, the use of the Stack Pointer (R14) and Program Counter (R15) created a total of over 15 conceptual addressing modes (with the assembler program translating the source code into the actual stack-pointer or program-counter based addressing mode needed).[8]

### The MC68000 and similar

Motorola's designers attempted to make the assembly language orthogonal while the underlying machine language was somewhat less so. Unlike PDP-11, the MC68000 (68k) used separate registers to store data and the addresses of data in memory. The ISA was orthogonal to the extent that addresses could only be used in those registers, but there was no restriction on which of the registers could be used by different instructions. Likewise, the data registers were also orthogonal across instructions. Unlike the PDP-11, the 68000 only supported one general addressing mode for two-parameter instructions. The other parameter was always a register, with the exception of MOV. The MOV instructions supported all addressing modes for both parameters.[9]

In contrast, the NS320xx series were originally designed as single-chip implementations of the VAX-11 ISA. Although this had to change due to legal issues, the resulting system retained much of the VAX-11's overall design philosophy and remained completely orthogonal.[10] This included the elimination of the separate data and address registers found in the 68k.[11]

### The 8080 and follow on designs

The 8-bit Intel 8080 (as well as the 8085 and 8051) microprocessor is basically a slightly extended accumulator-based design and therefore not orthogonal. An assembly-language programmer or compiler writer has to be mindful of which operations were possible on each register: Most 8-bit operations can be performed only on the 8-bit accumulator (the A-register), while 16-bit math can be performed only on the 16-bit pointer/accumulator (the HL-register pair). Simple operations, such as increment, are possible on all 8-bit registers and 16-bit register pairs. This was largely due to a desire to keep all opcodes one byte long.

The binary-compatible Z80 later added opcode prefixes to escape from this 1-byte limit and allow for a more powerful instruction set. The same basic idea was employed for the Intel 8086, although, to allow for more radical extensions, binary-compatibility with the 8080 was not attempted here. It maintained some degree of non-orthogonality for the sake of high code density at the time. The 32-bit extension of this architecture that was introduced with the 80386, is somewhat more orthogonal despite keeping all the 8086 instructions and their extended counterparts. However, the encoding-strategy still shows many traces from the 8008 and 8080 (and Z80). For instance, single-byte encodings remain for certain frequent operations such as push and pop of registers and constants; and the primary accumulator, the EAX register, employs shorter encodings than the other registers on certain types of operations. Observations like this are sometimes exploited for code optimization in both compilers and hand written code.

## RISC

A number of studies through the 1970s demonstrated that the flexibility offered by orthogonal modes was rarely or never used in actual problems. In particular, an effort at IBM studied traces of code running on the System/370 and demonstrated that only a fraction of the available modes were being used in actual programs. Similar studies, often about the VAX, demonstrated the same pattern. In some cases, it was shown that the complexity of the instructions meant they took longer to perform than the sequence of smaller instructions, with the canonical example of this being the VAX's `INDEX` instruction.[12]

During this same period, semiconductor memories were rapidly increasing in size and decreasing in cost. However, they were not improving in speed at the same rate. This meant the time needed to access data from memory was growing in relative terms in comparison to the speed of the CPUs. This argued for the inclusion of more registers, giving the CPU more temporary values to work with. A larger number of registers meant more bits in the computer word would be needed to encode the register number, which suggested that the instructions themselves be reduced in number to free up room.

Finally, a paper by Andrew Tanenbaum demonstrated that 97% of all the constants in a program are between 0 and 10, with 0 representing between 20 and 30% of the total. Additionally, between 30 and 40% of all the values in a program are constants, with simple variables (as opposed to arrays or such) another 35 to 40%.[13] If the processor uses a larger instruction word, like 32-bits, two register numbers and a constant can be encoded in a single instruction as long as the instruction itself does not use too many bits.

These observations led to the abandonment of the orthogonal design as a primary goal of processor design, and the rise of the RISC philosophy in the 1980s. RISC processors generally have only two addressing modes, direct (constant) and register. All of the other modes found in older processors are handled explicitly using load and store instructions moving data to and from the registers. Only a few addressing modes may be available, and these modes may vary depending on whether the instruction refers to data or involves a transfer of control.

## Notes

1. ↑ See digitization.
2. ↑ address are fact simple binary numbers which may be treated as data
3. ↑ Even in modern computers, performance is maximized by keeping data in the cache, a limited resource.
4. ↑ assuming that the address cannot be operated on

## References

1. ↑ Null, Linda; Lobur, Julia (2010). The Essentials of Computer Organization and Architecture. Jones & Bartlett Publishers. pp. 287–288. ISBN 978-1449600068.
2. ↑ Tariq, Jamil (1995), "RISC vs CISC: Why less is more", IEEE Potentials (August/September), https://www.researchgate.net/publication/3227233, retrieved 7 May 2019
3. ↑ "Basic Computer Organization & Design". Computational Sensory-Motor Systems Laboratory. http://etienne.ece.jhu.edu/etienne/teaching/ECE491/current/Lectures/chap5.pdf.
4. ↑ 4.0 4.1 4.2 4.3 4.4 Tullsen, Dean. "Instruction Set Architecture". UCSD. http://cseweb.ucsd.edu/classes/wi05/cse240a/isa.pdf.
5. ↑ 5.0 5.1 5.2 5.3 5.4 5.5 5.6 Hennessy, John; Patterson, David (2002-05-29). Computer Architecture: A Quantitative Approach. Elsevier. p. 151. ISBN 9780080502526. https://books.google.com/books?id=XX69oNsazH4C&pg=PA151.
6. ↑ "Introduction to the PDP-11". http://www.psych.usyd.edu.au/pdp-11/intro.html.
7. ↑ 7.0 7.1 "PDP-11 instruction reference". https://www.teach.cs.toronto.edu//~ajr/258/pdp11.pdf.
8. ↑ 8.0 8.1 8.2 "Another Approach to Instruction Set Architecture—VAX". https://minnie.tuhs.org/CompArch/Resources/webext3.pdf.
9. ↑ Veronis, Andrew (2012-12-06). The 68000 Microprocessor. Springer. p. 54. ISBN 9781468466478. https://books.google.com/books?id=O2DTBwAAQBAJ&pg=PA54.
10. ↑ Tilson, Michael (October 1983). "Moving Unix to New Machines". BYTE: pp. 266. https://archive.org/stream/byte-magazine-1983-10/1983_10_BYTE_08-10_UNIX#page/n267/mode/2up.
11. ↑ "NS32532". http://www.datormuseum.se/home/chips/ns32532.
12. ↑ Patterson, D. A.; Ditzel, D. R. (1980). "The case for the reduced instruction set computer". ACM SIGARCH Computer Architecture News 8 (6): 25–33. doi:10.1145/641914.641917.
13. ↑ Tanenbaum, Andrew (1978). "Implications of structured programming for machine architecture". Communications of the ACM 21 (3): 237–246. doi:10.1145/359361.359454. https://research.vu.nl/en/publications/5d0953e3-569e-4fa3-924a-0e56a80b550b.

* v
* t
* e

Processor technologies

Models|

* Turing machine
* Universal
* Post–Turing
* Quantum
* Belt machine
* Stack machine
* Finite-state machine
* with datapath
* Hierarchical
* Queue automaton
* Register machines
* Counter
* Pointer
* Random-access
* Random-access stored program

Architecture|

* Microarchitecture
* Von Neumann
* Harvard
* modified
* Dataflow
* Transport-triggered
* Cellular
* Endianness
* Memory access
* NUMA
* HUMA
* Load/store
* Register/memory
* Cache hierarchy
* Memory hierarchy
* Virtual memory
* Secondary storage
* Heterogeneous
* Fabric
* Multiprocessing
* Cognitive
* Neuromorphic

Instruction set
architectures|

| Types|

* CISC
* RISC
* Application-specific
* EDGE
* TRIPS
* VLIW
* EPIC
* MISC
* OISC
* NISC
* ZISC
* comparison
* addressing modes

|

* x86
* ARM
* MIPS
* Power ISA
* SPARC
* Itanium
* Unicore
* MicroBlaze
* RISC-V
* others

Execution|

| Instruction pipelining|

* Pipeline stall
* Operand forwarding
* Classic RISC pipeline

|

Hazards|

* Data dependency
* Structural
* Control
* False sharing

Out-of-order|

* Tomasulo algorithm
* Reservation station
* Re-order buffer
* Register renaming

Speculative|

* Branch prediction
* Memory dependence prediction

Parallelism|

| Level|

* Bit
* Bit-serial
* Word
* Instruction
* Pipelining
* Scalar
* Superscalar
* Task
* Thread
* Process
* Data
* Vector
* Memory
* Distributed

|

Multithreading|

* Temporal
* Simultaneous
* Hyperthreading
* Speculative
* Preemptive
* Cooperative

Flynn's taxonomy|

* SISD
* SIMD
* SWAR
* SIMT
* MISD
* MIMD
* SPMD

Processor
performance|

* Transistor count
* Instructions per cycle (IPC)
* Cycles per instruction (CPI)
* Instructions per second (IPS)
* Floating-point operations per second (FLOPS)
* Transactions per second (TPS)
* Synaptic updates per second (SUPS)
* Performance per watt (PPW)
* Cache performance metrics
* Computer performance by orders of magnitude

Types|

* Central processing unit (CPU)
* Graphics processing unit (GPU)
* GPGPU
* Vector
* Barrel
* Stream
* Coprocessor
* ASIC
* FPGA
* CPLD
* Multi-chip module (MCM)
* System in package (SiP)

| By application|

* Microprocessor
* Microcontroller
* Mobile
* Notebook
* Ultra-low-voltage
* ASIP

|

Systems
on chip|

* System on a chip (SoC)
* Multiprocessor (MPSoC)
* Programmable (PSoC)
* Network on a chip (NoC)

Hardware
accelerators|

* AI accelerator
* Vision processing unit (VPU)
* Physics processing unit (PPU)
* Digital signal processor (DSP)
* Tensor processing unit (TPU)
* Secure cryptoprocessor
* Network processor
* Baseband processor

Word size|

* 1-bit
* 2-bit
* 4-bit
* 8-bit
* 16-bit
* 32-bit
* 48-bit
* 64-bit
* 128-bit
* 256-bit
* 512-bit
* others
* variable

Core count|

* Single-core
* Multi-core
* Manycore
* Heterogeneous architecture

Components|

* Core
* Cache
* CPU cache
* replacement policies
* coherence
* Bus
* Clock rate
* Clock signal
* FIFO

| Functional units|

* Arithmetic logic unit (ALU)
* Address generation unit (AGU)
* Floating-point unit (FPU)
* Memory management unit (MMU)
* Load–store unit
* Translation lookaside buffer (TLB)
* Integrated memory controller (IMC)

|

Logic|

* Combinational
* Sequential
* Glue
* Logic gate
* Quantum
* Array

Registers|

* Processor register
* Status register
* Stack register
* Register file
* Memory buffer
* Program counter

Control unit|

* Instruction unit
* Data buffer
* Write buffer
* Microcode ROM
* Counter

Datapath|

* Multiplexer
* Demultiplexer
* Adder
* Multiplier
* CPU
* Binary decoder
* Address decoder
* Sum addressed decoder
* Barrel shifter

Circuitry|

* Integrated circuit
* 3D
* Mixed-signal
* Power management
* Boolean
* Digital
* Analog
* Quantum
* Switch

Power
management|

* PMU
* APM
* ACPI
* Dynamic frequency scaling
* Dynamic voltage scaling
* Clock gating
* Performance per watt (PPW)
* Race to sleep

Related|

* History of general-purpose CPUs
* Microprocessor chronology
* Processor design
* Digital electronics
* Hardware security module
* Semiconductor device fabrication
* Tick–tock model

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Orthogonal instruction set. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Orthogonal_instruction_set&oldid=4229739"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template