EDSAC

From Wikipedia, the free encyclopedia

EDSAC
EDSAC

EDSAC (Electronic Delay Storage Automatic Calculator) was an early British computer (one of the first computers to be created). The machine, having been inspired by John von Neumann's seminal EDVAC report, was constructed by Professor Sir Maurice Wilkes and his team at the University of Cambridge Mathematical Laboratory in England.

EDSAC was the world's first practical stored program electronic computer, although not the first stored program computer (that honor goes to the Small-Scale Experimental Machine).

The project was supported by J. Lyons & Co. Ltd., a British firm, who were rewarded with the first commercially applied computer, LEO I, based on the EDSAC design. EDSAC ran its first programs on May 6, 1949, calculating a table of squares[1] and a list of prime numbers.

Contents

As soon as EDSAC was constructed, it began serving the University's research needs. None of its components were experimental. It used mercury delay lines for memory, and derated vacuum tubes for logic. Input was via 5-hole punched tape and output was via a teleprinter.

Initially registers were limited to an accumulator and a multiplier register. In 1953, David Wheeler, returning from a stay at the University of Illinois, designed an index register as an extension to the original EDSAC hardware.

The EDSAC's memory consisted of 1024 locations, though only 512 locations were initially implemented. Each contained 18 bits, but the first bit was unavailable due to timing restrictions, so only 17 bits were used. An instruction consisted of a five-bit instruction code (designed to be represented by a mnemonic letter, so that the Add instruction, for example, used the bit pattern for the letter A), eleven bits for a memory address (although with 1024 words, only 10 bits were needed), and one bit (for certain instruction) to control whether the instruction operated on a number contained in one word or two.

Internally, the EDSAC used twos complement, binary numbers. These were either 17-bit (one word) or 35-bit (two words) long. Unusually, the multiplier was designed to treat numbers as fixed-point fractions in the range -1 ≤ x < 1, ie the binary point was immediately to the right of the sign. The accumulator could hold 71-bits, including the sign, allowing two long (35-bit) numbers to be multiplied without losing any precision.

The instructions available were: add, subtract, multiply, collate[2], shift left, shift right, load multiplier register, store (and optionally clear) accumulator, conditional skip, read input tape, print character, round accumulator, no-op and stop. There was no division instruction (though a number of division subroutines were available) and no way to directly load a number into the accumulator (a "store and zero accumulator" instruction followed by an "add" instruction were necessary for this).

The initial orders were hard-wired on a set of uniselector switches and loaded into the low words of memory at startup. By September 1949, the initial orders had reached their final form and provided a primitive relocating assembler taking advantage of the mnemonic design described above, all in 41 words.

An unusual feature of EDSAC was the availability of a substantial subroutine library. By 1951, 87 subroutines in the following categories were available for general use: floating point arithmetic; arithmetic operations on complex numbers; checking; division; exponentiation; routines relating to functions; differential equations; special functions; power series; logarithms; miscellaneous; print and layout; quadrature; read (input); nth root; Trigonometric functions; counting operations (simulating "repeat", "while" and "for" loops); vectors and matrices.

EDSAC's successor, EDSAC 2, was commissioned in 1958. In 1961 an EDSAC 2 version of Autocode, an ALGOL-like high-level programming language for scientists and engineers, was developed by D. F. Hartley.

In the mid-60s, a successor to the EDSAC 2 was planned, but the move was instead made to the Titan, a prototype Atlas 2—the latter having been developed from the Atlas Computer of the University of Manchester, Ferranti, and Plessey.

  1. ^ To be precise, EDSAC's first program printed a list of the squares of the integers from 0 to 99 inclusive.
  2. ^ This instruction added the bitwise AND of the specified memory word and the multiplier register to the accumulator.

Wikimedia Commons has media related to:
  • An EDSAC simulator – Developed by Martin Campbell-Kelly, Department of Computer Science, University of Warwick , England
  • 50th Anniversary of EDSAC – Dedicated website at the University of Cambridge Computer Laboratory

  • The Preparation of Programs for an Electronic Digital Computer by Professor Sir Maurice Wilkes, David Wheeler and Stanley Gill, Addison-Wesley, Edition 1, 1951
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.