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

研究成果: Conference contribution

抜粋

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%.

元の言語English
ホスト出版物のタイトル28th International Conference on Computers and Their Applications 2013, CATA 2013
ページ197-204
ページ数8
出版物ステータスPublished - 2013
イベント28th International Conference on Computers and Their Applications 2013, CATA 2013 - Honolulu, HI, United States
継続期間: 2013 3 42013 3 6

出版物シリーズ

名前28th International Conference on Computers and Their Applications 2013, CATA 2013

Other

Other28th International Conference on Computers and Their Applications 2013, CATA 2013
United States
Honolulu, HI
期間13/3/413/3/6

ASJC Scopus subject areas

  • Computer Science Applications

フィンガープリント Packet routing for distributed real-time system on real-time communication link' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Yoshizumi, O., Matsutani, H., & Yamasaki, N. (2013). Packet routing for distributed real-time system on real-time communication link. : 28th International Conference on Computers and Their Applications 2013, CATA 2013 (pp. 197-204). (28th International Conference on Computers and Their Applications 2013, CATA 2013).