Advertisement

Parallel conflict-free optimal access to complete extended q-ary trees

  • Reiner Creutzburg
Submitted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 342)

Abstract

In this paper we investigate the parallel conflict-free access to complete extended q-ary subtrees of complete q-ary trees. Thereby the memory module assignment function S is supposed to be recursively linear and nonlinear. Known results for extended binary subtree access are generalized to the case of extended q-ary subtrees. Furthermore optimal solutions for isotropic nonlinear extended q-ary subtree access are given.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Allen, J. R.: Anatomy of LISP. McGraw-Hill: New York 1978Google Scholar
  2. [2]
    Budnik, P., and D.J. Kuck: The organization and use of parallel memories. IEEE Trans. Comput. C-20 (1971), pp. 1566–1569Google Scholar
  3. [3]
    Creutzburg, R.: Parallel optimal subtree access with recursively linear memory function. Proc. PARCELLA'86 Berlin, (Eds.: T. Legendi, D. Parkinson, R. Vollmar, G. Wolf) Akademie-Verlag: Berlin 1986, pp. 203–209Google Scholar
  4. [4]
    Creutzburg, R.: Parallel linear conflict-free subtree access. Proc. Internat. Workshop Parallel Algorithms Architectures (Suhl 1987), (Eds.: A. Albrecht, H. Jung, K. Mehlhorn) Akademie-Verlag: Berlin 1987, pp. 89–96Google Scholar
  5. [5]
    Creutzburg, R.: Parallel conflict-free access to extended binary trees. (submitted for publication)Google Scholar
  6. [6]
    Gössel, M., and B. Rebel: Parallel memory with recursive address computation. Proc. Int. Conf. Parallel Computing'83 Berlin, (Ed.: M. Feilmeier) Elsevier: Amsterdam 1984, pp. 515–520Google Scholar
  7. [7]
    Gössel, M., and B. Rebel: Data structures and parallel memories. Proc. PARCELLA'86 Berlin, (Eds.: T. Legendi, D. Parkinson, R. Vollmar, G. Wolf) Akademie-Verlag, pp. 49–60Google Scholar
  8. [8]
    Gössel, M., and B. Rebel: Memories for parallel subtree access. Proc. Internat. Workshop Parallel Algorithms Architectures (Suhl 1987), (Eds.: A. Albrecht, H. Jung, K. Mehlhorn) Akademie-Verlag: Berlin 1987, pp. 122–130Google Scholar
  9. [9]
    Gössel, M., B. Rebel, and R. Creutzburg: Memory Architecture and Parallel Access. (in German). Akademie-Verlag: Berlin (in print)Google Scholar
  10. [10]
    Hockney, R. W., and C. R. Jesshope: Parallel Computers. Hilger: Bristol 1981Google Scholar
  11. [11]
    Horowitz, E., and S. Sahni: Fundamentals of Data Structures. Computer Science Press. Woodland Hills (Ca.) 1976Google Scholar
  12. [12]
    Knuth, D. E.: The Art of Computer Programming, Fundamental Algorithms. Addison-Wesley: Reading (MA) 1968Google Scholar
  13. [13]
    Kuck, D. J., and R. A. Stokes: The Burroughs scientific processor. IEEE Trans. Comput. C-31 (1982), pp. 363–376Google Scholar
  14. [14]
    Lawrie, D. H.: Access and alignment in an array processor. IEEE Trans. Comput. C-24 (1975), pp. 1145–1155Google Scholar
  15. [15]
    Lawrie, D. H., and Ch. R. Vora: The prime memory system for array access. IEEE Trans. Comput. C-31 (1982), pp. 435–442Google Scholar
  16. [16]
    Rebel, B., and M. Gössel: Ein paralleler Speicher. Report ZKI der AdW, Berlin, Nov. 1982Google Scholar
  17. [17]
    Shapiro, H. D.: Theoretical limitations on the use of parallel memories. Univ. Illinois, Dept. Comp. Sci., Rep. No. 75-776, Dec. 1975Google Scholar
  18. [18]
    Shirakawa, H.: On a parallel memory to access trees. Unpublished manuscript. (Ritsumeikan Univ., Kyoto, Japan, 1984)Google Scholar
  19. [19]
    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–505Google Scholar
  20. [20]
    Wijshoff, H. A. G.: Data organization in parallel computers. Ph.D. Diss. (Rijksuniv. Utrecht, Netherlands) 1987Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Reiner Creutzburg
    • 1
  1. 1.Academy of Sciences of the G.D.R. Central Institute of Cybernetics and Information ProcessesInternational Basic Laboratory for Image Processing and Computer GraphicsBerlin

Personalised recommendations