Advertisement

Towards a Decentralised General-Purpose Computer

  • Philip C. Treleaven
Conference paper
  • 32 Downloads
Part of the Informatik-Fachberichte book series (INFORMATIK, volume 53)

Abstract

Research into novel decentralised computer architectures may be broadly classified in terms of the computer’s program organisation as: control flow, data flow, reduction, actor and logic. Each of these program organisations supports efficiently a single category of programming language? control flow — conventional languages, data flow — single assignment languages, reduction — applicative languages, actor — object-oriented languages, and logic — predicate logic languages. However general-purpose computers are required ideally to support a number of categories of language efficiently.

Our approach to the design of general-purpose computers, in particular a future decentralised architecture, is to develop computers that embody more than one traditional program organisation. In this paper we describe a computer providing both control flow and data flow. We are working on a computer design that also includes reduction. And our target is a computer providing control flow, data flow, reduction and other styles of programming.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Ackerman W.B. and Dennis J.B.: “VAL — A Value Oriented Algorithmic Language (preliminary reference manual)”. Tech. Report MIT/LCS/TR-218, Laboratory for Computer Science, MIT (June 1979).Google Scholar
  2. [2]
    Anon.: “Proceedings of International Conference on Fifth Generation Computer Systems”. Japan Information Processing Development Center (October 1981) to be publishied by North Holland Press.Google Scholar
  3. [3]
    Arvind et al. “The Id Report: An Asynchronous Programming Language and Computing Machine”. Tech. Report 114a, Dept. of Information and Computer Science, University of California, Irvine (May 1978).Google Scholar
  4. [4]
    Backus J.: “Can Programming be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs”. Comm. ACM vol. 21, no. 8 (August 1978) pp. 613–641.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    Berkling K.J.: “Reduction languages for Reduction Machines”. Proc. Second Int. Symp. on Computer Architecture (April 1975) pp. 133–140.Google Scholar
  6. [6]
    Byte: “A special issue on the Smalltalk-80 Programming Language”. Byte (August 1981).Google Scholar
  7. [7]
    Darlington J. et al: “Functional Programming and Its Applications”. Cambridge University Press (1982).Google Scholar
  8. [8]
    Dennis J.B.: “Data Flow Supercomputers”. IEEE Computer Magazine vol. 13, no. 11 (November 1980) pp. 48–56.CrossRefGoogle Scholar
  9. [9]
    Farrell E.P. et al: “A Concurrent Computer Architecture and a Ring Based Implementation”. Proc. Sixth Int. Symp. on Computer Architecture (April 1979) pp. 1–11.Google Scholar
  10. [10]
    Hopkins R.P . et al: “A Computer supporting Data Flow, Control Flow and Updateable Memory”. Tech. Report 144, Computing Laboratory, University of Newcastle upon Tyne (September 1979).Google Scholar
  11. [11]
    Kobayashi K.: “Computer, Commuincations and Man: The Integration of Computer and Commuincations with Man as an Axis”. Computer Networks vol. 5, no. 4 (July 1981) pp. 237–250.Google Scholar
  12. [12]
    Kowalski R.A.: “Logic for Problem Solving”. North Holland Press (1980).Google Scholar
  13. [13]
    Mead C. and Conway L.: “Introduction to VLSI Systems”. Addison-Wesley Press (1980).Google Scholar
  14. [14]
    Michie D . (ed.), “Expert Systems in the Micro Electronic Age”. Edinburgh University Press (1979).Google Scholar
  15. [15]
    Treleaven P.C .: “Principle Components of a Data Flow Computer”. Proc. 1978 Euromicro Symp. (October 1978) pp. 366–374.Google Scholar
  16. [16]
    Treleaven P.C. and Mole G.F.: “A Multi-processor Reduction Machine for User-defined Reduction Languages”. Proc. Seventh Int. Symp. on Computer Architecture (April 1980) pp. 121–129.Google Scholar
  17. [17]
    “Computer Architecture”. Tech. Report 161, Computing Laboratory, University of Newcastle upon Tyne (March 1981).Google Scholar
  18. [18]
    Treleaven P.C . et al: “Combining Data Flow and Control Flow Computing”. The Computer Journal vol. 25, no. 1 (January 1982).Google Scholar
  19. [19]
    Treleaven P.C . et al: “Data Driven and Demend Driven Computer Architecture”. ACM Computing Surveys vol. 14, no. 1 (March 1982).Google Scholar
  20. [20]
    Turner D.: “A New Implementation Technique for Applicative Languages”. Software — Practice and Experience vol. 9, (1979) pp. 31–49.zbMATHCrossRefGoogle Scholar
  21. [21]
    Watson I. and Gurd J.: “A Prototype Data Flow Computer with Token Labelling”. Proc. AFIPS vol. 48 (1979) pp. 623–628.Google Scholar
  22. [22]
    Wilner W.T.: “Recursive Machines”. Internal Report, Xerox Palo Alto Research Center, Palo Alto, California (1980).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Philip C. Treleaven
    • 1
  1. 1.Computing LaboratoryUniversity of Newcastle upon TyneUK

Personalised recommendations