Multidimensional Periodic Scheduling Model and Complexity

We discuss the multidimensional periodic scheduling problem, which originates from the design of high-throughput real-time digital signal processing systems. We introduce the concept of multidimensional periodic operations in order to cope with problems originating from loop hierarchies and explicit timing requirements. We present a model of the multidimensional periodic scheduling problem and show that this problem and two related sub-problems are NP-hard. Furthermore, we identify several special cases induced by practical situations. Some of these special cases are proven to be well-solvable. Finally, we present a sketch of a solution approach.

[1]  Wfj Wim Verhaegh,et al.  Multidimensional periodic scheduling , 1995 .

[2]  Ed F. Deprettere,et al.  Systolic array implementation of nested loop programs , 1990, [1990] Proceedings of the International Conference on Application Specific Array Processors.

[3]  A. van der Wed.  PHIDEO: A Silicon Compiler for High Speed Algorithms , 1991 .

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

[5]  Miodrag Potkonjak,et al.  A Scheduling and Resource Allocation Algorithm for Hierarchical Signal Flow Graphs , 1989, 26th ACM/IEEE Design Automation Conference.

[6]  Edward A. Lee,et al.  Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing , 1989, IEEE Transactions on Computers.

[7]  Alice C. Parker,et al.  Sehwa: a software package for synthesis of pipelines from behavioral specifications , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Jan Karel Lenstra,et al.  Periodic Multiprocessor Scheduling , 1991, PARLE.

[9]  H.J. De Man,et al.  Modeling data flow and control flow for high level memory management , 1992, [1992] Proceedings The European Conference on Design Automation.

[10]  William Pugh,et al.  The Omega test: A fast and practical integer programming algorithm for dependence analysis , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[11]  Emile H. L. Aarts,et al.  Improved force-directed scheduling in high-throughput digital signal processing , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..