uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Generalized Finitary Real-Time Calculus
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Elektrobit Automot, Erlangen, Germany..ORCID iD: 0000-0002-7134-2142
Univ Kaiserslautern, Distributed Comp Syst DISCO Lab, Kaiserslautern, Germany..
Univ Kaiserslautern, Distributed Comp Syst DISCO Lab, Kaiserslautern, Germany..
Hong Kong Polytech Univ, Dept Comp, Hong Kong, Hong Kong, Peoples R China..
Show others and affiliations
2017 (English)In: IEEE INFOCOM 2017 - IEEE Conference on Computer Communications, IEEE, 2017Conference paper, Published paper (Other academic)
Abstract [en]

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.

Place, publisher, year, edition, pages
IEEE, 2017.
Series
IEEE INFOCOM, ISSN 0743-166X
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-351194DOI: 10.1109/INFOCOM.2017.8056981ISI: 000425232200038ISBN: 978-1-5090-5336-0 (electronic)OAI: oai:DiVA.org:uu-351194DiVA, id: diva2:1209027
Conference
IEEE Conference on Computer Communications (INFOCOM), MAY 01-04, 2017, Atlanta, GA
Available from: 2018-05-21 Created: 2018-05-21 Last updated: 2018-05-21Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Lampka, KaiWang, Yi

Search in DiVA

By author/editor
Lampka, KaiWang, Yi
By organisation
Computer Systems
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 17 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf