Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access

Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems

IEEE Transactions on Parallel and Distributed Systems

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

Journal of Parallel and Distributed Computing

Mappings for Conflict-Free Access of Paths in Elementary Data Structures

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics

Toward a Universal Mapping Algorithm for Accessing Trees in Parallel Memory Systems

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium