Improving the Analysis of GPC in Real-Time Calculus

Real-Time Calculus (RTC) is a framework for modeling and performance analysis of real-time networked systems. In RTC, workload and resources are modeled as arrival and service curves, and processing semantics are modeled by abstract components. Greedy Processing Component (GPC) is one of the fundamental abstract components in RTC, which processes incoming events in a greedy fashion as long as there are available resources. The relations between inputs and outputs of GPC have been established, which are consistent with its behaviors. In this paper, we first revise the original proof of calculating output curves in GPC, and then propose a new method to obtain tighter output arrival curves. Experiment results show that the precision of output arrival curves can be improved by our method compared with the original calculation and existing work