10: Australia’s first Computers : SILLIAC

SILLIAC_Harry Messel
Fig 1: Professor Harry Messel “tightening one of the screws” (with a soldering iron?), 1955. Photographer unknown. Courtesy of the Science Foundation.
Blatt and Swire discussing SILLIAC
Fig 2: Dr. John Blatt (left) and Mr. Brian Swire (right) checking the details of the SILLIAC design, 1954. Photographer unknown. Courtesy of the Science Foundation.
SILLIAC_Peter Aplin
Fig 3: Peter Aplin, one of the engineering staff, examining a component chassis during the assembly of SILLIAC, 1955. Photographer unknown. Courtesy of the Science Foundation.
SILLIAC_Nerida Smith_operator
Fig 4: SILLIAC operator, Nerida Smith, starting up the completed machine, 1956. Photographer unknown. Courtesy of the Science Foundation.
  • Arithmetic Unit – the equivalent of a calculator. SILLIAC, like all modern digital computers, stored numbers in a binary format, using electronic devices which are able to remain in either of two states, on or off. On is generally represented as a “one” and off as a “zero”. The states of truth or falsity of propositions in logic can be similarly represented, with true being a “one” and false being a “zero”. So SILLIAC, like any other digital computer, was able to carry out logical as well as numerical operations. The Arithmetic Unit could perform additions, subtractions – by complementing the number and adding, division – by successive left shifts or divisions by two, multiplication – successive right shift or multiplications by two, and a clear or reset to zero of the accumulator register. Multiplications and divisions by an odd number were achieved by a series of successive left or right shifts in the accumulator followed by an add or subtract of the original number. Logical operations were made up from basic arithmetic operations as needed.
  • Memory – SILLIAC’s memory consisted in 1024 (210) words each of 40 bits. That is, it had 1024 locations, or addresses, in memory each of which was 40 bits deep. The words were stored on 40 CRTs of the type known as Williams-Kilburn Tubes, which were an electrostatic memory that stored a “bit” as a spot of brightness stimulated by the effect of the electron beam in the tube on the phosphor coating on the inside of its faceplate. As the phosphor could only hold the electrons for a short period before they leaked away, the memory depended on the continual refresh or regeneration of the spot by a special circuit that had to refresh the spot at least once every tenth of a second (and preferably many more times than that). This kind of memory is very similar in use to dynamic ram in contemporary computers, though implemented in vacuum tube technology rather than monolithic silicon. However, as distinct from the acoustic delay-line type of memory the Williams-Kilburn tube can directly represent a bit-map image if used as a display. [For more detail see the description of the Williams-Kilburn tube in the section on Display Devices.]
  • Input/output – Information was transferred to and from SILLIAC in the form of a coded pattern of holes punched in a paper-tape.10 The paper tape was prepared from a program by punching the tape with the pattern of holes and placing it in a reader under the automatic control of the machine. On completion of a program the machine would then punch a tape with a pattern of holes representing the results. The output tape could then be read and converted to text with the aid of (what was then) a standard Post Office teletypewriter. In 1959 a machine for converting punched cards of the Hollerith type into paper-tape and for converting the paper-tape to punched cards was added.11 Over 1958-9 a magnetic tape “backing store” was developed and subsequently incorporated into the machine for the interim storage of numbers being used in a calculation and for the longer term storage of programs, data, and results which would be regularly used in research or other work carried out on the machine.12
  • Internal buss – the means by which data were transferred to and from various parts of the machine.
  • Sequence control – the machine would proceed to execute instructions (“orders” as they were known to the early programmers) in sequential order as they were drawn from memory and placed on the buss. An “order counter” in the control unit of the machine would contain the location of the next instruction to be executed. In a very simple program, the orders were carried out until the procedure reached a conclusion and a “Stop” instruction was executed. Here the value in the Order Counter would be incremented after each order was carried out. However, in most programs numerous iterations of some section of the program would need to be carried out, eg, in many large calculations, and a conditional transfer of control, or branch, order would be carried out. There were two conditions under which these transfers took place. The first was whether the sign of the number in the A register (accumulator) was positive or zero, in which case a branch would occur, or if negative no branch would occur. The second condition was whether or not a calculation had produced an overflow in the A register. With the execution of a conditional transfer the new location of the next instruction would be directly entered into the “Order Counter” register.13
SILLIAC_launch_ABC
Fig 5: Barry de Ferranti (left), assistant engineer, and Brian Swire (right) chief engineer, checking printout in rehearsals for the Commissioning ceremony, 12 September, 1956. The ABC supplied their new OB system to provide closed circuit TV viewing of the ceremony to the audience in a nearby lecture theatre. There was not enough space available in the computer room for all the attendees. Photographer unknown. Courtesy of the Science Foundation.

———————————————————-

Return to Contents

FOOTNOTES

  1. McCaughan, J.B.T. (1987) “The Era Begins”, chapter 2 of Millar, D.D. (ed.) (1987) The Messel Era. The story of the School of Physics and its Science Foundation within the University of Sydney, 1952-1987, Sydney: Pergamon Press, for The Science Foundation, University of Sydney, and Pearcey, Trevor (1988b) A History of Australian Computing, Melbourne: Chisholm Institute of Technology., p.30. ↩︎
  2. For the genealogy of the IAS machines see Deane, John, (2003a) The IAS Family Scrapbook, Killara, NSW: Australian Computer Museum Society. ↩︎
  3. McCaughan, 1987, op cit, p.16. ↩︎
  4. Deane, 2003, op cit, p.22. ↩︎
  5. Deane, 2003, op cit, p.23. ↩︎
  6. From a draft of a letter from Messel to the Nuffield Foundation, January 1954 contained in the University of Sydney Archives, Box 54, and quoted in Deane, 2003a, op cit, p.26. ↩︎
  7. Pearcey, 1988, op cit, p.30. ↩︎
  8. Leapfrog was designed to copy itself into the next available sector of memory, then leap into that version of itself and do the process again until all memory locations had been tested. This process put all of the machine to the test. We shall come back to Leapfrog later. See Deane, 2003, op cit, p.44-5. ↩︎
  9. Deane, 2003, op cit, p.44-5. These calculations, which were intended to compare results derived from theory with actual experimental results, produced a major breakthrough in the theory of Superfluidity in liquid Helium. The results were published very shortly afterwards in Butler, S.T., Blatt, J.M. and Schafroth, M.R., “Nature of the l-Transition in Liquid Helium” Il Nuovo Cimento, vol.4, p.674 on the 1st September, 1956, and caused a major stir in the scientific world with Blatt and Butler travelling to the US to give talks about the work. It was also reported with great pride in The Nucleus, vol.2, no.5, p.9, where Barry de Ferranti describes this calculation as being of immense importance in physics. ↩︎
  10. SILLIAC Programming Manual, A Guide to the Preparation of Problems for Solution by the Automatic Digital Computer in the Adolph Basser Computing Laboratory within the School of Physics of the University of Sydney. The Adolph Basser Computing Laboratory, School of Physics, The University of Sydney, 2nd edition, Sydney, 1959, pp.1-3. The first edition was a copy of the University of Illinois’ ILLIAC Programming Manual. ↩︎
  11. The Nucleus, vol.5, no.1, p.17. ↩︎
  12. Deane, 2003, op cit, p.65 and p.70; and The Nucleus, vol.5, no’s 1 & 2. ↩︎
  13. See the SILLIAC Programming Manual, op cit.,or Deane, 2003b, op cit, for much more detail. ↩︎
  14. The Nucleus, vol.2, no.5, September 1956, pp.4-5, “Opening Day”. ↩︎