Optimal mapping of neighbourhood-constrained systems

  • Felipe M. G. França
  • Luerbio Faria
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 980)


The problem of finding the minimum topology of multiprocessing substrates supporting parallel execution of any given neighbourhood-constrained system is proposed and possible optimal strategies are investigated based on the relationship between Barbosa's scheduling by edge reversal — SER — distributed algorithm and the minimum clique covering problem. It is shown that from any given clique covering of length λ on a graph G, it is possible to obtain a SER trailer dynamics in G's complement that cover G upon λ evolutions. It also shown that, conversely, from any given SER dynamics on G in which all of its nodes operate at least once upon λ steps, a clique covering of length at most λ is defined on G's complement. In addition, a conjecture correlating the length of any minimum clique covering and optimal concurrency in SER- driven systems is stablished.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ba93]
    Barbosa, V.C. (1993). Massively Parallel Models of Computation, Ellis Horwood, Chichester, UK.Google Scholar
  2. [BaGa89]
    Barbosa, V.C., and Gafni, E. (1989). “Concurrency in heavily loaded neighborhood-constrained systems”, ACM Transactions on Programming Languages and Systems, pp. 562584, vol. 11, no. 4.CrossRefGoogle Scholar
  3. [Fr94]
    França, F.M.G. (1994) Neural Networks as NeighbourhoodConstrained Systems, Ph.D. Thesis, Department of Electric and Electronic Engineering, Imperial College, London, UK.Google Scholar
  4. [GaBe81]
    Gafni, E.M. and Bertsekas, D.P. (1981). “Distributed algorithms for generating loop-free routes in networks with frequently changing topology”, IEEE Transactions on Communications, pp. 11–18, COM-29, no. 1.CrossRefGoogle Scholar
  5. [GaJo79]
    Garey, M.R. and Jonhson, D.S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, NY, USA.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Felipe M. G. França
    • 1
  • Luerbio Faria
    • 2
  1. 1.COPPE Sistemas e ComputaçãoUniversidade Federal do Rio de JaneiroBrazil
  2. 2.Faculdade de Formação de ProfessoresUniversidade Estadual do Rio de JaneiroBrazil

Personalised recommendations