21 lines
3.0 KiB
HTML
21 lines
3.0 KiB
HTML
|
<?xml version="1.0" encoding="ISO-8859-1" standalone="no"?>
|
|||
|
|
<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Moore's Law</title><link rel="stylesheet" href="../../jargon.css" type="text/css"/><meta name="generator" content="DocBook XSL Stylesheets V1.61.0"/><link rel="home" href="../index.html" title="The Jargon File"/><link rel="up" href="../M.html" title="M"/><link rel="previous" href="Moof.html" title="Moof"/><link rel="next" href="moria.html" title="moria"/></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Moore's Law</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="Moof.html">Prev</a><EFBFBD></td><th width="60%" align="center">M</th><td width="20%" align="right"><EFBFBD><a accesskey="n" href="moria.html">Next</a></td></tr></table><hr/></div><dt><a id="Moores-Law"/><dt xmlns="" id="Moores-Law"><b>Moore's Law</b>: <span xmlns="http://www.w3.org/1999/xhtml" class="pronunciation">/morz law/</span>, <span xmlns="http://www.w3.org/1999/xhtml" class="grammar">prov.</span></dt></dt><dd><p>Any one of several similar folk theorems that fit computing capacity
|
|||
|
|
or cost to a 2<sup>t</sup> exponential curve, with doubling
|
|||
|
|
time close to a year. The most common fits component density to such a
|
|||
|
|
curve (previous versions of this entry gave that form). Another variant
|
|||
|
|
asserts that the dollar cost of constant computing power decreases on the
|
|||
|
|
same curve. The original Moore's Law, first uttered in 1965 by
|
|||
|
|
semiconductor engineer Gordon Moore (who co-founded Intel four years
|
|||
|
|
later), spoke of the number of components on the lowest-cost silicon
|
|||
|
|
integrated circuits — but Moore's own formulation varied somewhat
|
|||
|
|
over the years, and reconstructing the meaning of the terminology he used
|
|||
|
|
in the original turns out to be fraught with difficulties. Further
|
|||
|
|
variants were spawned by Intel's PR department and various
|
|||
|
|
journalists.</p><p>It has been <a href="http://firstmonday.org/issues/issue7_11/tuomi/index.html" target="_top">shown</a>
|
|||
|
|
that none of the variants of Moore's Law actually fit the data very well
|
|||
|
|
(the price curves within DRAM generations perhaps come closest).
|
|||
|
|
Nevertheless, Moore's Law is constantly invoked to set up expectations
|
|||
|
|
about the next generation of computing technology. See also
|
|||
|
|
<a href="../P/Parkinsons-Law-of-Data.html"><i class="glossterm">Parkinson's Law of Data</i></a> and <a href="../G/Gatess-Law.html"><i class="glossterm">Gates's
|
|||
|
|
Law</i></a>.</p></dd><div class="navfooter"><hr/><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="Moof.html">Prev</a><EFBFBD></td><td width="20%" align="center"><a accesskey="u" href="../M.html">Up</a></td><td width="40%" align="right"><EFBFBD><a accesskey="n" href="moria.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Moof<EFBFBD></td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"><EFBFBD>moria</td></tr></table></div></body></html>
|