Utility Accrual Real-Time Scheduling under Variable Cost Functions

Balli, Umut; Wu, Hao; Ravindran, Binoy; Anderson, Jonathan; Jensen, E. Douglas

doi:10.1109/tc.2007.52

Cited by 16 publications

(9 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It may even assign a 3.0 GHz clocked CPU for 0.67 seconds and halts this CPU for the remaining time. We are confident that this degree of freedom will allow us to combine our scheduling approach with others, such as Jensen's TUF-based scheduling [13].…”

Section: Modes -A Heuristic For Utilitymentioning

confidence: 95%

The Potential of Energy/Utility-Accrual Scheduling

Hähnel

Völp

Döbel

et al. 2013

2013 27th International Conference on Advanced Information Networking and Applications Workshops

View full text Add to dashboard Cite

The long term vision of energy/utility accrual scheduling is to use all system resources in a way that is most beneficial to the system's users. For that, a mapping of user requests all the way down to system resources is required and, vice versa, the energy requirements of resources must be attributed to the corresponding user requests. However, despite the attractiveness of this general approach, the complexities involved in these translations are scary. Sketching our approach to energy/utility accrual scheduling, we argue in this paper that many complexities of traditional power models can be avoided if we consider the potential of a resource to generate utility rather than the utility generating operation. Introducing modes for the resources CPU and network, we found that the energy required to keep these resources operational is a good approximation of their overall energy demand.

show abstract

Section: Modes -A Heuristic For Utilitymentioning

confidence: 95%

The Potential of Energy/Utility-Accrual Scheduling

Hähnel

Völp

Döbel

et al. 2013

2013 27th International Conference on Advanced Information Networking and Applications Workshops

View full text Add to dashboard Cite

show abstract

“…Psychometrics have also been presented in the form of utility functions [15], [23]- [25]. The usefulness of a received data item is considered to be a function of the waiting time that is required to become available.…”

Section: Related Workmentioning

confidence: 99%

Optimal Periodic Scheduling Under Multimodel Per-Item Constraints in Wireless Systems

Liaskos

Papadimitriou

2012

IEEE Trans. Syst., Man, Cybern. C

View full text Add to dashboard Cite

A novel periodic scheduling scheme for wireless environments is presented. The proposed scheme enables quality of service (QoS) agreements per data item, contrary to the per-dataset approach of existing solutions. Constraints abiding by any of the existing models (impatience, utility, and waiting time) are allowed to exist concurrently. The impact of individual agreements on the system's performance as a whole is analytically studied and quantified. Comparison with related approaches rendered the proposed scheme optimally efficient and flexible enough to serve as a basis for the implementation of specialized QoS metrics as well.Index Terms-Periodic push, quality of service (QoS), wireless systems.

show abstract

“…These cover a wide range of problem spaces: from processor scheduling [55,31,22,50,51,52,27]; to memory management and garbage collection [28,23,34]; to non-blocking synchronization [22,24,26]; to energy management [72,73,7,74]; to packet scheduling [69,70]; and to network routing [19,20,62]; They also cover step TUFs [31]; to non-step TUFs [22,24,26,69,72,19,62]; to abitrarilyshaped TUFs [50].…”

Section: Timeliness Modelmentioning

confidence: 99%

On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors

Garyali¹,

Dellinger²,

Ravindran³

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We consider the problem of scheduling real-time tasks on a multiprocessor system. Our primary focus is scheduling on multiprocessor systems where the total task utilization demand, U , is greater than m, the number of processors on a multiprocessor system-i.e., the total available processing capacity of the system. When U > m, the system is said to be overloaded; otherwise, the system is said to be underloaded. While significant literature exists on multiprocessor real-time scheduling during underloads, little is known about scheduling during overloads, in particular, in the presence of task dependencies-e.g., due to synchronization constraints. We consider real-time tasks that are subject to time/utility function (or TUF) time constraints, which allow task urgency to be expressed independently of task importance-e.g., the most urgent task being the least important. The urgency/importance decoupling allowed by TUFs is especially important during overloads, when not all tasks can be optimally completed. We consider the timeliness optimization objective of maximizing the total accrued utility and the number of deadlines satisfied during overloads, while ensuring task mutual exclusion constraints and freedom from deadlocks. This problem is NP-hard. We develop a class of polynomial-time heuristic algorithms, called the Global Utility Accrual (or GUA) class of algorithms.The algorithms construct a directed acyclic graph representation of the task dependency relationship, and build a global multiprocessor schedule of the zero in-degree tasks to heuristically maximize the total accrued utility and ensure mutual exclusion. Potential deadlocks are detected through a cycle-detection algorithm, and resolved by aborting a task in the deadlock cycle. The GUA class of algorithms include two algorithms, namely, the Non-Greedy Global Utility Accrual (or NG-GUA) and Greedy Global Utility Accrual (or G-GUA) algorithms. NG-GUA and G-GUA differ in the way schedules are constructed towards meeting all task deadlines, when possible to do so. We establish several properties of the algorithms including conditions under which all task deadlines are met, satisfaction of mutual exclusion constraints, and deadlock-freedom.We create a Linux-based real-time kernel called ChronOS for multiprocessors. ChronOS is extended from the PREEMPT RT real-time Linux patch, which provides optimized interrupt service latencies and real-time locking primitives. ChronOS provides a scheduling framework for the implementation of a broad range of real-time scheduling algorithms, including utility accrual, non-utility accrual, global, and partitioned scheduling algorithms.We implement the GUA class of algorithms and their competitors in ChronOS and conduct experimental studies. The competitors include G-EDF, G-NP-EDF, G-FIFO, gMUA, P-EDF and P-DASA. Our study reveals that the GUA class of algorithms accrue higher utility and satisfy greater number of deadlines than the deadline-based scheduling algorithms by as much as 750% and 600%, respectively. In addition, ...

show abstract

Utility Accrual Real-Time Scheduling under Variable Cost Functions

Cited by 16 publications

References 26 publications

The Potential of Energy/Utility-Accrual Scheduling

The Potential of Energy/Utility-Accrual Scheduling

Optimal Periodic Scheduling Under Multimodel Per-Item Constraints in Wireless Systems

On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors

Contact Info

Product

Resources

About