Abstract
In this paper the parallel conflict-free access to complete extended binary subtrees of complete binary trees is investigated. Thereby linear and also nonlinear memory module assignment functions S are considered. Furthermore, the problem of optimal parallel access to extended binary trees is solved.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Andrews, L.: On parallel isotropic conflict-free access to tree-like data structures. Diploma work, Humboldt-University Berlin, Dept. Mathematics, June 1989
Allen, J. R.: Anatomy of LISP. McGraw-Hill: New York 1978
Barnes, G. H. et. al.: The ILLIAC IV computer. IEEE Trans. Comput. C-17 (1968), pp. 746–757
Batcher, K. E.: STARAN parallel processor system hardware. Proc. Fall Joint Computer Conf. AFIPS Conf., AFIPS Press, 43, 1974, pp. 405–410
Budnik, P., and D. J. Kuck: The organization and use of parallel memories. IEEE Trans. Comput. C-20 (1971), pp. 1566–1569
Creutzburg, R.: Parallel optimal subtree access with recursively linear memory function. Proc. PARCELLA '86 Berlin, (Eds.: T. Legendi, D. Parkinson, R. Vollmar, G. Wolf) North-Holland: Amsterdam 1987, pp. 203–209
Creutzburg, R.: Parallel linear conflict-free subtree access. Proc. Internat. Workshop Parallel Algorithms Architectures (Suhl 1987), (Eds.: A. Albrecht, H. Jung, K. Mehlhorn) Lecture Notes in Computer Science 269 Springer: Berlin 1987, pp. 89–96
Creutzburg, R.: Parallel conflict-free access to extended binary trees. Preprint, Berlin 1988
Creutzburg, R.: Parallel conflict-free optimal access to complete extended q-ary trees. Proc. PARCELLA '88 (Eds. G. Wolf, T. Legendi, U. Schendel), Lecture Notes in Computer Science 342, Springer: Berlin 1989, pp.248–255.
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–520
Gőssel, M., and B. Rebel: Data structures and parallel memories. Proc. PARCELLA '86 Berlin, (Eds.: T. Legendi, D. Parkinson, R. Vollmar, G. Wolf) North-Holland: Amsterdam 1987, pp. 49–60
Gőssel, M., and B. Rebel: Memories for parallel subtree access. Proc. Intern. Worksh. Parall. Algorithms Architect. (Suhl 1987), (Eds.: A. Albrecht, H. Jung, K. Mehlhorn) Lect. Notes Comp. Science 269, Springer: Berlin 1987, pp. 122–130
Gőssel, M., B. Rebel, and R. Creutzburg: Memory Architecture and Parallel Access (in German). Akademie-Verlag: Berlin 1989 (English translation in preparation)
Hockney, R. W., and C. R. Jesshope: Parallel Computers. Hilger: Bristol 1981
Horowitz, E., and S. Sahni: Fundamentals of Data Structures. Computer Science Press. Woodland Hills (Ca.) 1976
Knuth, D. E.: The Art of Computer Programming, Fundamental Algorithms. Addison-Wesley: Reading (MA) 1968
Kuck, D. J., and R. A. Stokes: The Burroughs scientific processor. IEEE Trans. Comput. C-31 (1982), pp. 363–376
Lawrie, D. H.: Access and alignment in an array processor. IEEE Trans. Comput. C-24 (1975), pp. 1145–1155
Lawrie, D. H., and Ch. R. Vora: The prime memory system for array access. IEEE Trans. Comput. C-31 (1982), pp. 435–442
Rebel, B., and M. Gőssel: Ein paralleler Speicher. Report ZKI der AdW, Berlin, Nov. 1982
Shapiro, H. D.: Theoretical limitations on the use of parallel memories. Univ. Illinois, Dept. Comp. Sci., Rep. No. 75–776 Dec. 1975
Shirakawa, H.: On a parallel memory to access trees. Memoirs of Research Institute of Science and Engineering of Ritsumeikan University Kyoto, Japan, No. 46 (1987), pp. 57–62 (same as unpublished report of 1984)
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
Wijshoff, H. A. G.: Storing trees into parallel memories. Proc. 1985 Int. Conf. Parallel Computing, (Eds.: M. Feilmeier, J. Joubert, U. Schendel) Elsevier: Amsterdam 1986, pp. 253–261
Wijshoff, H. A. G.: Data organization in parallel computers. Ph.D. Diss. (Rijksuniv. Utrecht, Netherlands) 1987
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Creutzburg, R., Andrews, L. (1989). Optimal parallel conflict-free access to extended binary trees. 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_55
Download citation
DOI: https://doi.org/10.1007/3-540-51815-0_55
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