Optimum programming

Optimum programming

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

Most early computers used some form of serial memory (primarily delay line memory). Unlike the random access memory of modern computers, words in serial memory are made available one at a time; the time required to access a particular word depends on the "distance" between it and the word currently being read. If a given line held n words, the average time to read a word would be n / 2 word times. Without optimum coding, such a machine would spend most of its time idly waiting for instructions and data.

To circumvent this problem, many machines, particularly the ACE and its descendants, included in their instruction format a field specifying the address of the next instruction to be executed. Employing optimum coding, the programmer could locate an instruction such that it would be available in memory just as the preceding instruction had finished. For example, if a programmer had just coded an ADD instruction at address 400, and the ADD instruction required 4 word-times to execute, the programmer would set the "Next Address" field of the instruction to 404, and would place the next instruction there.

In the United States, optimum coding was most commonly employed on the IBM 650 and the Bendix G-15. Both machines had optimizing assemblers (SOAP for the IBM, POGO for Bendix) that could automate this task.

See also

  • Mel Kaye, who authored one particularity clever bit of optimum programming that has entered computer lore.

External links


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • optimum programming — Computers. See minimum access programming. * * * …   Universalium

  • optimum programming — Computers. See minimum access programming …   Useful english dictionary

  • Optimum Wound Profile — Origin Ipswich, England Genres Industrial metal, hardcore punk[1][2] …   Wikipedia

  • Optimum HDTV viewing distance — is the distance that provides the viewer with the optimum immersive visual HDTV experience. Although opinions vary on the exact screen size to distance relationship, formal research and recommendations suggest closer is preferred to further[not… …   Wikipedia

  • minimum-access programming — /min euh meuhm ak ses/, Computers. a method of programming in which latency is reduced to a minimum. Also called forced coding, minimum latency programming /min euh meuhm layt n see/, optimum programming. * * * …   Universalium

  • minimum-access programming — /min euh meuhm ak ses/, Computers. a method of programming in which latency is reduced to a minimum. Also called forced coding, minimum latency programming /min euh meuhm layt n see/, optimum programming …   Useful english dictionary

  • Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

  • Successive linear programming — SLP Successive Linear ProgrammingLinear programming is a powerful technique for optimisation but the requirement that all constraints be linear can make it difficult to write models that represent the real world closely enough to produce useful… …   Wikipedia

  • The Art of Computer Programming — [ [http://www cs faculty.stanford.edu/ uno/taocp.html The Art of Computer Programming ] ] is a comprehensive monograph written by Donald Knuth that covers many kinds of programming algorithms and their analysis. Knuth began the project, which was …   Wikipedia

  • Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”