The architecture of DOOM

  • W. J. H. J. Bronnenberg
  • M. D. Janssens
  • E. A. M. Odijk
  • R. A. H. van Twist
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 272)


This paper describes the architecture of DOOM, a Decentralized Object-Oriented Machine, which is being designed in the Computer Science department of Philips Research Laboratories. The paper starts by resuming the essential characteristics of POOL-T, the parallel object-oriented language designed in the framework of the project. An abstract architecture matching the computational model of the language is then described. In three successive steps this architecture is transformed to the DOOM architecture which is under design. Each of the steps reveals the requirements on the actual system that are introduced by the transformation. The DOOM architecture consists of a collection of self contained computers, consisting of a cpu, local memory and a communication unit to connect these computers via a point-to-point packet switching network. The functional requirements and the architecture of the cpu, the memory and the communication networks are then treated in greater detail, covering one section each.


Communication Processor Memory Management Context Switch Virtual Memory Communication Unit 
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. [America 85]
    Pierre America: Rationale for the design of POOL, Doc. No. 53, ESPRIT Project 415A, Philips Research Laboratories, Eindhoven, the Netherlands, 1985.Google Scholar
  2. [Arden 81]
    Bruce W. Arden and Hikyu Lee: Analysis of a Chordal Ring Network, IEEE Transactions on computers, Volume c-30, Number 4, April 1981.Google Scholar
  3. [Beenker 68]
    G.F.M. Beenker: Homogeneous networks for parallel computer systems, Philips Research Laboratories internal report, NR. 6103, June 1986.Google Scholar
  4. [Bermond 83]
    J.C.Bermond,J.Bond,M.Paoli, C.Peyrot: Graphs and Interconnection Networks: Diameter and Vulnerability, in Surveys in Combinatorics, London Math.Soc. Lecture Notes 82, Cambridge University Press, Cambridge 1983, pp. 1–30.Google Scholar
  5. [Bhuyan 84]
    Laxmi N. Bhuyan and Dharma P. Agrawal: Generalized Hypercube and Hyperbus Structures for a Computer Network, IEEE Transactions on computers, Volume c-33, Number 4, April 1984.Google Scholar
  6. [Cattermole 77]
    K.W. Cattermole, J.P. Summer: Communication networks based on the product graph, Proc. IEE, Vol 124, NO. 1, January 1977.Google Scholar
  7. [D0091]
    Pierre America: Definition of the programming language POOL-T, Doc. No. 91, ESPRIT Project 415A, Philips Research Laboratories, Eindhoven, the Netherlands, 1986.Google Scholar
  8. [D0104]
    A. Augusteijn: POOL-T user manual, Doc. No. 104, ESPRIT Project 415A, Philips Research Laboratories, Eindhoven, the Netherlands, 1985.Google Scholar
  9. [Feng 81]
    Tse-Yun Feng: A survey of Interconnection Networks, Computer, Volume 14, Number 12, December 1981, pp 12–27.Google Scholar
  10. [Flynn 70]
    Flynn, M.J., A. Podrin, and K. Shimizer: A Multiple instruction Stream with Shared Resources L.C. Hobbs (ed.), Parallel Processor System Technologies and Applications, Spartan Books, Washington, D.C.,1970, pp. 251–286.Google Scholar
  11. [Harary 72]
    F. Harary: Graph Theory, Addison-Wesley Publishing Company, Reading, third printing, 1972.Google Scholar
  12. [Hennessy 82]
    John Hennessy, Norman Jouppi, Forest Baskett, Thomas Gross, John Gill: Hardware/software tradeoffs for increased performance, Computer Architecture News, Vol. 10, no. 2, pp. 2–11, March 1982.Google Scholar
  13. [Katevenis 83]
    Katevenis, M.G.H.: Reduced Instruction Set Computer Architectures for VLSI, The MIT Press, Cambridge, Massachusetts, 1983.Google Scholar
  14. [Land 86]
    S.P.J. Landsbergen: Isomorphic grammars and their use in the Rosetta translation system, Philips manuscript 12.950.Google Scholar
  15. [Lang 82]
    C.R.Lang,Jr.: The Extension of Object-Oriented Languages to a Homogeneous, Concurrent Architecture, Ph.D.Thesis, California Institute of Technology, 1982.Google Scholar
  16. [Martin 81]
    Alain J.Martin: The Torus: an exercise in constructing a processing surface, Proceedings of the second Caltech Conference on VLSI, January 1981.Google Scholar
  17. [Mehr 86]
    P.Mehring, E.Aposporides: A multilevel simulator for VLSI, this volumeGoogle Scholar
  18. [Odijk 85]
    Eddy A.M. Odijk, The Philips Object-Oriented Parallel Computer, In: J.V.Woods (ed.): Fifth Generation Computer Architecture (IFIP TC-10), North Holland, 1985Google Scholar
  19. [Seitz 85]
    C.L. Seitz: The Cosmic Cube, Caltech University of Technology., Communications of the ACM., Volume 28, Number 1, 1985.Google Scholar
  20. [Sequin 81]
    C.H.Sequin: Double twisted torus networks for VLSI processor arrays, 8th annual Symposium on Computer Architecture, Minneapolis, May 1981, pp 471–550.Google Scholar
  21. [Shar 74]
    Shar, L.E., and E.S. Davidson: A MultiminiProcessor System Implemented Through Pipelining, IEEE Computer, February 1974, pp. 42–51.Google Scholar
  22. [TA-415]
    Technical Annex for Esprit project 415, october 1984.Google Scholar
  23. [Thornton 70]
    Thornton, J.E.: Design of a Computer — The Control Data 6600, Scott, Forestman and Co., Glenview, 1970Google Scholar
  24. [Wittie 81]
    Larry D. Wittie: Communication Structures for large Networks of Microcomputers, IEEE Transactions on computers, Volume c-30, Number 4, April 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • W. J. H. J. Bronnenberg
    • 1
  • M. D. Janssens
    • 1
  • E. A. M. Odijk
    • 1
  • R. A. H. van Twist
    • 1
  1. 1.Philips Research LaboratoriesEindhovenThe Netherlands

Personalised recommendations