EDSAC
kW | |
Backward compatibility | None |
---|---|
Successor | EDSAC 2 and LEO I |
Related | EDVAC |
The Electronic Delay Storage Automatic Calculator (EDSAC) was an early British computer.
Later the project was supported by J. Lyons & Co. Ltd., intending to develop a commercially applied computer and succeeding in Lyons' development of LEO I, based on the EDSAC design. Work on EDSAC started during 1947,[3] and it ran its first programs on 6 May 1949, when it calculated a table of square numbers[4] and a list of prime numbers.[5][6] EDSAC was finally shut down on 11 July 1958, having been superseded by EDSAC 2, which remained in use until 1965.[7]
Technical overview
Physical components
As soon as EDSAC was operational, it began serving the university's research needs. It used
Initially registers were limited to an
A magnetic-tape drive was added in 1952 but never worked sufficiently well to be of real use.[10]
Until 1952, the available main memory (instructions and data) was only 512 18-bit words, and there was no backing store.[11] The delay lines (or "tanks") were arranged in two batteries providing 512 words each. The second battery came into operation in 1952.[10]
The full 1024-word delay-line store was not available until 1955 or early 1956,[12] limiting programs to about 800 words until then.
John Lindley (diploma student 1958–1959) mentioned "the incredible difficulty we had ever to produce a single correct piece of paper tape with the crude and unreliable home-made punching, printing and verifying gear available in the late 50s".[13]
Memory and instructions
The EDSAC's main memory consisted of 1024 locations, though only 512 locations were initially installed. Each contained 18 bits, but the topmost bit was always unavailable due to timing problems, so only 17 bits were used. An instruction consisted of a 5-bit instruction code, 1 spare bit, a 10-bit operand (usually a memory address), and 1 length bit to control whether the instruction used a 17-bit or a 35-bit operand (two consecutive words, little-endian). All instruction codes were by design represented by one mnemonic letter, so that the Add instruction, for example, used the EDSAC character code for the letter A.
Internally, the EDSAC used two's complement binary numbers. Numbers were either 17 bits (one word) or 35 bits (two words) long. Unusually, the multiplier was designed to treat numbers as fixed-point fractions in the range −1 ≤ x < 1, i.e. 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-and-add
- AND-and-add (called "Collate")
- Shift left
- Arithmetic shift right
- Load multiplier register
- Store (and optionally clear) accumulator
- Conditional goto
- Read input tape
- Print character
- Round accumulator
- No-op
- Stop
There was no division instruction (but various division subroutines were supplied) 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). There was no unconditional jump instruction, nor was there a procedure call instruction – it had not yet been invented.
System software
The initial orders were hard-wired on a set of
The first calculation done by EDSAC was a square-number program run on 6 May 1949.[16] The program was written by Beatrice Worsley, who had travelled from Canada to study the machine.[17][16]
The machine was used by other members of the university to solve real problems, and many early techniques were developed that are now included in operating systems.
Users prepared their programs by punching them (in assembler) onto a paper tape. They soon became good at being able to hold the paper tape up to the light and read back the codes. When a program was ready, it was hung on a length of line strung up near the paper-tape reader. The machine operators, who were present during the day, selected the next tape from the line and loaded it into EDSAC. This is of course well known today as job queues. If it printed something, then the tape and the printout were returned to the user, otherwise they were informed at which memory location it had stopped. Debuggers were some time away, but a cathode-ray tube screen could be set to display the contents of a particular piece of memory. This was used to see whether a number was converging, for example. A loudspeaker was connected to the accumulator's sign bit; experienced users knew healthy and unhealthy sounds of programs, particularly programs "hung" in a loop.
After office hours certain "authorised users" were allowed to run the machine for themselves, which went on late into the night until a valve blew – which usually happened according to one such user.[18] This is alluded to by Fred Hoyle in his novel The Black Cloud
Programming technique
The early programmers had to make use of techniques frowned upon today—in particular, the use of self-modifying code. As there was no index register until much later, the only way of accessing an array was to alter which memory location a particular instruction was referencing.
David Wheeler, who earned the world's first Computer Science PhD working on the project, is credited with inventing the concept of a subroutine. Users wrote programs that called a routine by jumping to the start of the subroutine with the return address (i.e. the location-plus-one of the jump itself) in the accumulator (a Wheeler Jump). By convention the subroutine expected this, and the first thing it did was to modify its concluding jump instruction to that return address. Multiple and nested subroutines could be called so long as the user knew the length of each one in order to calculate the location to jump to; recursive calls were forbidden. The user then copied the code for the subroutine from a master tape onto their own tape following the end of their own program. (However, Alan Turing discussed subroutines in a paper of 1945 on design proposals for the NPL ACE, going so far as to invent the concept of a return-address stack, which would have allowed recursion.[20])
The lack of an index register also posed a problem to the writer of a subroutine in that they could not know in advance where in memory the subroutine would be loaded, and therefore they could not know how to address any regions of the code that were used for storage of data (so-called "pseudo-orders"). This was solved by use of an initial input routine, which was responsible for loading subroutines from punched tape into memory. On loading a subroutine, it would note the start location and increment internal memory references as required. Thus, as Wilkes wrote, "the code used to represent orders outside the machine differs from that used inside, the differences being dictated by the different requirements of the programmer on the one hand, and of the control circuits of the machine on the other".[21]
EDSAC's programmers used special techniques to make best use of the limited available memory. For example, at the point of loading a subroutine from punched tape into memory, it might happen that a particular constant would have to be calculated, a constant that would not subsequently need recalculation. In this situation, the constant would be calculated in an "interlude". The code required to calculate the constant would be supplied along with the full subroutine. After the initial input routine had loaded the calculation-code, it would transfer control to this code. Once the constant had been calculated and written into memory, control would return to the initial input routine, which would continue to write the remainder of the subroutine into memory, but first adjusting its starting point so as to overwrite the code that had calculated the constant. This allowed quite complicated adjustments to be made to a general-purpose subroutine without making its final footprint in memory any larger than had it been tailored to a specific circumstance.[22]
Application software
The subroutine concept led to 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 until loops, while loops and for loops); vectors; and matrices.
The first assembly language appeared for the EDSAC, and inspired several other assembly languages:
Year | Name | Chief developer, company |
---|---|---|
1951 | Regional Assembly Language | Maurice Wilkes |
1951 | Whirlwind assembler
|
Charles Adams and Jack Gilmore at MIT |
1951 | Rochester assembler | Nat Rochester |
Applications of EDSAC
EDSAC was designed specifically to form part of the Mathematical Laboratory's support service for calculation.
The winners of three Nobel Prizes – John Kendrew and Max Perutz (Chemistry, 1962), Andrew Huxley (Medicine, 1963) and Martin Ryle (Physics, 1974) – benefitted from EDSAC's revolutionary computing power. In their acceptance prize speeches, each acknowledged the role that EDSAC had played in their research.
In the early 1960s Peter Swinnerton-Dyer used the EDSAC computer to calculate the number of points modulo p (denoted by Np) for a large number of primes p on elliptic curves whose rank was known. Based on these numerical results, Birch & Swinnerton-Dyer (1965) conjectured that Np for a curve E with rank r obeys an asymptotic law, the Birch and Swinnerton-Dyer conjecture, considered one of the top unsolved problems in mathematics as of 2022.
The "brain" [computer] may one day come down to our level [of the common people] and help with our income-tax and book-keeping calculations. But this is speculation and there is no sign of it so far.
— British newspaper The Star in a June 1949 news article about the EDSAC computer, long before the era of the personal computers.[26]
Games
In 1952,
Another video game was created by Stanley Gill and involved a dot (termed a sheep) approaching a line in which one of two gates could be opened.[29] The Stanley Gill game was controlled via the lightbeam of the EDSAC's paper-tape reader.[29] Interrupting it (such as by the player placing their hand in it) would open the upper gate.[29] Leaving the beam unbroken would result in the lower gate opening.[29]
Further developments
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 David Hartley.
In the mid-1960s, a successor to the EDSAC 2 was planned, but the move was instead made to the
.EDSAC Replica Project
On 13 January 2011, the
See also
- EDVAC on which much of the design of EDSAC was based
- History of computing hardware
- List of vacuum-tube computers
References
- .
- ^ The 1948 Manchester Baby computer predated EDSAC as a stored-program computer, but was built largely as a test bed for the Williams tube and not as a machine for general use. See "A brief informal history of the Computer Laboratory". However, the Baby was developed into a practically useful successor, the Manchester Mark 1 of 1949, which was available for general use by other university departments and Ferranti in April 1949, despite still being under development; EDSAC first ran in May 1949, while also still being under development. "50th Anniversary of the Manchester Baby computer". Archived from the original on 9 February 2014. Retrieved 5 January 2014.
- .
- ^ "Pioneer computer to be rebuilt". Cam. 62: 5. 2011. To be precise, EDSAC's first program printed a list of the squares of the integers from 0 to 99 inclusive.
- ISBN 9783642245411.
- ^ "9. The EDSAC, Cambridge University, England". Digital Computer Newsletter. 2 (1). Other early computational problems run on EDSAC; some specifications of the computer: 3. 1 January 1950. Archived from the original on 11 March 2021.
{{cite journal}}
: CS1 maint: others (link) - ^ EDSAC 99: 15–16 April 1999 (PDF), University of Cambridge Computer Laboratory, 6 May 1999, pp. 68, 69, retrieved 29 June 2013.
- ^ EDSAC Simulator. Computerphile.
- ^ Some EDSAC statistics. University of Cambridge.
- ^ a b Some EDSAC statistics.
- ^ EDSAC 1 and after.
- ^ EDSAC 1 and after.
- ^ EDSAC 1 and after.
- ^ Proceedings of the Cambridge Philosophical Society, Vol. 49, Pt. 1, p. 84–89.
- ^ "Edsac Simulator". www.dcs.warwick.ac.uk. Retrieved 24 May 2023.
- ^ a b "EDSAC performed its first calculations". Computing History. Archived from the original on 26 February 2021. Retrieved 23 November 2018.
- ^ Raymond, Katrine (25 October 2017). "Beatrice Worsley". The Canadian Encyclopedia. Archived from the original on 13 January 2018. Retrieved 23 November 2018.
- ^ Professor David Barron, Emeritus Professor of the University of Southampton at a Cambridge Computer Lab seminar to mark the 60th anniversary 6 May 2009.
- ^ Description of three displays (counter, memory and sequence control): "Two new EDSAC videos: EDSAC's VDU screens". The National Museum of Computing. 11 December 2015.
- ^ Turing 1945, reprinted in Copeland (2005), p. 383.
- ^ Wilkes, M. V. (1956). Automatic digital computers. London: Methuen. pp. 93–95.
- ^ Wilkes, M. V. (1956). Automatic digital computers. London: Methuen. pp. 108–109.
- ^ Goddard, Jonathan (3 May 2019), 70 years since the first computer designed for practical everyday use, Department of Computer Science and Technology, University of Cambridge
- ^ Gene Frequencies in a Cline Determined by Selection and Diffusion, R. A. Fisher, Biometrics, Vol. 6, No. 4 (Dec. 1950), pp. 353–361.
- ^ Caldwell – largest known primes by year. One reference gives Miller, J. C. P. "Larger Prime Numbers" (1951) Nature 168(4280):838, but the abstract does not mention it.
- ^ "Archived copy" (PDF). Archived from the original (PDF) on 22 December 2015. Retrieved 18 November 2016.
{{cite web}}
: CS1 maint: archived copy as title (link) - IAC. Archivedfrom the original on 22 December 2015. Retrieved 18 December 2015.
- ISBN 978-0-313-37936-9.
- ^ S2CID 10257358.
- ^ Ward, Mark (13 January 2011). "Pioneering Edsac computer to be built at Bletchley Park". BBC News. Retrieved 13 January 2011.
- ^ Museum switches on historic computer.
- ISBN 978-3-642-41649-1.
- ^ "EDSAC Logic Rebuild Sub-project". www.billp.org. Retrieved 24 August 2023.
- ^ "Inside the project to rebuild the EDSAC, one of the world's first general purpose computers". zdnet.com. Retrieved 24 May 2020.
- ZDNet. Retrieved 1 December 2016.
Further reading
- The Preparation of Programs for an Electronic Digital Computer by Professor Sir Addison–Wesley, Edition 1, 1951 archive.org.
- 50th Anniversary of EDSAC – Dedicated website at the University of Cambridge Computer Laboratory.
- S2CID 122531425.
- Wilkes, M. V.; Renwick, W. (1950). "The EDSAC (Electronic delay storage automatic calculator)". Mathematics of Computation. 4 (30): 61–65. ISSN 0025-5718.
- ISBN 0-19-856593-3
- Turing, Alan M. (1945), Report by Dr. A. M. Turing on proposals for the development of an Automatic Computing Engine (ACE): Submitted to the Executive Committee of the NPL in February 1946 reprinted in Copeland 2005, pp. 369–454
- The EDSAC Rebuild Project - Documentation, and the reconstructed EDSAC schematics
External links
- An EDSAC simulator – Developed by Martin Campbell-Kelly, Department of Computer Science, University of Warwick, England.
- Oral history interview with David Wheeler, 14 May 1987. Charles Babbage Institute, University of Minnesota. Wheeler was a research student at the University Mathematical Laboratory at Cambridge in 1948–1951 and a pioneer programmer on the EDSAC project. Wheeler discusses projects that were run on EDSAC, user-oriented programming methods, and the influence of EDSAC on the ILLIAC, the ORDVAC, and the IBM 701. Wheeler also notes visits by Douglas Hartree, Nelson Blackman (of ONR), Peter Naur, Aad van Wijngarden, Arthur van der Poel, Friedrich Bauer, and Louis Couffignal.
- Nicholas Enticknap and Maurice Wilkes, Cambridge's Golden Jubilee – in: RESURRECTION The Bulletin of the Computer Conservation Society. ISSN 0958-7403. Number 22, Summer 1999.
- The EDSAC Paperwork Collection at The ICL Computer Museum.
- Introduction to programming for EDSAC 2, 1957.