Skip to main content
SpringerLink
Log in

Hierarchical discrete systems and realisation of parallel algorithms

  • Parallelism Of Numerical Algorithms
  • Conference paper
  • First Online:
Conpar 81 (CONPAR 1981)

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

Included in the following conference series:

  • 105 Accesses

Abstract

The subject of the paper is discrete systems (DS) represented by a set of elements and a set of operations. In particular these operations are permutations of DS elements. The DS is represented by subsystems with sufficient small number of elements and operations of the same kind. The subsystems are distributed at hierarchical levels. The subsystems of each level can execute their operations in parallel. On the basis of this approach algorithms are constructed for parallel realisation of the permutations in DS using a generating set of permutations. A theoretical group interpretation of the well-known fast Fourier transform is made, which shows that this approach can be applied to a wider class of transformations.

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.

References

  1. Arbib, M.A., Manes, E.G., Foundations of system theory: decomposable systems, Automatica, Pergam. Press, 10, 1974, pp. 285–302.

    Article  MATH  MathSciNet  Google Scholar 

  2. Tanaka, Y., Miyashita, K., Koyama, S., Miyamoto, F., Tsuda, T., A new hierarchical array processor system, Second Symp. on Micro-Architecture — EUROMICRO 1976, North Holland Public Company.

    Google Scholar 

  3. Dijkstra, E.W., Hierarchical Ordering of Sequential Processing, Acta Informatica, 1, 1971.

    Google Scholar 

  4. Oppenheim, A.V., Schafer, R.W., Digital Signal Processing, Prentice-Hall Inc., Engl. Cliffs, New Jersey.

    Google Scholar 

  5. Piccard, S., Sur les basis du groupe de symmetrique, Paris, 1946.

    Google Scholar 

  6. Kasabov, N.K., Bijev, G.T., Minimum Symmetrical Group Representation which Is Close to the Limited Compact One, Kibernetika, 3, 1980, p. 135 (in Russian).

    Google Scholar 

  7. Serre, J.P., Reprèsentations Linèaires des Groupes Finis, Herman, Paris, 1967.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Higher Institute of Mechanical and Electrical Engineering, 1156, Sofia, Bulgaria

    N. K. Kasabov, G. T. Bijev & B. J. Jechev

Authors
  1. N. K. Kasabov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. T. Bijev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. J. Jechev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Brauer P. Brinch Hansen D. Gries C. Moler G. Seegmüller J. Stoer N. Wirth Wolfgang Händler

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kasabov, N.K., Bijev, G.T., Jechev, B.J. (1981). Hierarchical discrete systems and realisation of parallel algorithms. In: Brauer, W., et al. Conpar 81. CONPAR 1981. Lecture Notes in Computer Science, vol 111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105133

Download citation

  • DOI: https://doi.org/10.1007/BFb0105133

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10827-6

  • Online ISBN: 978-3-540-38715-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation