Parallel algorithms for redundant precedence relations elimination in task systems

We present in this paper some properties of task graphs used in algorithm parallelization and study the problem of redundant precedence relations in the associated task systems. We then analyze the parallelization of three redundancy elimination algorithms based on the weak transitive closure of the precedence partial order. Optimal results on complexity, task assignment and processor scheduling are discussed in detail.