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

IEEE Transactions on Parallel and Distributed Systems

Volumn 13, Issue 4, 2002, Pages 399-412

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

^a IEEE   (Italy)

^b UNIVERSITY OF SALERNO   (Italy)

^c The University of Texas at Arlington   (United States)

^d UNIVERSITY OF TRENTO   (Italy)

Author keywords

Complete trees; Composite templates; Conflict free access; Elementary templates; Mapping scheme; Parallel memory system

Indexed keywords

COMPLETE TREES; COMPOSITE TEMPLATES; CONFLICT-FREE ACCESS; ELEMENTARY TEMPLATES; PARALLEL MEMORY SYSTEMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; INFORMATION RETRIEVAL SYSTEMS; STORAGE ALLOCATION (COMPUTER); THEOREM PROVING;

PARALLEL PROCESSING SYSTEMS;

EID: 0036530167     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.995820     Document Type: Article

References (18)

1. Towards a universal mapping algorithms for accessing trees in parallel memory systems
2. Optimal tree access by elementary and composite templates in parallel memory systems
3. Multiple template access of trees in parallel memory systems
4. Conflict-free access to parallel memories
5. Recent results on the parallel access to tree-like data structures-The isotropic approach
6. Conflict-free template access in k-Ary and binomial trees
7. Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
8. Optimal mappings of q-ary and binomial trees into parallel memory modules for east and conflict-free access to path and subtree templates
9. Optimal and load balanced mapping of parallel priority queues in hypercubes
10. Conflict-free data access of arrays and trees in parallel memory systems
11. Conflict-free path access of trees in parallel memory systems with application to distributed heap implementation
12. Parallel algorithms for priority queue operations
13. Primal-target neural net heuristics for the hypergraph k-coloring problem
14. Latin squares for parallel array access
15. Storing trees into parallel memories