Optimum programming (original) (raw)
In the history of computing, optimum programming, or optimum coding 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. 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.
| Property | Value |
|---|---|
| dbo:abstract | In the history of computing, optimum programming, or optimum coding 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 or magnetic drums. 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 delay 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 Alan Turing's ACE and its descendants, included a field specifying the address of the next instruction to be executed in their instruction format. A programmer employing optimum coding would look up the time needed to perform the current instruction, calculate how far the memory system would move in that time, and then place the next instruction for the program at that location. Thus when the current instruction completed and the computer looked for the next one as specified in the instruction, that memory location would just be arriving and would be able to be read in immediately. 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. (en) |
| dbo:wikiPageID | 2876020 (xsd:integer) |
| dbo:wikiPageLength | 2518 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1102734159 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Mel_Kaye dbr:Bendix_G-15 dbc:Software_optimization dbr:Delay-line_memory dbr:The_Story_of_Mel dbr:Alan_Turing dbr:IBM_650 dbr:Random-access_memory dbr:Magnetic_drum dbr:ACE_(computer) |
| dbp:wikiPageUsesTemplate | dbt:Reflist |
| dcterms:subject | dbc:Software_optimization |
| rdfs:comment | In the history of computing, optimum programming, or optimum coding 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. 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. (en) |
| rdfs:label | Optimum programming (en) |
| owl:sameAs | freebase:Optimum programming wikidata:Optimum programming https://global.dbpedia.org/id/4sX6Q |
| prov:wasDerivedFrom | wikipedia-en:Optimum_programming?oldid=1102734159&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Optimum_programming |
| is dbo:wikiPageDisambiguates of | dbr:Optimum_(disambiguation) |
| is dbo:wikiPageWikiLink of | dbr:Optimum_(disambiguation) dbr:English_Electric_DEUCE dbr:Drum_memory dbr:Ferranti_Pegasus dbr:IBM_650 dbr:Metrovick_950 |
| is foaf:primaryTopic of | wikipedia-en:Optimum_programming |