Conflict-free template access in k-ary and binomial trees
ICS '97 Proceedings of the 11th international conference on Supercomputing
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
Multiple templates access of trees in parallel memory systems
Journal of Parallel and Distributed Computing - Parallel and distributed data structures
Assigning codes in wireless networks: bounds and scaling properties
Wireless Networks
New methods to color the vertices of a graph
Communications of the ACM
Latin Squares for Parallel Array Access
IEEE Transactions on Parallel and Distributed Systems
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
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
Channel Assignment with Separation for Interference Avoidance in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Conflict-free star-access in parallel memory systems
Journal of Parallel and Distributed Computing
Channel assignment for interference avoidance in honeycomb wireless networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Since the divergence between the processor speed and the memory access rate is progressively increasing, an efficient partition of the main memory into multibanks is useful to improve the overall system performance. The effectiveness of the multibank partition can be degraded by memory conflicts, that occur when there are many references to the same memory bank while accessing the same memory pattern. Therefore, mapping schemes are needed to distribute data in such a way that data can be retrieved via regular patterns without conflicts. In this paper, the problem of conflict-free access of arbitrary paths in bidimensional arrays, circular lists and complete trees is considered for the first time and reduced to variants of graph-coloring problems. Balanced and fast mappings are proposed which require an optimal number of colors (i.e., memory banks). The solution for bidimensional arrays is based on a particular Latin Square. The functions that map an array node or a circular list node to a memory bank can be calculated in constant time. As for complete trees, the mapping of a tree node to a memory bank takes time that grows logarithmically with the number of nodes of the tree. The problem solved here has further application in minimizing the number of frequencies assigned to the stations of a wireless network so as to avoid interference.