On Scheduling Policies for Streams of Structured Jobs

We study a class of scheduling problems which combines the structural aspects associated with task dependencies, with the dynamic aspects associated with ongoing streams of requests that arrive during execution. For this class of problems we develop a scheduling policy which can guarantee bounded accumulation of backlog for all admissible request streams. We show, nevertheless, that no such policy can guarantee bounded latency for all admissible request patterns, unless they admit some laxity.

• Type: Conference
• Year: 2008
• Where: FORMATS
• Authors: Aldric Degorre, Oded Maler
• Keywords: Admissible Request, Admissible Request Patterns, Admissible Request Streams, Formal Methods, FORMATS 2008