This paper addresses the combinatorial problem of constructing a minim
al cost, bused, interconnection among a set of modules (Or processors)
. Although some work has been reported on bused interconnection betwee
n modules, the compuational complexity of the problem has not Peen pre
viously 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.