Determination of delay bound over multi-hop real-time switches with virtual output queuing
- Authors
- Han, Sanghwa; Kang, Kyungtae; Ryu, Junhee
- Issue Date
- May-2014
- Publisher
- Institute of Electrical and Electronics Engineers Inc.
- Keywords
- packet traversal time; real-time crossbar switch; virtual output queuing; Worst-case analysis
- Citation
- Proceedings - International Conference on Advanced Information Networking and Applications, AINA, pp.892 - 898
- Indexed
- OTHER
- Journal Title
- Proceedings - International Conference on Advanced Information Networking and Applications, AINA
- Start Page
- 892
- End Page
- 898
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/25469
- DOI
- 10.1109/AINA.2014.144
- ISSN
- 1550-445X
- Abstract
- Predictable and guaranteed response is an essential characteristic of safety-critical real-time systems. Thus we need to guarantee that the end-to-end latency of data exchange within such a system is always bounded and controlled, so that the overall system behavior is predictable and safe. In this paper, we propose a method for determining the worst-case delay when a packet traverses a network that consists of real-time crossbar switches. These switches guarantee that any feasible traffic can be switched in two clock periods by adopting an optimal clearance-time switching policy together with clock-driven scheduling. We also propose a switching architecture that introduces a delay buffer and virtual output queues to meet the one-shot traffic assumption required for optimal clearance-time switching. By removing the impractical assumptions made in previous works, we are able to derive a more accurate delay bound for real-world scenarios. © 2014 IEEE.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF COMPUTING > DEPARTMENT OF ARTIFICIAL INTELLIGENCE > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/25469)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.