A schedulability algorithm for data flow, hard-real-time distributed programs

Abstract

Data Flow is a natural paradigm representing distributed programs able to express the data (and control) dependencies between composing entities (nodes). Our work concentrates on Data Flow programs having Hard-Real-Time constraints; we consider periodic programs but the method can also be applied to sporadic and aperiodic ones. We propose a method to find, if possible, a feasible execution time assignment for each program node in the system, given a heuristic mapping.