Login / Signup
Minimal, Deadlock Free and o(n) Space Memory Routing for k-ary n-cubes with Wraparound Connections.
M. B. Hadim
Ibrahima Sakho
Published in:
PDPTA (1995)
Keyphrases
</>
deadlock free
routing algorithm
space time
low dimensional
ad hoc networks
databases
data mining
nearest neighbor
sensor networks