Packet routing for distributed real-time system on real-time communication link

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

Abstract

Since distributed real-time systems require strict time constraints on communication, packets must be routed to meet the real-time constraints. To reduce the communication latency and satisfy the real-time constraints, a minimal path for each pair of source and destination is selected, then its schedulability is verified if the selected path meets the constraints. Since such routing schemes may form cyclic dependencies across multiple packets, routing schemes must be designed to guarantee deadlock-freedom. In this paper, we propose routing schemes of a real-time communication link that guarantee both real-time capability and deadlock-freedom for distributed real-time systems. Simulation results show that the proposed routing schemes improve the schedulability of communications by up to 30%.

Original languageEnglish
Title of host publication28th International Conference on Computers and Their Applications 2013, CATA 2013
Pages197-204
Number of pages8
Publication statusPublished - 2013
Event28th International Conference on Computers and Their Applications 2013, CATA 2013 - Honolulu, HI, United States
Duration: 2013 Mar 42013 Mar 6

Publication series

Name28th International Conference on Computers and Their Applications 2013, CATA 2013

Other

Other28th International Conference on Computers and Their Applications 2013, CATA 2013
Country/TerritoryUnited States
CityHonolulu, HI
Period13/3/413/3/6

ASJC Scopus subject areas

  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Packet routing for distributed real-time system on real-time communication link'. Together they form a unique fingerprint.

Cite this