Artificial Intelligence
Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors
IEEE Transactions on Computers
A family of Cayley graphs on the hexavalent grid
Discrete Applied Mathematics
Complete rotations in Cayley graphs
European Journal of Combinatorics
Minimal Routing in the Triangular Grid and in a Family of Related Tori
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Performance simulations of moving target search algorithms
International Journal of Computer Games Technology - Artificial Intelligence for Computer Games
The GCA-w Massively Parallel Model
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
| Hi-index | 0.00 |
This paper describes an efficient novel router on the 6-valent triangular grid with toroidal connections, denoted "T-grid" in the sequel. The router uses six channels per node that can host up to six agents. The topological properties of the T-grid are given first, as well as a minimal routing scheme, as a basis for a Cellular Automata modeling of this new target searching problem. Each agent situated on a channel has a computed "minimal" direction defining the new channel in the adjacent node. When moving to the next node an agent can simultaneously hop to another channel. In the normal protocol the rightmost subpath (from the agent's point of view) is taken first. In addition, an adaptive routing protocol is defined, preferring the direction to an unoccupied channel. The novel router is significantly faster than an optimized reference router with only one agent per node that was designed before. In order to avoid deadlocks, the initial setting of the channels are alternated in space.