Conference Paper

Delay Analysis in Temperature-Constrained Hard Real-Time Systems with General Task Arrivals.

Michigan Univ., Dearborn, MI
DOI: 10.1109/RTSS.2006.16 Conference: Proceedings of the 27th IEEE Real-Time Systems Symposium (RTSS 2006), 5-8 December 2006, Rio de Janeiro, Brazil
Source: DBLP

ABSTRACT In this paper, we study temperature-constrained hard real- time systems, where real-time guarantees must be met with- out exceeding safe temperature levels within the proces- sor. Dynamic speed scaling is one of the major techniques to manage power so as to maintain safe temperature lev- els. As example, we adopt a simple reactive speed con- trol technique in our work. We design a methodology to perform delay analysis for general task arrivals under re- active speed control with First-In-First-Out (FIFO) sche- duling and Static-Priority (SP) scheduling. As a special case, we obtain a close-form delay formula for the leaky- bucket task arrival model. Our data show how simple reac- tive speed control can decrease the delay of tasks compared with any constant-speed scheme.

1 Bookmark
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this thesis, we study temperature-constrained multiprocessor real-time systems, where real-time guarantees must be met without exceeding safe temperature levels within the processors. We focus on Pfair scheduling algorithms, especially ERfair scheduling scheme (a work-conserving extension to Pfair scheduling) as our main multiprocessor real-time scheduling methodology. Then, we study the benefits of simple reactive speed scaling as described in the real-time multiprocessor systems. In this thesis, in support of the temperature-awareness, we extend the applicability of the reactive speed scaling to global scheduling schemes for multiprocessors. We propose temperature-aware scheduling and processor selection schemes motivated by existing (thermally non-optimal) ERfair scheduling in order to reduce thermal stress and therefore increase the processor utilization. Then, we show that the proposed algorithm and reactive scheme can enhance the processor utilization compared with any constant speed scheme on real-time multiprocessor systems. Additionally, we show how the maximum schedulable utilization (MSU) for partitioning heuristics can be determined on the temperature-constrained multiprocessor real-time systems.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: With the evolution of today’s semiconductor technology, chip temperature increases rapidly mainly due to the growth in power density. Therefore, for modern embedded real-time systems it is crucial to estimate maximal temperatures early in the design in order to avoid burnout and to guarantee that the system can meet its real-time constraints. This paper provides answers to a fundamental question: What is the worst-case peak temperature of a real-time embedded system under all feasible scenarios of task arrivals? A novel thermal-aware analytic framework is proposed that combines a general event/resource model based on network and real-time calculus with system thermal equations. This analysis framework has the capability to handle a broad range of uncertainties in terms of task execution times, task invocation periods, jitter in task arrivals, and resource availability. The considered model takes both dynamic and leakage power as well as thermal dependent conductivity into consideration. Thorough simulation experiments validate the theoretical results.
    Real-Time Systems 11/2013; · 0.55 Impact Factor
  • Source
    IEEE Trans. Industrial Informatics. 01/2010; 6:329-339.


Available from