Distributed data-path synthesis on a network of workstations

Abstract

Presents a distributed data-path synthesis approach which taps into the vast and cheap computing power of the distributed computing environments. The synthesis program is based on a novel approach where all processors simultaneously generate optimal schedules and allocate data-paths for them using a simple but powerful set of binding algorithms. The experimental results show that the distributed synthesis approach is very effective for exploring the design space.<>