Skip to main content
SpringerLink
Log in

Localization of edges in graph models of two-level algorithms

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

Multidimensional computational models of two-level algorithms are introduced and investigated. Transformations of graph models of the algorithms are developed, which allow one to obtain modified models without global edges. The modified graph models can be transformed by the well-known transformation and mapping procedures into one-, two-, and three-dimensional array processors without global interconnections.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. V. V. Voyevodin, Mathematical Models and Methods in Parallel Processes [in Russian], Nauka, Moscow (1986).

    Google Scholar 

  2. S.-Y. Kung, VLSI Array Processors, Prentice-Hall, Englewood Cliffs, New Jersey (1988).

    Google Scholar 

  3. Yu. S. Kanevskii, Systolic Processors [in Russian], Tekhnika, Kiev (1991).

    Google Scholar 

  4. P. Lee and Z. Kedem, “Synthesizing linear array algorithms from nested for loop algorithms” IEEE Trans. Comput., 37, No. 12, 1578–1598 (1988).

    Google Scholar 

  5. W. Shang and J. A. Fortes, “On time mapping of uniform dependence algorithms into lower dimensional processor arrays,” IEEE Trans. Paral. Distrib. Syst. 3, No. 31, 350–363 (1992).

    Article  Google Scholar 

  6. V. V. Kosianehouk, N. A. Likhoded, and P. I. Sobolevskii, “Systolic Architecture Array Synthesis,” Preprint Inst. Mat. AN Belarusi, No. 6 (484), Minsk (1992).

  7. N. A. Likhoded and A. A. Tiunchik, “Method of constructing parallel forms of algorithms based on locally parallel, globally sequential partition,” Kibern. Sist. Anal., No. 2, 28–42 (1996).

  8. W. Achtziger and K.-H. Zimmerman, “A branching linear programming approach for the mapping of systems ofn-dimensional affine recurrence ontok-dimensional systolic arrays,” Prepr. of the Institute of Applied Mathematics, No. 172, University of Erlangen-Nuremberg, Erlangen, Germany (1996).

    Google Scholar 

  9. A. A. Tiunchik, “Designing of multilevel systolic processors,” Dokl. NAN Belarusi,38, No. 4, 16–18 (1994).

    MATH  Google Scholar 

  10. A. A. Tiunchik, “Generalized approach to the design of VLSI array processors,” in: Proc. 7th Intern. Workshop on Parallel Processing by Cellular Automata and Arrays, Akademie Verlag, Berlin (1996), pp. 77–84.

    Google Scholar 

  11. R. M. Karp, R. E. Miller, and S. Winograd, “Organization of computations for uniform recurrence equations,” J. ACM,13, No. 3, 563–590 (1967).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, National Academy of Sciences of Belarus, Minsk, Belarus

    N. A. Likhoded, P. I. Sobolevskii & A. A. Tiunchik

Authors
  1. N. A. Likhoded
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. I. Sobolevskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. A. Tiunchik
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 63–71, November–December, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Likhoded, N.A., Sobolevskii, P.I. & Tiunchik, A.A. Localization of edges in graph models of two-level algorithms. Cybern Syst Anal 35, 895–902 (1999). https://doi.org/10.1007/BF02742281

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation