Range-Chart-Guided Iterative Data-Flow Graph Scheduling

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

Volumn 39, Issue 5, 1992, Pages 351-364

  Heemstra De Groot, Sonia M ^a   Gerez, Sabih H ^a   Herrmann, Otto E ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--HEURISTIC; MATHEMATICAL TECHNIQUES--ITERATIVE METHODS; MATHEMATICAL TECHNIQUES--POLYNOMIALS; SIGNAL PROCESSING--DIGITAL TECHNIQUES;

INTRAITERATION/INTERITERATION; MAXIMUM-THROUGHPUT SCHEDULING; POLYNOMIAL-TIME HEURISTICS; QUALITY CRITERIA OPTIMIZATION; RANGE-CHART-GUIDED ITERATIVE DATA-FLOW GRAPH SCHEDULING; SCHEDULING ALGORITHMS;

COMPUTER PROGRAMMING;

EID: 0026867712     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/81.139286     Document Type: Article

References (32)

1. K. K. Parhi and D. G. Messerschmitt, “Static rate-optimal scheduling of iterative data-flow programs via optimum unfolding,” IEEE Trans, Computers, vol. 40, pp. 178–195, Feb. 1991.
2. E. A. Lee and D. G. Messerschmitt, “Static scheduling of synchronous data flow programs for digital signal processing,” IEEE Trans. Computers, vol. C-36, pp. 24–35, Jan. 1987.
3. E. A. Lee and D. G. Messerschmitt, “Synchronous data flow,” Proc. IEEE, vol. 75, pp. 1235–1245, Sept. 1987.
4. S. H. Lee and T. P. Barnwell, “A toplogical sorting and loop cleansing algorithm for a constrained MIMD compiler of shift-in-variant flow graphs,” in Proc. Int. Conf. Accoustics, Speech, Signal Processing, pp. 2927–2930, 1986.
5. D. A. Schwartz and T. P. Barnwell, “Cyclo-static multiprocessor scheduling on the optimal realization on shift-invariant flow graphs,” in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Processing, pp. 1384–1387, 1985.
6. K. R. Baker, Introduction to Sequencing and Scheduling. New York: Wiley, 1974.
7. J. Blazewicz, “Selected topics in scheduling theory,” in Surveys in Combinatorial Optimization, P. L. Hammer, Ed. Amsterdam: North-Holland, 1987, pp. 1–59.
8. W. A. Kohler, “A preliminary evaluation of the critical path method for scheduling tasks on multiprocessor systems,” IEEE Trans. Computers, vol. C-24, pp. 1235–1238, Dec. 1975.
9. D. A. Schwartz, “Synchronous multiprocessor realizations of shift invariant flow graphs,” Ph.D. dissertation, Georgia Institute of Technology, 1985.
10. S. M. Heemstra de Groot, “Scheduling techniques for iterative data-flow graphs, an approach based on the range chart,” Ph.D. dissertation, Univ. Twente, Faculty of Electrical Engineering, Dec. 1990.
11. S. M. Heemstra de Groot, and O. E. Herrmann, “Evaluation of some multiprocessor scheduling techniques of atomic operations for recursive DSP graphs,” in Proc. European Conf. Circuit Theory and Design, pp. 400–404, Sept. 1989.
12. M. Renfors and Y. Neuvo, “The maximum sampling rate of digital filters under speed constraints,” IEEE Trans. Circuits Syst., vol. CAS-28, pp. 196–202, Mar. 1981.
13. S. M. Heemstra de Groot, and O. E. Herrmann, “Rate-optimal scheduling of recursive DSP algorithms based on the scheduling range chart,” in Proc. IEEE Int. Symp. Circuits and Systems, pp. 1805–1808, May 1990.
14. A. Gibbons, Algorithmic Graph Theory. Cambridge, UK: Cambridge University Press, 1985.
15. E. A. Lee, “A coupled hardware and software architecture for programmable digital signal processors,” Ph.D. dissertation, Univ. California, Berkeley, 1986.
16. C. V. Ramamoorthy, K. M. Chandy, and M. J. Gonzalez, “Optimal scheduling strategies in a multiprocessor system,” IEEE Trans. Computers, vol. C-21, pp. 137–146, Feb. 1972.
17. P. G. Paulin and J. P. Knight, “Force-directed scheduling for the behavioral synthesis of ASIC’s,” IEEE Trans. Computer-Aided Design, vol. 8, pp. 661–679, June 1989.
18. R. I. Levin and C. A. Kirkpatrick, Planning and Control with PERT/CPM. New York: McGraw-Hill, 1966.
19. D. Landskov, S. Davidson, and B. Shriver, “Local microcode compaction techniques,” ACM Computing Surveys, vol. 12, pp. 261–294, Sept. 1980.
20. M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou, “The complexity of coloring circular arcs and chords,” SIAM J. Algebraic and Discrete Methods, vol. 1, pp. 216–227, June 1980.
21. S. M. Heemstra de Groot, and O. E. Herrmann, “Maximum-throughput scheduling with limited resources for iterative data-flow graphs by means of the scheduling-range chart,” in Proc. Euromicro Workshop on Real Time systems, pp. 8–16, 1990.
22. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, 1990.
23. W. L. Schiele, “On a longest path algorithm and its complexity if applied to the layout compaction problem,” in Proc. European Conf. Circuit Theory and Design, pp. 263–265, 1983.
24. S. H. Gerez, S. M. Heemstra de Groot, and O. E. Herrmann, “A polynomial-time algorithm for the computation of the iteration-period bound in recursive data-flow graphs,” Tech. Rep. EL-BSC-90N060. Univ. Twente, Faculty of Electrical Engineering, Apr. 1990.
25. Also in IEEE Trans. Circuits Syst. - I, pp. 49–52, Jan. 1992.
26. E. L. Lawler, Combinatorial Optimization: Networks and Matroids. New York: Holt, Rinehart and Winston, 1976.
27. M. Renfors and Y. Neuvo, “Fast multiprocessor realizations of digital filters,” in Proc. Int. Conf. Acoustics Speech, Signal Processing, pp. 916–919, 1980.
28. A. Fettweis, “Realizability of digital filter networks,” Archiv fur Elektronik und Ubertragungstechnik, vol. 30, pp. 90–96, 1976.
29. N. Park and A. Parker, “Sehwa: A program for synthesis of pipelines,” in Proc. 23rdDesign Automation Conf., pp. 454–460, 1986.
30. P. Dewilde, E. Deprettere, and R. Nouta, “Parallel and pipelined VLSI implementations of signal processing algorithms,” in S. Y. Kung, H. J. Whitehouse, and T. Kailath, Eds., VLSI and Modern Signal Processing. Englewood Cliffs, Prentice Hall, 1985, pp. 257–276.
31. J.-J. Hwang, Y.-C. Chow, F. D. Angers, and C.-Y. Lee, “Scheduling precedence graphs in systems with interprocessor communication times,” SIAM J. Computing, vol. 18, pp. 244–257, Apr. 1989.
32. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness. San Francisco, CA: W. H. Freeman, 1979.