Optimal and efficient adaptation in distributed real-time systems with discrete rates

  • Authors:

  • Yingming Chen;Chenyang Lu;Xenofon D. Koutsoukos

  • Affiliations:

  • Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, USA 63130;Department of Computer Science and Engineering, Washington University in St. Louis, St. Louis, USA 63130;Department of EECS, Vanderbilt University, Nashville, USA 37235

  • Venue:
  • Real-Time Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many distributed real-time systems face the challenge of dynamically maximizing system utility and meeting stringent resource constraints in response to fluctuations in system workload. Thus, online adaptation must be adopted in face of workload changes in such systems. We present the MultiParametric Rate Adaptation (MPRA) algorithm for discrete rate adaptation in distributed real-time systems with end-to-end tasks. The key novelty and advantage of MPRA is that it can efficiently produce optimal solutions in response to workload variations caused by dynamic task arrivals and departures. Through offline preprocessing MPRA transforms an NP-hard utility optimization problem to the evaluation of a piecewise linear function of the CPU utilization. At run time MPRA produces optimal solutions by evaluating the function based on the CPU utilization. Analysis and simulation results show that MPRA maximizes system utility in the presence of varying workloads, while reducing the online computation complexity to polynomial time. The advantages of MPRA have been validated through the implementation in a real-time middleware system and experiments on a physical testbed.