Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults

@inproceedings{Regehr2002SchedulingTW,
  title={Scheduling Tasks with Mixed Preemption Relations for Robustness to Timing Faults},
  author={John Regehr},
  booktitle={RTSS},
  year={2002}
}
This paper introduces and shows how to schedule two novel scheduling abstractions that overcome limitations of existing work on preemption threshold scheduling. The abstractions are task clusters, groups of tasks that are mutually non-preemptible by design, and task barriers, which partition the task set into subsets that must be mapped to different threads. Barriers prevent the preemption threshold logic that runs multiple design-time tasks in the same runtime thread from violating… CONTINUE READING
Highly Cited
This paper has 115 citations. REVIEW CITATIONS

Topics

Statistics

01020'03'05'07'09'11'13'15'17
Citations per Year

116 Citations

Semantic Scholar estimates that this publication has 116 citations based on the available data.

See our FAQ for additional information.