Please use this identifier to cite or link to this item:
Title: Generalized finitary real-time calculus
Authors: Lampka, K
Bondorf, S
Schmitt, JB
Guan, N 
Yi, W
Issue Date: 2017
Publisher: Institute of Electrical and Electronics Engineers Inc.
Source: Proceedings - IEEE INFOCOM, 2017, 8056981 How to cite?
Abstract: Real-time Calculus (RTC) is a non-stochastic queuing theory to the worst-case performance analysis of distributed real-time systems. Workload as well as resources are modelled as piece-wise linear, pseudo-periodic curves and the system under investigation is modelled as a sequence of algebraic operations over these curves. The memory footprint of computed curves increases exponentially with the sequence of operations and RTC may become computationally infeasible fast. Recently, Finitary RTC has been proposed to counteract this problem. Finitary RTC restricts curves to finite input domains and thereby counteracts the memory demand explosion seen with pseudo periodic curves of common RTC implementations. However, the proof to the correctness of Finitary RTC specifically exploits the operational semantic of the greed processing component (GPC) model and is tied to the maximum busy window size. This is an inherent limitation, which prevents a straight-forward generalization. In this paper, we provide a generalized Finitary RTC that abstracts from the operational semantic of a specific component model and reduces the finite input domains of curves even further. The novel approach allows for faster computations and the extension of the Finitary RTC idea to a much wider range of RTC models.
Description: 2017 IEEE Conference on Computer Communications, INFOCOM 2017, Atlanta, GA, USA, 1-4 May, 2017
ISBN: 9781509053360
ISSN: 0743-166X
DOI: 10.1109/INFOCOM.2017.8056981
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Apr 6, 2019

Page view(s)

Last Week
Last month
Citations as of May 14, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.