On the complexity of optimal bused interconnections
Priyalal D. Kulasinghe, A. El-Amawy · IEEE Transactions on Computers · 1995
This paper addresses the combinatorial problem of constructing a minimal cost, bused, interconnection among a set of modules (or processors). Although some work has been reported on bused interconnection between modules, the compuational complexity of the problem has not been previously addressed. We show that the optimization problem of finding a minimal cost interconnection among modules to realize a certain set of data transfers is NP-Hard.>