This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05)
Seattle, Washington
May 18-May 20
ISBN: 0-7695-2356-0
Peng Li, Microsoft Corporation, Redmond, WA
Hyeonjoong Cho, Virginia Tech, Blacksburg, VA
Binoy Ravindran, Virginia Tech, Blacksburg, VA
E. Douglas Jensen, The MITRE Corporation, Bedford, MA
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 tasklevel accrued utilities. Lower bound on system-level accrued utility ratio (AUR) is also derived and maximized by S-UA.
Citation:
Peng Li, Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen, "Stochastic, Utility Accrual Real-Time Scheduling with Task-Level and System-Level Timeliness Assurances," isorc, pp.216-223, Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.