Delay analysis of bursty tasks using workload arrival functions

Abstract

A real-time application must satisfy timing requirements meaning that hard deadlines must be enforced. It is largely dependent on the defined resources and workload characteristics. In large-scale distributed real-time systems, the decomposed and the integrated methodologies with variable workloads are introduced. However, these methodologies have some limitations when they are applied to task systems instead of traffic. In this thesis, we propose that the end-to-end delay computed by the decomposed method relies on various arrival workloads and the integrated analysis performs with bursty tasks traversing a subsystem. In addition, we integrate these techniques into ProTex, a toolkit for the end-to-end schedulability analysis of large-scale distributed real-time systems.