Skip to main content
SpringerLink
Log in
Book cover

Parallel Algorithms and Architectures pp 89–96Cite as

Parallel linear conflict-tree subtree access

  • Communications
  • Conference paper
  • First Online:

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Budnik, P., and D.J. Kuck: The organization and use of parallel memories. IEEE Trans. Comput. C-20 (1971), pp.1566–1569

    Google Scholar 

  2. Shapiro,H.D.: Theoretical limitations on the use of parallel memories. Univ. Illinois, Dept. Comp. Sci., Rep. No. 75-776 Dec. 1975

    Google Scholar 

  3. Lawrie, D.H.: Access and alignment in an array processor. IEEE Trans. Comput. C-24 (1975), pp.1145–1155

    Google Scholar 

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

    Google Scholar 

  5. Rebel, B., and M. Gössel: Ein paralleler Speicher. Report ZKI der AdW, Berlin, Nov. 1982

    Google Scholar 

  6. Gössel,M., and B.Rebel: Parallel memory with recursive address computation. Proc. Conf. Parallel Computing '83 Berlin (Ed.: M.Feilmeier, Elsevier Sci. Publ. 1984), pp.515–520

    Google Scholar 

  7. Wijshoff, H.A.G., and J. van Leeuwen: The structure of periodic storage schemes for parallel memories. IEEE Trans. Comput. C-34 (1985), pp.501–505

    Google Scholar 

  8. Shirakawa,H.: On a parallel memory to access trees. Unpublished manuscript. 1984

    Google Scholar 

  9. Gössel, M., and B. Rebel: Data structures and parallel memories. Procees. PARCELLA'86 Berlin, Akademie-Verlag Berlin (1986), (Eds.:T. Legendi, D. Parkinson, R. Vollmar, G. Wolf), pp.49–60

    Google Scholar 

  10. Creutzburg, R.: Parallel optimal subtree access with recursively linear memory function. (ibid.) pp.203–209

    Google Scholar 

  11. Horowitz, E., and S. Sahni: Fundamentals of Data Structures. Computer Science Press. Woodland Hills (Ca.) 1976

    Google Scholar 

  12. Creutzburg, R.: Parallel access to tree-like data structures. (in preparation)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Central Institute of Cybernetics and Information Processes, Academy of Sciences, P.O.Box 1298, DDR - 1086, Berlin

    Reiner Creutzburg

Authors
  1. Reiner Creutzburg
    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

Creutzburg, R. (1987). Parallel linear conflict-tree 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_33

Download citation

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

  • 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