Browse > Article

An Optimal ILP Scheduling Algorithm on Linear Data-Flow Graph for Multiprocessor Design  

Kim Ki-Bog (Department of Computer Science, Semyung University)
Lin Chi-Ho (Department of Computer Science, Semyung University)
Publication Information
Journal of the Institute of Electronics Engineers of Korea SD / v.42, no.6, 2005 , pp. 49-58 More about this Journal
Abstract
In this paper, we propose an optimal ILP scheduling algorithm for multiprocessor design on LDFG(Linear Data-Flow Graph) that can be represented by homogeneous synchronous data-flow. The proposed computation in this paper does not contain data-dependent, all scheduling decisions for such algorithms can be taken at compile time, only fully static overlapped schedules are considered. It means that all linear have the same schedule and the same processor assignment. In this paper, the resource-constrained problem is addressed, for the LDFG optimization for multiprocessor design problem formulating ILP solution available to provide optimal solution. The results show that the scheduling method is able to find good quality schedules in reasonable time.
Keywords
ILP; LDFG; Scheduling; Multiprocessor; Overlapped; Constraints;
Citations & Related Records
연도 인용수 순위
  • Reference
1 V. K. Madisetti, VLSI Digital Signal Processors, An Introduction to Rapid Prototyping and Design Synthesis, IEEE Press and Butterworth Heinemann, Boston, 1995
2 J. Sanchez and H. Barral, 'Multiprocessor implementation models for adaptive algorithms,' IEEE Transactions on Signal Processing, vol. 44, no. 9, pp. 2319-2331, September 1996   DOI   ScienceOn
3 S. H. Gerez, S.M. Heemstra de Groot, E.R. Bonsma, and M.J.M. Heijligers, 'Overlapped scheduling techniques for high-level synthesis and multiprocessor realizations of DSP algorithms,' in Advanced Techniques for Embedded System Design and Test, J.C. Lopez, R. Hermida, and W. Geisselhardt, Eds., pp. 125-150
4 S.M. Heemstra de Groot, S.H. Gerez, and O.E. Herrmann,'Range-chart-guided iterative data-flow- graph scheduling,' IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 39, pp. 35-{364, May 1992   DOI
5 K. K. Parhi and D.G. Messerschmitt, 'Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding, 'IEEE Transactions on Computers, vol. 40, no. 2, pp. 178-195, February 1991. PROGRESS 2000 Workshop on Embedded Systems, Utrecht, The Netherlands, October 2000.8   DOI   ScienceOn
6 S. Sriram and S.S. Bhattacharyya, Embedded Multiprocessors, Scheduling and Synchronization, Marcel Dekker, New York, 2000
7 D.C. Chen and J.M. Rabaey, 'A reconfigurable multiprocessor IC for rapid prototyping of algorithmic-specific high-speed DSP data paths,' IEEE Journal of Solid-State Circuits, vol. 27, no.12, pp. 1895-1904, December 1992   DOI   ScienceOn
8 T.F. Lee, A.C.H. Wu, Y.L. Lin, and D.D. Gajski, 'A transformation-based method for loop folding,' IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 13, no. 4,pp. 439-450, April 1994   DOI   ScienceOn
9 G. Goossens, J. Rabaey, J. Vandewalle, and H. De Man, 'An efficient microcode compiler for application specific DSP processors,' IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 9, no. 9, pp. 925-937, September 1990   DOI   ScienceOn
10 E. A. Lee and D.G. Messerschmitt, 'Synchronous data flow, 'Proceedings of the IEEE, vol.75, no.9, pp. 1235-1245, September 1987   DOI