Skip to main content
SpringerLink
Log in

Memories for parallel subtree-access

  • Communications
  • Conference paper
  • First Online:
Parallel Algorithms and Architectures

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

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. Budnik, P. and D. K. Kuck. The organization and use of parallel memories. IEEE Trans. Comp. C-20, 1566–1569 (1971).

    Google Scholar 

  2. Shapiro, D. H., Theoretical limitations on the use of parallel memories. Ph. D. Thesis, Dep. Comp. Sc. Univ. Illinois, UIUCDS-R-75-776 (1975).

    Google Scholar 

  3. Lawrie, D. H. and R. Vora. The prime memory system for array access. IEEE Trans. Comp. C-31, 435–442 (1982).

    Google Scholar 

  4. Voorhis, D. C. and T. H. Morrin, Memory system for image processing. IEEE Trans. Comp. C-27, 113–125 (1978).

    Google Scholar 

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

    Google Scholar 

  6. Gössel, M. and B. Rebel. Parallel memories with recursive address computation, Parallel Computing 83, ed. Feilmeier, M. Elsevier Sc. Publ. 1984. 515–520.

    Google Scholar 

  7. Gössel, M. and B. Rebel. Parallel memories for picture processing (in russ.) Isv. AN SSSR, Techniceskaja kibernetika, in press.

    Google Scholar 

  8. Maurer, H. A., Datenstrukturen und Programmierverfahren, Teubner-Verlag, Stuttgart, 1974.

    Google Scholar 

  9. Gössel, M. and B. Rebel, Data structures and parallel memories, Proc. Parcella 86, Berlin, Akademie-Verlag 1986, 49–60.

    Google Scholar 

  10. Shirakawa, H., On a parallel memory to access trees. unpublished manuscript 1984.

    Google Scholar 

  11. Creutzburg, R., Parallel optimal subtree access with recursively linear module assignment functions, Proc. Parcella 86, Berlin, Akademie-Verlag 1986, 203–209.

    Google Scholar 

  12. Wijshoff, H., Storing trees into parallel memories. Parallel computing 85, ed. Feilmeier, M. Elsevier Sc. Publ. 1986, 253–261.

    Google Scholar 

  13. Wijshoff, H. and J. v. Leeuwen. Arbitrary versus periodic storage schemes and tesselation of the plane using one type of polyomino. Inf. Control 62, 1–25 (1984).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ZKI der AdW, Kurstr. 33, DDR 1086, Berlin

    M. Gössel & B. Rebel

Authors
  1. M. Gössel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Rebel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andreas Albrecht Hermann Jung Kurt Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gössel, M., Rebel, B. (1987). Memories for parallel subtree-access. In: Albrecht, A., Jung, H., Mehlhorn, K. (eds) Parallel Algorithms and Architectures. Lecture Notes in Computer Science, vol 269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18099-0_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-18099-0_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47760-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation