Optimal tree access by elementary and composite templates in parallel memory systems

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages

  Auletta, V ^a   Das, S K ^b   De Vivo, A ^a   Pinotti, M C ^c   Scarano, V ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

^c UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; ECONOMIC AND SOCIAL EFFECTS; FORESTRY; MAPPING; MEMORY ARCHITECTURE;

COMPLETE SUBTREE; COMPOSITE TEMPLATES; CONFLICT-FREE ACCESS; DISJOINT SUBSETS; MEMORY ADDRESSING; MEMORY CONFLICT; PARALLEL MEMORY; TREE DATA STRUCTURES;

TREES (MATHEMATICS);

EID: 84981214766     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.924972     Document Type: Conference Paper

References (12)

1. V. Auletta, S. Das, A. De Vivo, M.C. Pinotti, V. Scarano, "Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems". Technical Report Università di Salerno. Available at http://www.dia.unisa.it/auletta.dir/PUB/PAPERS/oect.ps.
2. V. Auletta, S. Das, A. De Vivo, M.C. Pinotti, V. Scarano, "Towards a Universal Mapping Algorithms for Accessing Trees in Parallel Memory Systems". Proc. of Intern. Parallel Processing Symp. (IPPS/SPDP), Orlando, USA, pp. 447-459, April 1998.
3. V. Auletta, A. De Vivo, V. Scarano, "Multiple Template Access of Trees in Parallel Memory Systems". Journal of Parallel and Distributed Computing vol. 49 n. 1, pp. 22-39, February 1998.
4. C.J. Colbourn, K. Heinrich, "Conflict-Free Access to Parallel Memories", Journal of Parallel and Distributed Computing, 14, pp. 193-200, 1992.
5. T. Comer, C. Leiserson, R. Rivest, "An Introduction to Algorithms", Mit Press, 1990.
6. R. Creutzburg, L. Andrews, "Recent Results on the Parallel Access to Tree-like Data Structures - The Isotropic Approach", Proc. of Int. Conference on Parallel Processing, Vol. 1, pp. 369-372, 1991.
7. S.K. Das, M.C. Pinotti, "Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates", Journal of Parallel and Distributed Computing, Vol. 60, n. 8, 2000, pp. 998-1027.
8. S.K. Das, M.C. Pinotti, and F. Sarkar, "Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes,", IEEE Trans. on Parallel and Distributed Systems, Vol. 7, No. 6, pp. 555-564, June 1996.
9. S.K. Das, F. Sarkar, "Conflict-Free Data Access of Arrays and Trees in Parallel Memory Systems", Proc. of 6th IEEE Symp. on Parallel and Distributed Processing 1994, Dallas (Texas) USA, pp. 377-383.
10. D. Kaznachey, A. Jagota and S. K. Das, "Primal-Target Neural Net Heuristics for the Hypergraph k-Coloring Problem," Proceedings of the International Conference on Neural Networks (ICNN'97), Houston, Texas, pp. 1251-1255, June 1997.
11. K. Kim, V.K. Prasanna, "Latin Squares for Parallel Array Access", IEEE Transactions on Parallel and Distributed Systems, vol.4, no.4, pp. 361-370, April 1993.
12. H.A.G. Wijshoff, "Storing Trees into Parallel Memories", Parallel Computing, Elsevier Science Publ., pp. 253-261, 1986.