Difference between revisions of "Little-endian"
From Computer History Wiki
m (better cat) |
m (typo) |
||
| Line 3: | Line 3: | ||
'Little-endian' refers to machines (like the [[Intel x86]]) which number the bits and bytes from the least significant (low-order) end. | 'Little-endian' refers to machines (like the [[Intel x86]]) which number the bits and bytes from the least significant (low-order) end. | ||
| − | Some machines (sometimes dubbed ''mixed-endian'') are not consistent; e.g. the [[PDP-11]], which is mostly little endian - for bits | + | Some machines (sometimes dubbed ''mixed-endian'') are not consistent; e.g. the [[PDP-11]], which is mostly little endian - for bits within bytes/[[word]]s, and bytes within words - but not words within long-words. |
==See also== | ==See also== | ||
Revision as of 14:28, 22 December 2018
Little-endian is a term created by Danny Cohen (technically, he re-purposed it from Jonathan Swift's satire, "Gulliver's Travels", where it refers to the dispute over whether to start eating a boiled egg from the big end or the little end) for the different schemes for ordering and numbering bits and bytes within larger entities.
'Little-endian' refers to machines (like the Intel x86) which number the bits and bytes from the least significant (low-order) end.
Some machines (sometimes dubbed mixed-endian) are not consistent; e.g. the PDP-11, which is mostly little endian - for bits within bytes/words, and bytes within words - but not words within long-words.
