Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kang, Kyungtae | - |
dc.contributor.author | Park, Kyung-Joon | - |
dc.contributor.author | Sha, Lui | - |
dc.contributor.author | Wang, Qixin | - |
dc.date.accessioned | 2021-06-23T04:22:43Z | - |
dc.date.available | 2021-06-23T04:22:43Z | - |
dc.date.issued | 2013-01 | - |
dc.identifier.issn | 0922-6443 | - |
dc.identifier.issn | 1573-1383 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/29234 | - |
dc.description.abstract | Most commercial network switches are designed to achieve good average throughput and delay needed for Internet traffic, whereas hard real-time applications demand a bounded delay. Our real-time switch combines clearance-time-optimal switching with clock-based scheduling on a crossbar switching fabric. We use real-time virtual machine tasks to serve both periodic and aperiodic traffic, which simplifies analysis and provides isolation from other system operations. We can then show that any feasible traffic will be switched in two clock periods. This delay bound is enabled by introducing one-shot traffic, which can be constructed at the cost of a fixed delay of one clock period. We carry out simulation to compare our switch with the popular iSLIP crossbar switch scheduler. Our switch has a larger schedulability region, a bounded lower end-to-end switching delay, and a shorter clearance time which is the time required to serve every packet in the system. | - |
dc.format.extent | 19 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | SPRINGER | - |
dc.title | Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1007/s11241-012-9169-6 | - |
dc.identifier.scopusid | 2-s2.0-84875839988 | - |
dc.identifier.wosid | 000312665400004 | - |
dc.identifier.bibliographicCitation | REAL-TIME SYSTEMS, v.49, no.1, pp 117 - 135 | - |
dc.citation.title | REAL-TIME SYSTEMS | - |
dc.citation.volume | 49 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 117 | - |
dc.citation.endPage | 135 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | INPUT | - |
dc.subject.keywordPlus | COMMUNICATION | - |
dc.subject.keywordPlus | ARCHITECTURE | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordAuthor | Real-time switch | - |
dc.subject.keywordAuthor | Bounded delay | - |
dc.subject.keywordAuthor | Schedulability analysis | - |
dc.subject.keywordAuthor | Clock-driven scheduling | - |
dc.identifier.url | https://link.springer.com/article/10.1007/s11241-012-9169-6 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.