Optimal vs. heuristic approaches to context scheduling for multi-context reconfigurable architectures

This paper describes a methodology to efficiently obtain a solution to the problem of context scheduling for multi-context reconfigurable architectures, regarding the minimization of context loading overhead. The target applications are assumed to be periodic since it is a typical feature of many DSP and multimedia applications. This work considers the trade-off between achievable system performance and algorithm efficiency It has been developed as a part of an automated design environment for reconfigurable systems.