Task assignment and scheduling under memory constraints

Abstract

Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constraints. The paper presents a new heuristic developed for task assignment and scheduling for such systems. These systems also have a large number of constraints of different nature, such as cost, execution time, memory capacity and limitations on resource usage. The heterogeneous constraints require new synthesis methods which will take them into account while searching for a valid solution. The heuristic presented in the paper is a part of the CLASS system (Constraint Logic Programming based System Synthesis).