Skip to main content
SpringerLink
Log in

A memory organization for parallel computers

  • Regular Papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

In this paper a computer memory system intended for storing an arbitrary sequence of multidimensional arrays is described. This memory system permits a parallel access to the cuts distinguished in the given array by fixing one of the coordinates and to the large set of parallelepipeds which are the same dimension subarrays of the given arrays.

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. Mead, C. and Conway, L., “Introduction to VLSI Systems,”Addison-Wesley Series on Computer Science, 1980.

  2. Van Voorhis, D. C. and Morrin, T. H., “Memory Systems for Image Processing,”IEEE Trans. on Computer, C-27, No. 2 pp. 113–125, 1978.

    Article  MATH  Google Scholar 

  3. Van Voorhis, D. C. and Morrin, T. H., “Memory Systems for Image Processing,”Working Paper 16/A45, IBM System Communication Division, Los Catos, CA, August, 1975.

    Google Scholar 

  4. Van Voorhis, D. C. and Morrin, T. H., United States Patent N3, 995, 253, November 30, 1976.

  5. Van Voorhis, D. C. and Morrin, T. H.: United States Patent N3, 996, 559, December 7, 1976.

  6. Van Voorhis D. C. and Morrin, T. H.: United States Patent N3, 938, 102, February 10, 1976.

  7. Maslow V. P., “Mathematical Aspects of Intergral Optics,”Preprint, Moscow, MIEM, 1983.

    Google Scholar 

  8. Kitsuregawa, M., Tanaka, H. and Moto-oka, T., “Application of Hash to Data Base Machine and Its Architecture,”New Generation Computing, Vol. 1, No. 1, pp. 63–74, 1983.

    Article  Google Scholar 

  9. Kitsuregawa, M., Tanaka H. and Moto-oka, T.: “GRACE: Relational Algebra Machine Based on Hash and Sort—Its Design Concepts,”Journal of Information Processing, Vol, 6, No. 3, pp. 148–155, 1983.

    Google Scholar 

  10. Kitsuregawa, M. et al., “Relational Algebra Machine Based on Hash and Sort,”IECEJ Technical Group Meeting EC81-35 [in Japanese], 1981.

  11. Cray Research, Inc., “Cray-1 Computer System Hardware Reference Manual”,Publ. N2240004, Bloomington, Minnesota, 1979.

  12. Nosenchuck, D. M., Littman, M. C. and Narayanan, A., “Architectural Overview of the Navier-Stokes Computer,”Rept. of C. S., Princeton Univ., August 18, 1984.

  13. Gajski, D., Kuck, D., Lawrie, D. and Sameh, A., “Cedar—A Large Scale Multiprocessor”,Rept. of C. S., Univ. of Illinois at Urbana Champain, 1983.

Download references

Author information

Authors and Affiliations

  1. Institute of Pure and Applied Mechanics, Academy of Sciences of the USSR, Siberian Branch, 630090, Novosibirsk, USSR

    F. A. Murzin

  2. Instiute of Automatics and Electrometrics, Academy of Sciences of the USSR, Siberian Branch, 630090, Novosibirsk, USSR

    V. A. Sluev

Authors
  1. F. A. Murzin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Sluev
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Murzin, F.A., Sluev, V.A. A memory organization for parallel computers. New Gener Comput 6, 3–18 (1988). https://doi.org/10.1007/BF03037502

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation