Formal results for precedence constrained, real-time scheduling of unit time tasks are extended to arbitrary timed tasks with preemp-tion. An exact characterisation of the EDF-like schedulers that can be used to transparently enforce precedence constraints among tasks is shown. These extended results are then integrated with a well-known protocol that handles real-time scheduling of tasks with ...

(1) S1 is consistent with the precedence structure of S2, and vice versa (No Metathesis). Let x, y ∈ S1 and x′, y′ ∈ S2. If x x′ and y y′, then x precedes (<) y iff x′ precedes (<) y′. • In other words, if a segment precedes another in the input, that precedence relation should be preserved by the corresponding segments in the output.3 • How many such relations exist in a word? • For a word of ...

We consider the polyhedral structure of the precedence constrained knapsack (PCK) problem, also known as the partially ordered knapsack problem. A set of items N is given, along with a partial order, or set of precedence relationships, on the items, denoted by S ⊆ N × N. A precedence relationship (i, j) ∈ S exists if item i can be placed in the knapsack only if item j is in the knapsack. Each i...

This informational draft presents results of a study on using different drop precedence assignments to address fairness issues when UDP and TCP traffic share the same Assured Forwarding (AF) PHB class. In particular, five different possible combinations of drop precedence assignment were explored with two different models of RED parameter settings. We present results showing that the type of RE...

The results of a study using different drop precedence assignments to address fairness issues when UDP and TCP traffic share the same Assured Forwarding (AF) PHB class in Differentiated Services are presented. Six different combinations of drop-precedence assignments were explored using two different models of RED parameter settings. Results indicate that the type of RED model utilized can play...

The general form of safe recursion (or ramified recurrence) can be expressed by an infinite graph rewrite system including unfolding graph rewrite rules introduced by Dal Lago, Martini and Zorzi, in which the size of every normal form by innermost rewriting is polynomially bounded. Every unfolding graph rewrite rule is precedence terminating in the sense of Middeldorp, Ohsaki and Zantema. Altho...