Scheduling Precedence Task Graphs with Disturbances

Explore this paper's citation graph

Summary

This paper proposes a method based on the addition of some extra edges to protect the initial scheduling from performing badly due to system intrusion and provides an upper bound on the performance guarantee for the scheduling algorithms.

Type
article
Published
2003-07-01
Cited by
7
References
12
Access
Open access

Keywords

Computer science, Two-level scheduling, Fair-share scheduling, Distributed computing, Dynamic priority scheduling

References

Cited by

Related papers