Schedulability of event-driven code blocks in real-time embedded systems

approximate decision algorithms; control flow graph; demand-bound function; dynamic programming; event-driven code block schedulability; exact necessary sufficient conditions; hard real-time constraints; independently executing event-driven code blocks; network processors; nonpreemptive environment; pseudo-polynomial time algorithm; real-time embedded systems; schedulability analysis problem; dynamic programming; embedded systems; flow graphs; polynomial approximation; processor scheduling     «

approximate decision algorithms; control flow graph; demand-bound function; dynamic programming; event-driven code block schedulability; exact necessary sufficient conditions; hard real-time constraints; independently executing event-driven code blocks; network processors; nonpreemptive environment; pseudo-polynomial time algorithm; real-time embedded systems; schedulability analysis problem; dynamic programming; embedded systems; flow graphs; polynomial approximation; processor...     »