Mappings for conflict-free access of paths in elementary data structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1858, Issue , 2000, Pages 351-361

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

^a UNIVERSITY OF TRENTO   (Italy)

^b ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; MAPPING;

BI-DIMENSIONAL ARRAYS; COMBINATORIAL OBJECTS; CONFLICT-FREE ACCESS; GRAPH COLORING PROBLEM; MEMORY CONFLICT; MEMORY PATTERNS; PROCESSOR SPEED; REGULAR PATTERNS;

TREES (MATHEMATICS);

EID: 23044520219     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44968-x_35     Document Type: Conference Paper

References (10)

1. V. Auletta, S. K. Das, M. C. Pinotti, and V. Scarano, "Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems", Proceedings of IEEE Int’l Parallel Processing Symposium, Orlando, pp. 447-454, Apr. 1998.
2. V. Auletta, A. De Vivo, V. Scarano, "Multiple Template Access of Trees in Parallel Memory Systems". Journal of Parallel and Distributed Computing, Vol. 49, 1998, pp. 22-39.
3. G.E. Blelloch, P.B. Gibbons, Y. Mattias and M. Zagha, "Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors", IEEE Trans. on Parallel and Distrib. Systems, Vol. 8, 1997, pp. 943-958.
4. S. K. Das and F. Sarkar, "Conflict-Free Data Access of Arrays and Trees in Parallel Memory Systems", Proc. of the Sixth IEEE Symposium on Parallel and Distributed Processing, Dallas, TX, Oct. 1994, pp. 377-384.
5. S. K. Das, F. Sarkar and M. C. Pinotti, "Parallel Priority Queues in Distributed Memory Hypercubes", IEEE Transactions on Parallel and Distributed Systems, Vol. 7, 1996, pp. 555-564.
6. S.K. Das and M.C. Pinotti, "Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access" Proc. 5th Int. Workshop on Algorithms and Data Structures (WADS’97) Halifax NS, Aug. 1997, LNCS 1272, (Eds. Dehne, Rau-Chaplin, Sack, Tamassia), pp. 272-281.
7. K. Kim, V.K. Prasanna, "Latin Squares for Parallel Array Access", IEEE Transactions on Parallel and Distributed Systems, Vol. 4, 1993, pp. 361-370.
8. S.T. McCormick, "Optimal Approximation of Sparse Hessians and its Equivalence to a Graph Coloring Problem", Mathematical Programming, Vol. 26, 1983, pp. 153-171.
9. M. C. Pinotti, S. K. Das, and F. Sarkar, "Conflict-Free Template Access in k-ary and Binomial Trees", Proceedings of ACM-Int’l Conference on Supercomputing, Wein, Austria, pp. 237-244, July 7-11, 1997.
10. H.D. Shapiro, "Theoretical Limitations on the Efficient Use of Parallel Memories", IEEE Trans. on Computers, Vol. 27, 1978, pp. 421-428.