Affiliation:
1. Boston University, USA
Abstract
In this chapter, the problem of constructing minimal cycle-breaking connectivity preserving sets of turns for graphs that model regular or near regular multiprocessor systems, as a method to prevent deadlocks is investigated. Cycle-breaking provides for deadlock-free wormhole routing defined by turns prohibited at some nodes. The lower and upper bounds for minimal cardinalities of cycle-breaking connectivity preserving sets for several classes of graphs such as homogeneous meshes, p-ary n-cubes, cube-connected cycles, hexagonal and honeycomb meshes and tori, Hamiltonian graphs and others are obtained and presented along with some preliminary experimental results.