Real-Time Scheduling of Hierarchical Reward-Based Tasks

  • Authors:
  • Ming Zu;Albert M. K. Cheng

  • Affiliations:
  • -;-

  • Venue:
  • RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A reward-based task typically consists of a mandatorypart that must be accomplished before the given deadline,and an optional part that is associated with rewards forpartial completion. In this paper, we consider a hierarchicalframework of reward-based tasks. These types oftasks are characterized by positive rewards, tree-like order-dependencyand identical service times. We propose a near-optimalscheduling algorithm for such tasks under hard-realtime constraints. In our technique, tasks are pre-sortedby their potential rewards and real-time scheduling can beachieved with no prior knowledge of the hard deadlines.We also demonstrate how this approach could be utilizedfor uninterrupted transfer of multimedia in varying networkconditions, while delivering near-best results.