Generalized methodology for array processor design of real-time systems

Abstract

Many techniques and design tools have been developed for mapping algorithms t o array processors. LinearEmerging from the fact that real-time systems have tight timing requirements, we show that the set of alternative solutions is limited. Further, we show that under a certain set of constraints the solution set is independent of the problem size.In Sections 3 and 4 the branch-and-bound approach for the scheduling and projection problem is presented.Further, complexity issues are discussed in Section 5 and mapping to fixed size arrays is discussed in Section 6.