Wikipedia

Manchester Baby

(Redirected from Manchester small-scale experimental machine)

The Manchester Baby, also called the Small-Scale Experimental Machine (SSEM),[1] was the first electronic stored-program computer. It was built at the University of Manchester by Frederic C. Williams, Tom Kilburn, and Geoff Tootill, and ran its first program on 21 June 1948.[2]

Manchester Baby
A series of seven tall metal racks filled with electronic equipment standing in front of a brick wall. Signs above each rack describe the functions carried out by the electronics they contain. Three visitors read from information stands to the left of the image
Replica of the Baby at the Science and Industry Museum in Castlefield, Manchester
Also known asSmall-Scale Experimental Machine
DeveloperFrederic Calland Williams
Tom Kilburn
Geoff Tootill
Product familyManchester computers
Release date21 June 1948; 76 years ago (1948-06-21)
Memory1 kilobit (1,024 bits)
SuccessorManchester Mark 1

The Baby was not intended to be a practical computing engine, but was instead designed as a testbed for the Williams tube, the first truly random-access memory. Described as "small and primitive" 50 years after its creation, it was the first working machine to contain all the elements essential to a modern electronic digital computer.[3] As soon as the Baby had demonstrated the feasibility of its design, a project was initiated at the university to develop it into a full-scale operational machine, the Manchester Mark 1. The Mark 1 in turn quickly became the prototype for the Ferranti Mark 1, the world's first commercially available general-purpose computer.[4][5]

The Baby had a 32-bit word length and a memory of 32 words (1 kilobit, 1,024 bits). As it was designed to be the simplest possible stored-program computer, the only arithmetic operations implemented in hardware were subtraction and negation; other arithmetic operations were implemented in software. The first of three programs written for the machine calculated the highest proper divisor of 218 (262,144), by testing every integer from 218 downwards. This algorithm would take a long time to execute—and so prove the computer's reliability, as division was implemented by repeated subtraction of the divisor. The program consisted of 17 instructions and ran for about 52 minutes before reaching the correct answer of 131,072, after the Baby had performed about 3.5 million operations (for an effective CPU speed of about 1100 instructions per second).[2]

Background

edit
Main article: History of computing hardware
 
Artistic representation of a Turing machine

The first design for a program-controlled computer was Charles Babbage's Analytical Engine in the 1830s, with Ada Lovelace conceiving the idea of the first theoretical program to calculate Bernoulli numbers. A century later, in 1936, mathematician Alan Turing published his description of what became known as a Turing machine, a theoretical concept intended to explore the limits of mechanical computation. Turing was not imagining a physical machine, but a person he called a "computer", who acted according to the instructions provided by a tape on which symbols could be read and written sequentially as the tape moved under a tape head. Turing proved that if an algorithm can be written to solve a mathematical problem, then a Turing machine can execute that algorithm.[6]

Konrad Zuse's Z3 was the world's first working programmable, fully automatic computer, with binary digital arithmetic logic, but it lacked the conditional branching of a Turing machine. On 12 May 1941, the Z3 was successfully presented to an audience of scientists of the Deutsche Versuchsanstalt für Luftfahrt ("German Laboratory for Aviation") in Berlin.[7] The Z3 stored its program on an external tape, but it was electromechanical rather than electronic. The earliest electronic computing devices were the Atanasoff–Berry computer (ABC), which was successfully tested in 1942, and the Colossus of 1943, but neither was a stored-program machine.[8][9]

The ENIAC (1946) was the first automatic computer that was both electronic and general-purpose. It was Turing complete, with conditional branching, and programmable to solve a wide range of problems, but its program was held in the state of switches in patch cords, rather than machine-changeable memory, and it could take several days to reprogram.[3] Researchers such as Turing and Zuse investigated the idea of using the computer's memory to hold the program as well as the data it was working on,[10] and it was mathematician John von Neumann who wrote a widely distributed paper describing that computer architecture, still used in almost all computers.[11]

 
Design of the von Neumann architecture (1947)

The construction of a von Neumann computer depended on the availability of a suitable memory device on which to store the program. During the Second World War researchers working on the problem of removing the clutter from radar signals had developed a form of delay-line memory, the first practical application of which was the mercury delay line,[12] developed by J. Presper Eckert. Radar transmitters send out regular brief pulses of radio energy, the reflections from which are displayed on a CRT screen. As operators are usually interested only in moving targets, it was desirable to filter out any distracting reflections from stationary objects. The filtering was achieved by comparing each received pulse with the previous pulse, and rejecting both if they were identical, leaving a signal containing only the images of any moving objects. To store each received pulse for later comparison it was passed through a transmission line, delaying it by exactly the time between transmitted pulses.[13]

Turing joined the National Physical Laboratory (NPL) in October 1945,[14] by which time scientists within the Ministry of Supply had concluded that Britain needed a National Mathematical Laboratory to co-ordinate machine-aided computation.[15] A Mathematics Division was set up at the NPL, and on 19 February 1946 Turing presented a paper outlining his design for an electronic stored-program computer to be known as the Automatic Computing Engine (ACE).[15] This was one of several projects set up in the years following the Second World War with the aim of constructing a stored-program computer. At about the same time, EDVAC was under development at the University of Pennsylvania's Moore School of Electrical Engineering, and the University of Cambridge Mathematical Laboratory was working on EDSAC.[16]

The NPL did not have the expertise to build a machine like ACE, so they contacted Tommy Flowers at the General Post Office's (GPO) Dollis Hill Research Laboratory. Flowers, the designer of Colossus, the world's first programmable electronic computer, was committed elsewhere and was unable to take part in the project, although his team did build some mercury delay lines for ACE.[15] The Telecommunications Research Establishment (TRE) was also approached for assistance, as was Maurice Wilkes at the University of Cambridge Mathematical Laboratory.[15]

The government department responsible for the NPL decided that, of all the work being carried out by the TRE on its behalf, ACE was to be given the top priority.[15] NPL's decision led to a visit by the superintendent of the TRE's Physics Division on 22 November 1946, accompanied by Frederic C. Williams and A. M. Uttley, also from the TRE.[15] Williams led a TRE development group working on CRT stores for radar applications, as an alternative to delay lines.[17] Williams was not available to work on the ACE because he had already accepted a professorship at the University of Manchester, and most of his circuit technicians were in the process of being transferred to the Department of Atomic Energy.[15] The TRE agreed to second a small number of technicians to work under Williams' direction at the university, and to support another small group working with Uttley at the TRE.[15]

Williams–Kilburn tube

edit
Main article: Williams tube

Although some early computers such as EDSAC, inspired by the design of EDVAC, later made successful use of mercury delay-line memory,[18] the technology had several drawbacks: it was heavy, it was expensive, and it did not allow data to be accessed randomly. In addition, because data was stored as a sequence of acoustic waves propagated through a mercury column, the device's temperature had to be very carefully controlled, as the velocity of sound through a medium varies with its temperature. Williams had seen an experiment at Bell Labs demonstrating the effectiveness of cathode-ray tubes (CRT) as an alternative to the delay line for removing ground echoes from radar signals. While working at the TRE, shortly before he joined the University of Manchester in December 1946, he and Tom Kilburn had developed a form of electronic memory known as the Williams tube or Williams–Kilburn tube, based on a standard CRT: the first electronic random-access digital storage device.[19] The Baby was designed to show that it was a practical storage device by demonstrating that data held within it could be read and written reliably at a speed suitable for use in a computer.[20]

For use in a binary digital computer, the tube had to be capable of storing either one of two states at each of its memory locations, corresponding to the binary digits (bits) 0 and 1. It exploited the positive or negative electric charge generated by displaying either a dash or a dot at any position on the CRT screen, a phenomenon known as secondary emission. A dash generated a positive charge, and a dot a negative charge, either of which could be picked up by a detector plate in front of the screen; a negative charge represented 0, and a positive charge 1. The charge dissipated in about 0.2 seconds, but it could be automatically refreshed from the data picked up by the detector.[21]

The Williams tube used in Baby was based on the CV1131, a commercially available 12-inch (300 mm) diameter CRT, but a smaller 6-inch (150 mm) tube, the CV1097, was used in the Mark I.[22]

Genesis of the project

edit
 
A plaque in honour of Williams and Kilburn at the University of Manchester

After developing the Colossus computer for code breaking at Bletchley Park during World War II, Max Newman was committed to the development of a computer incorporating both Alan Turing's mathematical concepts and the stored-program concept that had been described by John von Neumann. In 1945, he was appointed to the Fielden Chair of Pure Mathematics at Manchester University; he took his Colossus-project colleagues Jack Good and David Rees to Manchester with him, and there they recruited F. C. Williams to be the "circuit man" for a new computer project for which he had secured funding from the Royal Society.[23]

Having secured the support of the university, obtained funding from the Royal Society, and assembled a first-rate team of mathematicians and engineers, Newman now had all elements of his computer-building plan in place. Adopting the approach he had used so effectively at Bletchley Park, Newman set his people loose on the detailed work while he concentrated on orchestrating the endeavor.

— David Anderson, historian[23]

Following his appointment to the Chair of Electrical Engineering at Manchester University, Williams recruited his TRE colleague Tom Kilburn on secondment. By the autumn of 1947 the pair had increased the storage capacity of the Williams tube from one bit to 2,048, arranged in a 64 by 32-bit array,[24] and demonstrated that it was able to store those bits for four hours.[25] Engineer Geoff Tootill joined the team on loan from TRE in September 1947, and remained on secondment until April 1949.[26]

Now let's be clear before we go any further that neither Tom Kilburn nor I knew the first thing about computers when we arrived at Manchester University ... Newman explained the whole business of how a computer works to us."

— Frederic Calland Williams[9]

Kilburn had a hard time recalling the influences on his machine design:

[I]n that period, somehow or other I knew what a digital computer was ... Where I got this knowledge from I've no idea.

— Tom Kilburn[27]

Jack Copeland explains that Kilburn's first (pre-Baby) accumulator-free (decentralized, in Jack Good's nomenclature) design was based on inputs from Turing, but that he later switched to an accumulator-based (centralized) machine of the sort advocated by von Neumann, as written up and taught to him by Jack Good and Max Newman.[27]

The Baby's seven operation instruction set was approximately a subset of the twelve operation instruction set proposed in 1947 by Jack Good, in the first known document to use the term "Baby" for this machine.[28] Good did not include a "halt" instruction, and his proposed conditional jump instruction was more complicated than what the Baby implemented.[27]

Development and design

edit
 
Architectural schematic showing how the four cathode-ray tubes (shown in green) were deployed

Although Newman played no engineering role in the development of the Baby, or any of the subsequent Manchester computers, he was generally supportive and enthusiastic about the project, and arranged for the acquisition of war-surplus supplies for its construction, including GPO metal racks[29] and "…the material of two complete Colossi"[30] from Bletchley.

By June 1948 the Baby had been built and was working.[24] It was 17 feet (5.2 m) in length, 7 feet 4 inches (2.24 m) tall, and weighed almost 1 long ton (1.0 t). The machine contained 550 valves (vacuum tubes)—300 diodes and 250 pentodes—and had a power consumption of 3500 watts.[31] The arithmetic unit was built using EF50 pentode valves, which had been widely used during wartime.[25] The Baby used one Williams tube to provide 32 by 32-bit words of random-access memory (RAM), a second to hold a 32-bit accumulator in which the intermediate results of a calculation could be stored temporarily, and a third to hold the current program instruction along with its address in memory. A fourth CRT, without the storage electronics of the other three, was used as the output device, able to display the bit pattern of any selected storage tube.[32]

 
The output CRT is immediately above the input device, flanked by the monitor and control electronics.

Each 32-bit word of RAM could contain either a program instruction or data. In a program instruction, bits 0–12 represented the memory address of the operand to be used, and bits 13–15 specified the operation to be executed, such as storing a number in memory; the remaining 16 bits were unused.[32] The Baby's single operand architecture meant that the second operand of any operation was implicit: the accumulator or the program counter (instruction address); program instructions specified only the address of the data in memory.

A word in the computer's memory could be read, written, or refreshed, in 360 microseconds. An instruction took four times as long to execute as accessing a word from memory, giving an instruction execution rate of about 700 per second. The main store was refreshed continuously, a process that took 20 milliseconds to complete, as each of the Baby's 32 words had to be read and then refreshed in sequence.[24]

The Baby represented negative numbers using two's complement,[33] as most computers still do. In that representation, the value of the most significant bit denotes the sign of a number; positive numbers have a zero in that position and negative numbers a one. Thus, the range of numbers that could be held in each 32-bit word was −231 to +231 − 1 (decimal: −2,147,483,648 to +2,147,483,647).

Programming

edit

The Baby's instruction format had a three-bit operation code field, which allowed a maximum of eight (23) different instructions. In contrast to the modern convention, the machine's storage was described with the least significant digits to the left; thus a one was represented in three bits as "100", rather than the more conventional "001".[33]

Baby's instruction set[34]
Binary code Original notation Modern mnemonic Operation
000 S, Cl JMP S Jump to the instruction at the address obtained from the specified memory address S[a] (absolute unconditional indirect jump)
100 Add S, Cl JRP S Jump to the instruction at the program counter plus (+) the relative value obtained from the specified memory address S[a] (relative unconditional jump)
010 -S, C LDN S Take the number from the specified memory address S, negate it, and load it into the accumulator
110 c, S STO S Store the number in the accumulator to the specified memory address S
001 or
101[b] 		SUB S SUB S Subtract the number at the specified memory address S from the value in accumulator, and store the result in the accumulator
011 Test CMP Skip next instruction if the accumulator contains a negative value
111 Stop STP Stop

The awkward negative operations were a consequence of the Baby's lack of hardware to perform any arithmetic operations except subtraction and negation. It was considered unnecessary to build an adder before testing could begin as addition can easily be implemented by subtraction,[32] i.e. x+y can be computed as −(−x−y). Therefore, adding two numbers together, X and Y, required four instructions:[34] 

LDN X // load negative X into the accumulator
SUB Y // subtract Y from the value in the accumulator
STO S // store the result at S
LDN S // load negative value at S into the accumulator

Programs were entered in binary form by stepping through each word of memory in turn, and using a set of 32 buttons and switches known as the input device to set the value of each bit of each word to either 0 or 1. The Baby had no paper-tape reader or punch.[35][36][37]

First programs

edit
 
Output CRT

Three programs were written for the computer. The first, consisting of 17 instructions, was written by Kilburn, and so far as can be ascertained first ran on 21 June 1948.[38] It was designed to find the highest proper factor of 218 (262,144) by trying every integer from 218 − 1 downwards. The divisions were implemented by repeated subtractions of the divisor. The Baby took 3.5 million operations and 52 minutes to produce the answer (131,072). The program used eight words of working storage in addition to its 17 words of instructions, giving a program size of 25 words.[39]

Geoff Tootill wrote an amended version of the program the following month, and in mid-July Alan Turing — who had been appointed as a reader in the mathematics department at Manchester University in September 1948 — submitted the third program, to carry out long division. Turing had by then been appointed to the nominal post of Deputy Director of the Computing Machine Laboratory at the university,[38] although the laboratory did not become a physical reality until 1951.[40]

Later developments

edit

Williams and Kilburn reported on the Baby in a letter to the Journal Nature, published in September 1948.[41] The machine's successful demonstration quickly led to the construction of a more practical computer, the Manchester Mark 1, work on which began in August 1948. The first version was operational by April 1949,[40] and it in turn led directly to the development of the Ferranti Mark 1, the world's first commercially available general-purpose computer.[4]

Legacy

edit
 
BrewDog named their microbrewery in Manchester the Small Scale Experimental Beer Machine in honour of the Small-Scale Experimental Machine (SSEM)

In 1998, a working replica of the Baby, now on display at the Museum of Science and Industry in Manchester, was built to celebrate the 50th anniversary of the running of its first program. Demonstrations of the machine in operation are held regularly at the museum.[42]

In 2008, an original panoramic photograph of the entire machine was discovered at the University of Manchester. The photograph, taken on 15 December 1948 by a research student, Alec Robinson, had been reproduced in The Illustrated London News in June 1949.[43][44]

References

edit

Notes

edit
  1. ^ a b As the program counter was incremented at the end of the decoding process, the stored address had to be the target address −1.
  2. ^ The function bits were only partially decoded, to save on logic elements.[34]

Citations

edit
  1. ^ Burton, Christopher P. (2005). "Replicating the Manchester Baby: Motives, methods, and messages from the past". IEEE Annals of the History of Computing. 27 (3): 44–60. doi:10.1109/MAHC.2005.42. S2CID 1852170.
  2. ^ a b Enticknap, Nicholas (Summer 1998), "Computing's Golden Jubilee", Resurrection (20), The Computer Conservation Society, ISSN 0958-7403, archived from the original on 9 January 2012, retrieved 19 April 2008
  3. ^ a b "Early Electronic Computers (1946–51)", University of Manchester, archived from the original on 5 January 2009, retrieved 16 November 2008
  4. ^ a b Napper, R. B. E., Introduction to the Mark 1, The University of Manchester, archived from the original on 26 October 2008, retrieved 4 November 2008
  5. ^ Briggs, Helen (21 June 2018). "The 'Baby' that ushered in modern computer age". BBC. Retrieved 21 June 2018.
  6. ^ Turing, A. M. (1936), "On Computable Numbers, with an Application to the Entscheidungsproblem" (PDF), Proceedings of the London Mathematical Society, 2, vol. 42 (published 1936–1937), pp. 230–265, doi:10.1112/plms/s2-42.1.230, S2CID 73712, retrieved 18 September 2010
  7. ^ "Rechenhilfe für Ingenieure Konrad Zuses Idee vom ersten Computer der Welt wurde an der Technischen Hochschule geboren" (in German), Technische Universität Berlin, archived from the original on 13 February 2009
  8. ^ "JVA – Computing History". John Vincent Atanasoff and the Birth Of Electronic Digital Computing. JVA Initiative Committee and Iowa State University. 2011.
  9. ^ a b Copeland (2010), pp. 91–100
  10. ^ Zuse, Horst, "Konrad Zuse and the Stored Program Computer", EPE Online, Wimborne Publishing, archived from the original on 10 December 2007, retrieved 16 November 2008
  11. ^ Lavington (1998), p. 7
  12. ^ Lavington (1998), p. 1
  13. ^ Brown (1999), p. 429
  14. ^ Lavington (1998), p. 9
  15. ^ a b c d e f g h Lavington (1980), chapter 5
  16. ^ Lavington (1998), pp. 8–9
  17. ^ Lavington (1998), p. 5
  18. ^ Wilkes, M. V.; Renwick, W. (1950), "The EDSAC (Electronic delay storage automatic calculator)", Mathematics of Computation, 4 (30): 61–65, doi:10.1090/s0025-5718-1950-0037589-7, retrieved 21 June 2015
  19. ^ "Early computers at Manchester University", Resurrection, 1 (4), The Computer Conservation Society, Summer 1992, ISSN 0958-7403, archived from the original on 28 August 2017, retrieved 19 April 2008
  20. ^ Lavington (1998), pp. 13, 24
  21. ^ Lavington (1998), p. 12
  22. ^ Lavington (1998), pp. 8, 12
  23. ^ a b Anderson, David (2007). "Max Newman: Topologist, codebreaker, and pioneer of computing". IEEE Annals of the History of Computing. 29 (3): 76–81. doi:10.1109/MAHC.2007.4338447.
  24. ^ a b c Napper (2000), p. 366
  25. ^ a b Lavington (1998), p. 13
  26. ^ Lavington (1998), p. 16
  27. ^ a b c Copeland 2011
  28. ^ I. J. Good, "The Baby Machine", note, 4 May 1947, in Good, Early Notes on Electronic Computers (Virginia Tech University Libraries, Special Collections, collection Ms1982-018, the Irving J. Good papers)
  29. ^ Lavington (1998), pp. 6–7
  30. ^ Anderson (2010), p. 61
  31. ^ "The "Baby": The World's First Stored-Program Computer" (PDF), Manchester Museum of Science & Industry, archived from the original (PDF) on 4 March 2009, retrieved 15 November 2008
  32. ^ a b c Napper (2000), p. 367
  33. ^ a b Lavington (1998), p. 14
  34. ^ a b c Lavington (1998), p. 15
  35. ^ Napper (2000), pp. 366–367
  36. ^ "SSEM Programmer's Reference Manual". curation.cs.manchester.ac.uk. A3.3 Control Switches. Retrieved 17 May 2018.
  37. ^ "Manchester Baby Simulator". www.davidsharp.com. Pictures, How to operate the Baby/Emulator, Discussion of the historical accuracy of the emulator, Technical Introduction to Programming the Baby (v4.0). Retrieved 17 May 2018.
  38. ^ a b Lavington (1998), pp. 16–17
  39. ^ Tootill, Geoff (Summer 1998), "The Original Original Program", Resurrection (20), The Computer Conservation Society, ISSN 0958-7403, archived from the original on 9 January 2012, retrieved 19 April 2008
  40. ^ a b Lavington (1998), p. 17
  41. ^ Williams, F. C.; Kilburn, T. (25 September 1948), "Electronic Digital Computers", Nature, 162 (4117): 487, Bibcode:1948Natur.162..487W, doi:10.1038/162487a0, S2CID 4110351
  42. ^ "Meet Baby". Science and Industry Museum.
  43. ^ Highfield, Roger (17 June 2008), "Photo of great grandfather of modern computers found", The Daily Telegraph, retrieved 20 June 2008
  44. ^ "Dead Media Beat: Baby". 20 June 2008. Retrieved 21 June 2017.

Bibliography

edit
  • Anderson, David (2010), "Contested Histories: De-mythologising the Early History of Modern British Computing", History of Computing. Learning from the Past, Springer, pp. 58–67
  • Brown, Louis (1999), A Radar History of World War II: Technical and Military Imperatives, CRC Press, ISBN 978-0-7503-0659-1
  • Copeland, Jack (2010), "Colossus and the Rise of the Modern Computer", in Copeland, B. Jack (ed.), Colossus The Secrets of Bletchley Park's Codebreaking Computers, Oxford University Press, ISBN 978-0-19-957814-6
  • Copeland, Jack (2011), "The Manchester Computer: A Revised History – Part 2: The Baby Computer", IEEE Annals of the History of Computing, 33 (January–March 2011): 22–37, doi:10.1109/MAHC.2010.2, S2CID 9522437
  • Lavington, Simon (1980), Early British Computers: The Story of Vintage Computers and the People who built them (1st ed.), Manchester University Press Society, ISBN 978-0-7190-0803-0
  • Lavington, Simon (1998), A History of Manchester Computers (2nd ed.), Swindon: The British Computer Society, ISBN 978-1-902505-01-5
  • Napper, R. B. E. (2000), "The Manchester Mark 1 Computers", in Rojas, Raúl; Hashagen, Ulf (eds.), The First Computers: History and Architectures, MIT Press, pp. 356–377, ISBN 978-0-262-68137-7

Further reading

edit
edit
 
Wikimedia Commons has media related to Manchester Small-Scale Experimental Machine.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Manchester_Baby&oldid=1237856883"