Stochastic, utility accrual real-time scheduling with task-level and system-level timeliness assurances

Author

Li, Peng ; Cho, Hyeonjoong ; Ravindran, Binoy ; Jensen, E. Douglas

Author_Institution

Microsoft Corp., Redmond, WA, USA

fYear

2005

fDate

18-20 May 2005

Firstpage

216

Lastpage

223

Abstract

Heuristic 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.

Keywords

real-time systems; scheduling; utility programs; accrued utility ratio; heuristic algorithm; stochastic scheduling; system-level accrued utility; task-level timeliness assurance; utility accrual real-time scheduling; Control systems; Heuristic algorithms; Object oriented modeling; Phased arrays; Programmable control; Real time systems; Scheduling algorithm; Stochastic systems; Time factors; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Object-Oriented Real-Time Distributed Computing, 2005. ISORC 2005. Eighth IEEE International Symposium on

Print_ISBN

0-7695-2356-0

Type

conf

DOI

10.1109/ISORC.2005.52

Filename

1420973

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3031098