Abstract
The effects of false loops caused by resource sharing are described. When a separate controller and data path are constructed, two types of false loops can be distinguished: the ones that go through the controller and the ones that loop around in the data path. A model to detect both types of loop during the resource sharing phase is described. Based on this model an algorithm which prevents false loops in the combinatorial network to be constructed, while maintaining as much freedom as possible for the resource sharing, is described. Experiments show that the loop-free data-paths do not need more functional units than the ones that contain false loops.

This publication has 6 references indexed in Scilit: