A Multimicroprocessor for Parallel Processing

  • G. Authie
  • D. El Baz
Part of the Applied Information Technology book series (AITE)


We present a low cost efficient multimicroprocessor designed to study parallel algorithms like fixed point parallel algorithms or parallel algorithms for distributed systems control. This multiprocessor is a collection of 8 processors sharing a common memory. Its architecture presents some original features that guarantee data consistency and good efficiency. Experimental results are given for synchronous and asynchronous algorithms applied to the Dirichlet problem.


Parallel Algorithm Shared Memory Host Computer Distribute System Control Common Memory 
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. 1.
    Baudet, G. (1978). Asynchronous iterative methods for multiprocessors. J.A.C.M., vol. 25, No. 2, 226–244.MathSciNetMATHGoogle Scholar
  2. 2.
    Chazan, D. and Miranker, W. (1969). Chaotic relaxation. Linear algebra and its applications. vol. 2, 199–222.MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Fathi E.T. and Krieger (1983). Multiple microprocessor systems: what, why and when. Computer, 23–92.Google Scholar
  4. 4.
    Miellou, J.C. (1975). Algorithmes de relaxation chaotique a retards. RAIRO, vol. 8, R1 – 52–82.Google Scholar
  5. 5.
    Paker, Y. (1983). Multi-microprocessor systems. Academic Press.MATHGoogle Scholar
  6. 6.
    Young, D. (1971). Iterative solution of large linear systems. Academic Press.MATHGoogle Scholar

Copyright information

© Plenum Press, New York 1986

Authors and Affiliations

  • G. Authie
    • 2
    • 1
  • D. El Baz
    • 2
  1. 1.Laboratoire d’Automatique et d’Analyse de SystemesC.N.R.S.Toulouse CedexFrance
  2. 2.Departement de Genie ElectriqueI.N.S.A.Toulouse CedexFrance

Personalised recommendations