Skip to main content
SpringerLink
Log in

A multimedia system for the investigation of mapping algorithms

  • 3. Computer Science
  • Conference paper
  • First Online:
Book cover High-Performance Computing and Networking (HPCN-Europe 1998)

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

Included in the following conference series:

  • 243 Accesses

Abstract

TOPAS (Test and Optimization of Parallel Algorithms and Structures), a programming tool for visualization, animation and investigation of algorithms of mapping graphs is presented. The tool is implemented in Java and can be accessed on W W W.

This work is supported by RFBR grant N96-01-01632

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. N. Mirenkov. VIM Language Paradigm, in: Lecture Notes in Computer Science, 854. B. Buchberger, J. Volkert (Eds.), Springer-Verlag, 1994, 569–580.

    Google Scholar 

  2. N. Mirenkov, T. Mirenkova, A VIM Film for Cellular Automation-like Algorithms, in: Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA'95, Athens, Georgia (USA), 1995, 616–625.

    Google Scholar 

  3. N. Mirenkov, T. Mirenkova, Program Synthesis from Film Specifications, in: Proc. of The Second Aizu International Symposium on Parallel Algorithms) Architecture Synthesis, Aizu-Wakamatsu, Japan, IEEE Press, 1997, 133–141.

    Google Scholar 

  4. N. Mirenkov, “Filmification” of Methods: Programming Technology for the 21-st Century, in: Proc. of the Second World Congress of Nonlinear Analysts, Elsevier Science, 1997.

    Google Scholar 

  5. S. Bridgeman, A. Gard, R. Tamassia, A graph drawing and translation service on the WWW, in: Graph Drawing'96 (Proc. GD'96). LNCS, vol. 1190, 1996, 45–52.

    Google Scholar 

  6. O.G. Monakhov, E.B. Grosbein. A parallel evolution algorithm for graph mapping problem, in:Proc. Inter. Workshop on Parallel Computation and Scheduling (PCS'97), CICESE, Ensenada, Baja California, Mexico, 1997, 1–21.

    Google Scholar 

  7. O.G. Monakhov, O.J. Chunikhin, Parallel mapping of program graphs into parallel computers by self-organization algorithm, in:Applied Parallel Computing (Proc. PARA'96). LNCS, vol.1184, 1996, 525–528.

    Google Scholar 

  8. O.G. Monakhov, Parallel mapping of parallel program graphs into parallel computers, in: Proc. Int. Conf. Parallel Computing-91, Elsevier Science Publishers, Amsterdam, 1992, 413–418.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Aizu, 965-80, Aizu-Wakamatsu City, Fukushima, Japan

    N. Mirenkov

  2. Instutute of Computational Mathematics and Mathematical Geophysics, Siberian Division of Russian Academy of Sciences, Pr. Lavrentieva, 6, 630090, Novosibirsk, Russia

    O. G. Monakhov & O. J. Chunikhin

Authors
  1. N. Mirenkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. O. G. Monakhov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. O. J. Chunikhin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Peter Sloot Marian Bubak Bob Hertzberger

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mirenkov, N., Monakhov, O.G., Chunikhin, O.J. (1998). A multimedia system for the investigation of mapping algorithms. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037201

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64443-9

  • Online ISBN: 978-3-540-69783-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation