Optimizing extensibility in hard real-time distributed systems

Qi Zhu*, Yang Yang, Eelco Scholte, Marco Di Natale, Alberto Sangiovanni-Vincentelli

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

32 Scopus citations

Abstract

We consider a set of control tasks that must be executed on distributed platforms so that end-to-end latencies are within deadlines. We investigate how to allocate tasks to nodes, pack signals to messages, allocate messages to buses, and assign priorities to tasks and messages, so that the design is robust with respect to changes in task requirements. The notion of extensibility is used to measure robustness. The extensibility metric measures how much the execution times of tasks can be increased without violating end-to-end deadlines. We optimize this metric by adopting a mathematical programming front-end followed by post-processing heuristics. The proposed algorithm as applied to industrial strength test cases shows its effectiveness in optimizing extensibility and a marked improvement in running time with respect to an approach based on randomized optimization.

Original languageEnglish (US)
Title of host publicationProceedings - 15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009
Pages275-284
Number of pages10
DOIs
StatePublished - 2009
Event15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009 - San Francisco, CA, United States
Duration: Apr 14 2009Apr 16 2009

Publication series

NameProceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS
ISSN (Print)1545-3421

Other

Other15th IEEE Real-Time and Embedded Technology and Application Symposium, RTAS 2009
CountryUnited States
CitySan Francisco, CA
Period4/14/094/16/09

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Optimizing extensibility in hard real-time distributed systems'. Together they form a unique fingerprint.

Cite this