• DOI:10.1109/TC.1987.1676939
Corpus ID: 9142822

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

@article{Dally1987DeadlockFreeMR,
  title={Deadlock-Free Message Routing in Multiprocessor Interconnection Networks},
  author={W. Dally and C. Seitz},
  journal={IEEE Transactions on Computers},
  year={1987},
  volume={C-36},
  pages={547-553}
}

W. Dally, C. Seitz

Published 1987

Computer Science

IEEE Transactions on Computers

A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into groups of virtual channels. This method is used to develop deadlock-free routing algorithms for k-ary n… CONTINUE READING

View on IEEE

authors.library.caltech.edu

Save to Library

Create Alert

Cite

Launch Research Feed