Jump to content

Optimum programming

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 216.251.209.111 (talk) at 13:36, 10 October 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In the history of computing, optimum programming is the practice of arranging a program's instructions in memory so as to minimize the the time the machine spends waiting for instructions. It is of historical interest mainly, due to the design of many early digital computers.