The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—In this paper, we present some novel algorithms for scheduling hierarchical signal flow graphs in the domain of high-level synthesis. With complex chips that need to be designed in the future, it is expected that the runtimes of these scheduling algorithms will be quite large. The key contributions of this paper are as follows: First, we develop a novel extension of the sequential force-directed scheduling algorithm which naturally handles loops and conditionals by coming up with a scheme of scheduling <it>hierarchical</it> signal flow graphs. Second, we develop three new parallel algorithms for the scheduling problem. Our parallel algorithms are portable across a wide range of parallel platforms. We report results on a set of high-level synthesis benchmarks on 8-processor SGI Origin and a 64 processor IBM SP-2. While some parallel algorithms for VLSI CAD reported by earlier researchers have reported a loss of qualities of results, our parallel algorithms produce exactly the same results as the sequential algorithms on which they are based.</p>
High-level synthesis, force-directed scheduling, hierarchical graphs, parallel algorithms, multiprocessors.

P. Banerjee and P. Prabhakaran, "Parallel Algorithms for Force Directed Scheduling of Flattened and Hierarchical Signal Flow Graphs," in IEEE Transactions on Computers, vol. 48, no. , pp. 762-768, 1999.
93 ms
(Ver 3.3 (11022016))