Efficiency improvements for force-directed scheduling

Force-directed scheduling, introduced by Paulin and Knight, is a technique which schedules operations under time constraints in order to achieve schedules with a minimum number of resources. The worst case time complexity of the algorithm is cubic in the number of operations. This is due to the computation of the changes in the distribution functions needed for the force calculations. We present an incremental way to compute the changes in the distribution functions, based on gradual time-frame reducrion. This reduces the time complexity of the algorithm to quadratic in the number of operations, without any loss in effectiveness or generality of the algorithm. Implementations show a substantial CPU-time reduction of force-directed scheduling, which is illustrated by means of some industrially relevant examples.

[1]  Emile H. L. Aarts,et al.  Improved force-directed scheduling , 1991, Proceedings of the European Conference on Design Automation..

[2]  Pierre G. Paulin,et al.  Force-directed scheduling for the behavioral synthesis of ASICs , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Pierre Gaston Paulin.  High-level synthesis of digital circuits using global scheduling and binding algorithms , 1988 .

[4]  T. Kailath,et al.  VLSI and Modern Signal Processing , 1984 .

[5]  Pierre G. Paulin,et al.  Force-Directed Scheduling in Automatic Data Path Synthesis , 1987, 24th ACM/IEEE Design Automation Conference.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Jos Huisken,et al.  PHIDEO: a silicon compiler for high speed algorithms , 1991, Proceedings of the European Conference on Design Automation..

[8]  A. Olah,et al.  Scheduling and allocation for the high-level synthesis of DSP algorithms by exploitation of data transfer mobility , 1992, CompEuro 1992 Proceedings Computer Systems and Software Engineering.

[9]  Alice C. Parker,et al.  The high-level synthesis of digital systems , 1990, Proc. IEEE.

[10]  Taewhan Kim,et al.  A scheduling algorithm for conditional resource sharing , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[11]  Donald E. Thomas,et al.  The combination of scheduling, allocation, and mapping in a single algorithm , 1991, DAC '90.

[12]  Phn Peter.  Motion-adaptive intraframe transform coding of video signals , 1989 .