Computer Graphics & A Scheduling Algorithm for the Synthesis of a Pipelined Datapath using Collision Count


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 11, pp. 2973-2979, Nov. 1998
10.3745/KIPSTE.1998.5.11.2973,   PDF Download:

Abstract

As this paper is a scheduling algorithm for the synthesis of a pipelined datapath under resource constraints in high level synthesis, the proposed heuristic algorithm uses a priority function based on the collision count of resources. In order to schedule the pipelined datapath under resource constraints, we define the collision count and the priority function based on the collision count, a number of resource, and the mobility of operations to resolve a resource collision. the proposed algorithm supports chaining, multicycling, and structural pipelining to design the realistic hardware. The evaluation of the performance is compared with other systems using the results of the synthesis for a 16 point FIR filter and a 5th order elliptic wave filter, where in most cases, the optimal solution is obtained.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. D. Jin, Y. H. Jin, P. D. Soon, "Computer Graphics & A Scheduling Algorithm for the Synthesis of a Pipelined Datapath using Collision Count," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 11, pp. 2973-2979, 1998. DOI: 10.3745/KIPSTE.1998.5.11.2973.

[ACM Style]
Yu Dong Jin, Yoo Hee Jin, and Park Do Soon. 1998. Computer Graphics & A Scheduling Algorithm for the Synthesis of a Pipelined Datapath using Collision Count. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 11, (1998), 2973-2979. DOI: 10.3745/KIPSTE.1998.5.11.2973.