Feedback control-based dynamic resource management in distributed real-time systems

  • Authors:
  • Tian He;John A. Stankovic;Michael Marley;Chenyang Lu;Ying Lu;Tarek Abdelzaher;Sang Son;Gang Tao

  • Affiliations:
  • Department of Computer Science, University of Virginia, 151 Engineer's Way, Charlottesville, VA 22904-4740, United States;Department of Computer Science, University of Virginia, 151 Engineer's Way, Charlottesville, VA 22904-4740, United States;Department of Computer Science, University of Virginia, 151 Engineer's Way, Charlottesville, VA 22904-4740, United States;Department of Computer Science, University of Virginia, 151 Engineer's Way, Charlottesville, VA 22904-4740, United States;Department of Computer Science, University of Virginia, 151 Engineer's Way, Charlottesville, VA 22904-4740, United States;Department of Computer Science, University of Virginia, 151 Engineer's Way, Charlottesville, VA 22904-4740, United States;Department of Computer Science, University of Virginia, 151 Engineer's Way, Charlottesville, VA 22904-4740, United States;Department of Computer Science, University of Virginia, 151 Engineer's Way, Charlottesville, VA 22904-4740, United States

  • Venue:
  • Journal of Systems and Software
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The resource management in distributed real-time systems becomes increasingly unpredictable with the proliferation of data-driven applications. Therefore, it is inefficient to allocate the resources statically to handle a set of highly dynamic tasks whose resource requirements (e.g., execution time) are unknown a prior. In this paper, we build a distributed real-time system based on the control theory, focusing on the computational resource management. Specifically, this work makes three important contributions. First, it allows the designer to specify the desired temporal behavior of system adaptation, such as the speed of convergence. This is in contrast to previous literature, specifying only steady-state metrics, e.g. the deadline miss ratio. Second, unlike QoS optimization approaches, our solution meets performance guarantees with no accurate knowledge of task execution parameters - a key advantage in a poorly modeled environment. Last, in contrast to ad hoc algorithms based on intuition and testing, we rigorously prove that our approach not only has excellent steady state behavior, but also meets stability, overshoot, and settling time requirements.