Comparison of instruction set architectures: Difference between revisions

Revision as of 15:23, 13 June 2025

Revision as of 19:41, 3 July 2025

Line 1:

{{Short description|none}} <!-- This short description is INTENTIONALLY "none" - please see WP:SDNONE before you consider changing it! -->

An '''[[instruction set architecture]]''' ('''ISA''') is an abstract model of a [[computer]], also referred to as '''computer architecture'''. A realization of an ISA is called an ''implementation''. An ISA permits multiple implementations that may vary in [[Computer performance|performance]], physical size, and monetary cost (among other things); because the ISA serves as the [[Interface (computing)|interface]] between [[software]] and [[Computer hardware|hardware]]., Softwaresoftware that has been written for an ISA can run on different implementations of the same ISA. This has enabled [[binary compatibility]] between different generations of computers to be easily achieved, and the development of computer families. Both of these developments have helped to lower the cost of computers and to increase their applicability. For these reasons, the ISA is one of the most important abstractions in [[computing]] today.

An ISA defines everything a [[machine language]] [[programmer]] needs to know in order to program a computer. What an ISA defines differs between ISAs; in general, ISAs define the supported [[data type]]s, what state there is (such as the [[main memory]] and [[Processor register|register]]s) and their semantics (such as the [[memory consistency]] and [[addressing mode]]s), the ''instruction set'' (the set of [[machine instruction]]s that comprises a computer's machine language), and the [[input/output]] model.