A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A utility accrual scheduling algorithm for real-time activities with mutual exclusion resource constraints
2006
IEEE transactions on computers
This paper presents a uni-processor real-time scheduling algorithm called the Generic Utility Scheduling algorithm (which we will refer to simply as GUS). GUS solves an open real-time scheduling problem -scheduling application activities that have time constraints specified using arbitrarily shaped time/utility functions, and have mutual exclusion resource constraints. A time/utility function is a time constraint specification that describes an activity's utility to the system as a function of
doi:10.1109/tc.2006.47
fatcat:qmjupqyxpnbgbeov7vqqtniyci