Name
Abstract | ||
|---|---|---|
In this paper, we show that the hexagonal mesh networks developed in the early 1990s are a special case of the EJ networks that have been considered more recently. Using a node addressing scheme based on the EJ number system, we give a shortest path routing algorithm for hexagonal mesh networks. We also extend the known efficient one-to-all broadcasting algorithm on hexagonal mesh networks to algorithms for one-to-one personalized broadcasting, all-to-all broadcasting, and all-to-all personalized broadcasting algorithms. Their time complexity and optimality are analyzed. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TPDS.2011.112 | Parallel and Distributed Systems, IEEE Transactions |
Keywords | Field | DocType |
computational complexity,graph theory,multiprocessor interconnection networks,EJ network,EJ number system,all-to-all personalized broadcasting,communication algorithms,hexagonal mesh interconnection network,node addressing scheme,one-to-all broadcasting algorithm,one-to-one personalized broadcasting,shortest path routing algorithm,time complexity,EJ networks,Parallel processing,broadcasting,communication algorithms.,hexagonal mesh networks,interconnection networks | Broadcasting,Switched mesh,Mesh networking,Shortest path problem,Computer science,Algorithm,Computer network,Order One Network Protocol,Wireless mesh network,Time complexity,Shared mesh,Distributed computing | Journal |
Volume | Issue | ISSN |
23 | 1 | 1045-9219 |
Citations | PageRank | References |
18 | 0.69 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bader Albader | 1 | 21 | 1.43 |
| Bella Bosa | 2 | 1282 | 125.07 |
| Mary Flahive | 3 | 61 | 4.07 |