Toward a universal mapping algorithm for accessing trees in parallel memory systems

Proceedings of the International Parallel Processing Symposium, IPPS

Volumn , Issue , 1998, Pages 447-454

  Auletta, Vincenzo ^a   Das, Sajal K ^a   De Vivo, Amelia ^a   Pinotti, M Cristina ^a   Scarano, Vittorio ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; SET THEORY; TREES (MATHEMATICS);

MAPPING ALGORITHMS; PARALLEL MEMORY SYSTEMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0031701133     PISSN: 10637133     EISSN: None     Source Type: None    
DOI: 10.1109/IPPS.1998.669955     Document Type: Conference Paper

References (17)

1. V. Auletta A. De Vivo V. Scarano Multiple Template Access of Trees in Parallel Memory Systems Proc. of Intern. Parallel Processing Symp. (IPPS) 694 701 Proc. of Intern. Parallel Processing Symp. (IPPS) Geneva Switzerland 1997-Apr
2. M. J. Atallah M. T. Goodrich K. Ramaiyer Biased Finger Trees and Three-Dimensional Layers of Maxima Proc. of Symp. on Computational Geometry Proc. of Symp. on Computational Geometry 1994
3. C. J. Colbourn K. Heinrich Conflict-Free Access to Parallel Memories Journal of Parallel and Distributed Computing 14 193 200 1992
4. 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 1 369 372 Proc. of Int. Conference on Parallel Processing 1991
5. S. K. Das M. C. Pinotti Conflict-Free Template Access in k-ary and Binomial Trees Proc. of 11th ACM Intern. Conf. on Supercomputing 237 244 Proc. of 11th ACM Intern. Conf. on Supercomputing Vienna Austria 1997-July
6. S. K. Das M. C. Pinotti Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access Proc. of 5th Intern. Workshop on Algorithms and Data Structures (WADS) 1272 272 281 Proc. of 5th Intern. Workshop on Algorithms and Data Structures (WADS) Halifax Canada 1997-Aug
7. S. K. Das M. C. Pinotti F. Sarkar Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes IEEE Trans. on Parallel and Distributed Systems 7 6 555 564 June 1996
8. 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 377 383 Proc. of 6th IEEE Symp. on Parallel and Distributed Processing 1994 Dallas USA Texas
9. S. K. Das F. Sarkar M. C. Pinotti Conflict-free Access of Trees in Parallel Memory Systems and Its Generalizations Nov 1994 CRPDC-94-21 Department of Computer Sciences, University of North Texas
10. S. K. Das F. Sarkar M. C. Pinotti Conflict-free Path Access of Trees in Parallel Memory Systems with Application to Distributed Heap Implementation Proc. of 24th International Conference of Parallel Processing III 164 167 Proc. of 24th International Conference of Parallel Processing 1995
11. L. J. Guibas E. M. McCreight M. F. Plass J. R. Roberts A New Representation for Linear Lists Proc. of 9th ACM Symp. on Theory of Computing 49 60 Proc. of 9th ACM Symp. on Theory of Computing 1977
12. S. Huddlestone K. Mehlhorn A New Data Structure for Representing Sorted Lists Acta Informatica 17 157 184 1982
13. D. H. Lawrie C. R. Vora The Prime Memory System for Array Access IEEE Transactions on Computers C-31 5 435 441 May 1982
14. D. Kaznachey A. Jagota S. K. Das PrimalTarget Neural Net Heuristics for the Hypergraph k-Coloring Problem Proceedings of the International Conference on Neural Networks (ICNN'97) 1251 1255 Proceedings of the International Conference on Neural Networks (ICNN'97) Houston Texas 1997-June
15. K. Kim V. K. Prasanna Latin Squares for Parallel Array Access IEEE Transactions on Parallel and Distributed Systems 4 4 361 370 April 1993
16. R. Kosaraju Localized Search in Sorted Lists Proc. of 13th Annual ACM Symp. on Theory of Computing 62 69 Proc. of 13th Annual ACM Symp. on Theory of Computing 1981
17. H. A. G. Wijshoff Parallel Computing 253 261 1986 Elsevier Science Publ. Storing Trees into Parallel Memories