Memories for parallel subtree-access
Proc. of an international workshop on Parallel algorithms and architectures
Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Conflict-free access to parallel memories
Journal of Parallel and Distributed Computing
Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
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
External memory algorithms
Coloring powers of planar graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Journal of Parallel and Distributed Computing
Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems
IEEE Transactions on Parallel and Distributed Systems
Data Organization in Parallel Computers
Data Organization in Parallel Computers
Introduction to Algorithms
Labeling Products of Complete Graphs with a Condition at Distance Two
SIAM Journal on Discrete Mathematics
Journal of Parallel and Distributed Computing
New bounds on a hypercube coloring problem
Information Processing Letters
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
IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Conflict-Free Access to Templates of Trees and Hypercubes in Parallel Memory Systems
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Neural network-based heuristic algorithms for hypergraph coloring problems with applications
Journal of Parallel and Distributed Computing - Special section best papers from the 2002 international parallel and distributed processing symposium
Graphs and Hypergraphs
A polyhedral approach for the equitable coloring problem
Discrete Applied Mathematics
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
Discrete Applied Mathematics
| Hi-index | 0.00 |
We study conflict-free data distribution schemes in parallel memories in multiprocessor system architectures. Given a host graph G, the problem is to map the nodes of G into memory modules such that any instance of a template type T in G can be accessed without memory conflicts. A conflict occurs if two or more nodes of T are mapped to the same memory module. The mapping algorithm should: (i) be fast in terms of data access (possibly mapping each node in constant time); (ii) minimize the required number of memory modules for accessing any instance in G of the given template type; and (iii) guarantee load balancing on the modules. In this paper, we consider conflict-free access to star templates, i.e., to any node of G along with all of its neighbors. Such a template type arises in many classical algorithms like breadth-first search in a graph, message broadcasting in networks, and nearest neighbor based approximation in numerical computation. We consider the star-template access problem on two specific host graphs--tori and hypercubes--that are also popular interconnection network topologies. The proposed conflict-free mappings on these graphs are fast, use an optimal or provably good number of memory modules, and guarantee load balancing.