Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees

Journal of Parallel and Distributed Computing

Volumn 62, Issue 8, 2002, Pages 1314-1333

  Bertossi, Alan A ^a   Pinotti, Cristina M ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (15)

1. Toward a universal mapping algorithm for accessing trees in parallel memory systems
2. Multiple template access of trees in parallel memory systems
3. On array storage for conflict-free memory access for parallel processors
4. Assigning codes in wireless networks: Bounds and scaling properties
5. Accounting for memory bank contention and delay in high-bandwidth multiprocessors
6. New methods to color the vertices of a graph
7. The organization and use of parallel memories
8. Load balanced mapping of data structures in parallel memory modules for fast and conflict-free template access
9. Parallel priority queues in distributed memory hypercubes
10. Conflict-free data access of arrays and trees in parallel memory systems
11. "Latin Squares and Their Applications"
12. Latin squares for parallel array access
13. Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
14. Conflict-free template access in k-ary and binomial trees
15. Theoretical limitations on the efficient use of parallel memories