Add to ORKGHeuristic algorithms have enjoyed increasing interests and success in the context of Utility Accrual (UA) scheduling. However, few analytical results, such as bounds on task-level and system-level accrued utilities are known. In this paper, we propose the S-UA algorithm that can provide probabilistic bounds on task-level accrued utilities. Lower bound on system-level accrued utility ratio (AUR) is also derived and maximized by S-UA.
Classical scheduling abstractions such as deadlines and priorities do not readily capture the comple...
We extend time/utility functions and utility accrual model with the concept of joint utility functio...
We present an energy-efficient, utility accrual, real-time scheduling algorithm called ReUA. ReUA co...
We present time/utility function (TUF) algorithms that provide probabilistic assurance on timeliness...
We present the first Utility Accrual (or UA) real-time scheduling algorithm for mul-tiprocessors, ca...
We present a uni-processor real-time scheduling algorithm called Resource-contrainted Utility Accrua...
This paper presents a uni-processor real-time scheduling algorithm called the Generic Utility Schedu...
We present an utility accrual real-time scheduling algorithm called VCUA, for tasks whose execution ...
In this paper, we propose a preemptive utility accrual scheduling(or PUAS) algorithm as an enhanceme...
This paper presents a uni-processor real-time scheduling algorithm called the Generic Utility Schedu...
In this paper, we proposed a preemptive utility accrual scheduling (or PUAS) algorithm to further ex...
We present a utility accrual real-time scheduling algorithm called CIC-VCUA, for tasks whose exe-cut...
In this paper, we proposed a Non-preemptive Utility Accrual Scheduling (or NUAS) algorithm that enha...
Time utility functions offer a reasonably general way to describe the complex timing constraints of ...
We present an energy-efficient, utility accrual, real-time scheduling algorithm called the Resource-...
Classical scheduling abstractions such as deadlines and priorities do not readily capture the comple...
We extend time/utility functions and utility accrual model with the concept of joint utility functio...
We present an energy-efficient, utility accrual, real-time scheduling algorithm called ReUA. ReUA co...
We present time/utility function (TUF) algorithms that provide probabilistic assurance on timeliness...
We present the first Utility Accrual (or UA) real-time scheduling algorithm for mul-tiprocessors, ca...
We present a uni-processor real-time scheduling algorithm called Resource-contrainted Utility Accrua...
This paper presents a uni-processor real-time scheduling algorithm called the Generic Utility Schedu...
We present an utility accrual real-time scheduling algorithm called VCUA, for tasks whose execution ...
In this paper, we propose a preemptive utility accrual scheduling(or PUAS) algorithm as an enhanceme...
This paper presents a uni-processor real-time scheduling algorithm called the Generic Utility Schedu...
In this paper, we proposed a preemptive utility accrual scheduling (or PUAS) algorithm to further ex...
We present a utility accrual real-time scheduling algorithm called CIC-VCUA, for tasks whose exe-cut...
In this paper, we proposed a Non-preemptive Utility Accrual Scheduling (or NUAS) algorithm that enha...
Time utility functions offer a reasonably general way to describe the complex timing constraints of ...
We present an energy-efficient, utility accrual, real-time scheduling algorithm called the Resource-...
Classical scheduling abstractions such as deadlines and priorities do not readily capture the comple...
We extend time/utility functions and utility accrual model with the concept of joint utility functio...
We present an energy-efficient, utility accrual, real-time scheduling algorithm called ReUA. ReUA co...