Multiple Templates Access of Trees in Parallel Memory Systems

Journal of Parallel and Distributed Computing

Volumn 49, Issue 1, 1998, Pages 22-39

  Auletta, Vincenzo ^a   De Vivo, Amelia ^a   Scarano, Vittorio ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002435314     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1998.1426     Document Type: Article

References (18)

1. Auletta V., Das S. K., De Vivo A., Pinotti M. C., Scarano V. Toward a universal mapping algorithm for accessing trees in parallel memory systems. Proceedings of IEEE 12th Joint International Parallel Processing Symposium and Symposium on Parallel and Distributed Computing (IPPS/SPDP). 1998;IEEE Comput. Soc. Press, Los Alamitos.
2. Atallah M. J., Goodrich M. T., Ramaiyer K. Biased finger trees and three-dimensional layers of maxima. Proc. of Symp. on Computational Geometry. 1994.
3. Boppana R. V. On the effectiveness of interleaved memories for binary trees. Proc. of Architectures and Compilation Techniques for Fine and Medium Grain Parallelism (A-23). 1993;Elseviers, Amsterdam/New York. p. 203-214.
4. Colbourn C. J., Heinrich K. Conflict-free access to parallel memories. J. Parallel Distrib. Comput. 14:1992;193-200.
5. Creutzburg R., Andrews L. Recent results on the parallel access to tree-like data structures - The isotropic approach. Proc. of Int. Conference on Parallel Processing. 1991;. p. 369-372.
6. Das S. K., Pinotti M. C. Conflict-free template access ink-ary and binomial trees. Proc. of 11th ACM Intern. Conf. on Supercomputing. July 1997;. p. 237-244.
7. Das S. K., Pinotti M. C. Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access. Proc. of 5th Internat. Workshop on Algorithms and Data Structures (WADS). Lecture Notes in Computer Science. 1272:Aug. 1997;. p. 272-281.
8. Das S. K., Pinotti M. C., Sarkar F. Optimal and load balanced mapping of parallel priority queues in hypercubes. IEEE Trans. Parallel Distrib. Systems. 7:June 1996;555-564.
9. Das S. K., Sarkar F. Conflict-free data access of arrays and trees in parallel memory systems. Proc. of 6th IEEE Symp. on Parallel and Distributed Processing. 1994;. p. 377-383.
10. Das S. K., Sarkar F., Pinotti M. C. Conflict-Free Access of Trees in Parallel Memory Systems and Its Generalizations. Technical Report. Nov. 1994.
11. Das S. K., Sarkar F., Pinotti M. C. Conflict-free path access of trees in parallel memory systems with application to distributed heap implementation. Proc. of 24th International Conference of Parallel Processing. 1995;. p. 164-167.
12. Gössel M., Rebel B. Memories for parallel subtree access. Parallel Algorithms and Architectures. Lecture Notes in Computer Science. 299:1987;Springer-Verlag, Berlin/New York. p. 122-130.
13. Guibas L. J., McCreight E. M., Plass M. F., Roberts J. R. A new representation for linear lists. Proc. of 9th ACM Symp. on Theory of Computing. 1977;. p. 49-60.
14. Huddlestone S., Mehlhorn K. A new data structure for representing sorted lists. Acta Inform. 17:1982;157-184.
15. Lawrie D. H., Vora C. R. The prime memory system for array access. IEEE Trans. Comput. C-31:May 1982;435-441.
16. Kim K., Prasanna V. K. Latin squares for parallel array access. IEEE Trans. Parallel Distrib. Systems. 4:April 1993;361-370.
17. Kosaraju R. Localized search in sorted lists. Proc. of 13th Annual ACM Symp. on Theory of Computing. 1981;. p. 62-69.
18. Wijshoff H. A. G. Storing trees into parallel memories. Parallel Computing. 1986;Elsevier, Amsterdam/New York. p. 253-261.