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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Allen, J. R.: Anatomy of LISP. McGraw-Hill: New York 1978
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) Akademie-Verlag: Berlin 1986, 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) Akademie-Verlag: Berlin 1987, pp. 89–96
Creutzburg, R.: Parallel conflict-free access to extended binary trees. (submitted for publication)
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) Akademie-Verlag, pp. 49–60
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–130
Gössel, M., B. Rebel, and R. Creutzburg: Memory Architecture and Parallel Access. (in German). Akademie-Verlag: Berlin (in print)
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. Unpublished manuscript. (Ritsumeikan Univ., Kyoto, Japan, 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.: 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 paper
Cite this paper
Creutzburg, R. (1989). Parallel conflict-free optimal access to complete extended q-ary trees. In: Wolf, G., Legendi, T., Schendel, U. (eds) Parcella '88. Parcella 1988. Lecture Notes in Computer Science, vol 342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50647-0_115
Download citation
DOI: https://doi.org/10.1007/3-540-50647-0_115
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50647-8
Online ISBN: 978-3-540-46062-6
eBook Packages: Springer Book Archive