Data structures and parallel memory organization based on dyadic storage schemes | SpringerLink
Skip to main content
Springer Nature Link
Log in

Data structures and parallel memory organization based on dyadic storage schemes

  • General Methodologies
  • Chapter
  • First Online:
Recent Issues in Pattern Analysis and Recognition

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

  • 183 Accesses

Abstract

The projecting of the memory which has such non-conventional features as parallelism and multidimensionality of storage media, multiformativity of data access is the complex problem. Payment for the new memory features is a complication of hardware. In this respect the dyadic allocations give certain advantages over other solutions. They can serve as the basis for the development of parallel memories comprising relatively simple address units and switching networks. The simplicity and the regularity of the control circuits in memories based on the dyadic allocations permit to design the memory with programmable alloctions (structures).

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. Batcher, E. E.: The multidimensional access memory in STARAN. IEEE Trans. on Comput., Vol. C-26, pp. 174–177.

    Google Scholar 

  2. Budnick, P., Kuck, D. I.: The organization and use of parallel memories. IEEE Trans. Comput. C-20, 1971, pp. 1566–1569

    Google Scholar 

  3. Kaverznev, V. V., Metlitsky, E. A.: Multiformative data access memory, SU Patent No. 1043747, USSR, 1983 (in Russian)

    Google Scholar 

  4. Kaverznev, V. V., Metlitsky, E. A.: Multiformative data acces memory, SU Patent No. 1200341, USSR, 1985 (in Russian)

    Google Scholar 

  5. Lawrie, D. H., Vora, R.: The prime memory system for array access. IEEE Trans. Comput. C-31, 1982, pp. 435–442

    Google Scholar 

  6. Metlitsky, E. A., Kaverznev, V. V.: Parallel memory systems — Theory Design, Usage, Leningrade State University Press, Leningrade (in print, in Russian)

    Google Scholar 

  7. Rebel, B., Gössel, M., Ein paralleler Speicher, ZKI der AdW, Berlin, 1982

    Google Scholar 

  8. Shapiro, H. D.: Theoretical limitations on the efficient use of parallel memories, IEEE Trans. Comput. C-27, 1977, pp. 421–428

    Google Scholar 

  9. Shubnikov, A. V., Kopzik, V. A.: Symmetry in Science and Art. Nauka Publisher: Moscow, 1972 (in Russian)

    Google Scholar 

  10. Gössel, M., Rebel, B., Creutzburg, R.: Memory Architecture and Parallel Access. Akademie-Verlag: Berlin 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Leningrad Electrical Engineering Institute, 5, Popov street, 197022, Leningrad, U.S.S.R.

    Evgeny A. Metlitsky

Authors
  1. Evgeny A. Metlitsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Virginio Cantoni Reiner Creutzburg Stefano Levialdi G. Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Metlitsky, E.A. (1989). Data structures and parallel memory organization based on dyadic storage schemes. In: Cantoni, V., Creutzburg, R., Levialdi, S., Wolf, G. (eds) Recent Issues in Pattern Analysis and Recognition. Lecture Notes in Computer Science, vol 399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51815-0_53

Download citation

  • DOI: https://doi.org/10.1007/3-540-51815-0_53

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51815-0

  • Online ISBN: 978-3-540-46815-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation