Cobweb-2: Structured specification of a wafer-scale supercomputer

  • Paul Anderson
  • Chris Hankin
  • Paul Kelly
  • Peter Osmon
  • Malcolm Shute
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 258)


Using an informal presentation of the specification techniques being used in COBWEB-2's design, this paper has described the machine and the principles of its operation.

An on-wafer communications network with a fault-tolerant packet routing mechanism has been described. These techniques. Cartesian routing with convex wrapping, are a substantial improvement on Catt's spiral (used in COBWEB-1). The use of the network to increase “harvest” without requiring very high yield processing elements provides the key to feasible wafer scale integration.


Processing Element Engineering Model Abstract Machine Parallel Evaluation Graph Reduction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ansade et al. 86]
    Y. Ansade, R. Cornu-Emieux, B. Faure and G. Mazare "WSI Asynchronous Cells Network". Presented at IFIP Workshop on Wafer Scale Integration. Grenoble, France, 17–19 March 1986.Google Scholar
  2. [Aubusson & Catt 78]
    Russell Aubusson and Ivor Catt "Wafer-Scale Integration — A Fault-Tolerant Procedure." IEEE Journal of Solid State Circuits, Vol. SC-13, June 1978.Google Scholar
  3. [Barendregt et al. 86]
    H.P. Barendregt, M.C.J.D. van Eekelen and M.J. Plasmeijer "Specification of Reduction Strategies in Term Rewriting Systems." Preprint, Department of Computing Science, Nijmegen University, The Netherlands.Google Scholar
  4. [Burn, Hankin & Abramsky 85]
    Geoff Burn, Chris Hankin and Samson Abramsky "Strictness Analysis for Higher-Order Functions". Imperial College Department of Computing Report DoC 85/6, April 1985. To appear in Science of Computer Programming.Google Scholar
  5. [Cardelli 84]
    L. Cardelli "Compiling a Functional Language". Proceedings of the ACM Conference on Lisp and Functional Programming, Austin, Texas (1984).Google Scholar
  6. [Dijkstra 80]
    E.W. Dijkstra "A Mild Variant of Combinatory Logic". EWD735 (1980).Google Scholar
  7. [Greene & El Gamal 84]
    J.W. Greene and A. El Gamal "Configuration of VLSI Arrays in the Presence of Defects". JACM, Vol. 31, No. 4, October 1984, pp. 694–717.Google Scholar
  8. [Hankin, Burn & Peyton Jones 86]
    Chris Hankin, Geoff Burn and Simon Peyton Jones "A Safe Approach to Parallel Combinator Reduction" (Extended Abstract). Proceedings ESOP 86 (European Symposium on Programming), Saarbrucken, Federal Republic of Germany, March 1986, Robinet B. and Wilhelm R. (eds.) Springer Verlag LNCS 213, pp. 99–110.Google Scholar
  9. [Hankin, Osmon & Shute 85]
    Chris Hankin, Peter Osmon and Malcolm Shute "COBWEB — A Combinator Reduction Architecture." Functional Programming and Computer Architecture, Nancy, France, September 1985. J.-P. Jouannaud (ed.), Springer Verlag LNCS 201 pp.99–112.Google Scholar
  10. [Hope 86]
    The FPM Hope Compiler. Department of Computing. Imperial College of Science and Technology, 180 Queen's Gate, London SW7 2BZ, United Kingdom.Google Scholar
  11. [Hudak & Kranz 83]
    Paul Hudak and David Kranz "A Combinator-Based Compiler for a Functional Language". Principles of Programming Languages, 11th Annual Symposium, ACM SIGACT-SIGPLAN pp. 122–132 (Jan. 1984).Google Scholar
  12. [Kelly & Shute 86]
    Paul Kelly and Malcolm Shute "Cartesian Routing and Fault Tolerance in Wafer-Scale Multi-computer." Presented at IFIP Workshop on Wafer Scale Integration. Grenoble, France, 17–19 March 1986.Google Scholar
  13. [Kennaway & Sleep 81]
    J.R. Kennaway and M.R. Sleep "Director Strings as Combinators". University of East Anglia Report (1981).Google Scholar
  14. [Klop 85]
    J.W. Klop Term Rewriting Systems. Notes provided for the seminar on reduction machines. Ustica, September 1985. Center for Mathematics and Computer Science, Amsterdam.Google Scholar
  15. [Mycroft 81]
    Alan Mycroft Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD. thesis, Department of Computer Science, University of Edinburgh, 1981.Google Scholar
  16. [Peyton Jones 87]
    Simon L. Peyton Jones Implementing Functional Languages using Graph Reduction. To appear. Prentice-Hall (1987).Google Scholar
  17. [Jesshope & Moore 86]
    C.R. Jesshope and W.R. Moore Wafer-Scale Integration, Adam Hilger Ltd. (1986).Google Scholar
  18. [Turner 85]
    David Turner "Miranda: a Non-strict Functional Language with Polymorphic Types." Functional Programming and Computer Architecture, Nancy, France, September 1985. J.-P. Jouannaud (ed.), Springer Verlag LNCS 201 pp.1–16Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Paul Anderson
    • 1
  • Chris Hankin
    • 1
  • Paul Kelly
    • 2
  • Peter Osmon
    • 1
  • Malcolm Shute
    • 3
  1. 1.Computer Science DepartmentThe City UniversityLondonUK
  2. 2.Department of ComputingImperial College of Science and TechnologyLondonUK
  3. 3.Microelectronics UnitMiddlesex PolytechnicLondonUK

Personalised recommendations