Optimal mapping of neighbourhood-constrained systems | SpringerLink
Skip to main content
Springer Nature Link
Log in

Optimal mapping of neighbourhood-constrained systems

  • Conference paper
  • First Online:
Parallel Algorithms for Irregularly Structured Problems (IRREGULAR 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 980))

  • 150 Accesses

Abstract

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.

This work was partially supported by CNPq, CAPES and FAPERJ, Brazilian research agencies.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Barbosa, V.C. (1993). Massively Parallel Models of Computation, Ellis Horwood, Chichester, UK.

    Google Scholar 

  2. 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.

    Article  Google Scholar 

  3. 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. 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.

    Article  Google Scholar 

  5. 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 

Download references

Author information

Authors and Affiliations

  1. COPPE Sistemas e Computação, Universidade Federal do Rio de Janeiro, Brazil

    Felipe M. G. França

  2. Faculdade de Formação de Professores, Universidade Estadual do Rio de Janeiro, Brazil

    Luerbio Faria

Authors
  1. Felipe M. G. França
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luerbio Faria
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Afonso Ferreira José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

França, F.M.G., Faria, L. (1995). Optimal mapping of neighbourhood-constrained systems. In: Ferreira, A., Rolim, J. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1995. Lecture Notes in Computer Science, vol 980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60321-2_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-60321-2_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60321-4

  • Online ISBN: 978-3-540-44915-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation