A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
Thara Angskun, George Bosilca, Bradley T. Vander Z...
In this paper, we propose a novel routing algorithm for maritime monitoring of short term events where large area monitoring relies on small buoys drifting along with local curren...
Pedro N. E. S. Barbosa, Neil M. White, Nick R. Har...
Dynamic routing can substantially enhance the quality of service for multiprocessor communication, and can provide intelligent adaptation of faulty links during run time. Implemen...
Terrence S. T. Mak, N. Pete Sedcole, Peter Y. K. C...
— Robust power distribution within available routing area resources is critical to chip performance and reliability. In this paper, we propose a novel and efficient method for o...
Hongyu Chen, Chung-Kuan Cheng, Andrew B. Kahng, Ma...