利用ATM网络实现工厂监控系统的实时通信

I. Mizunuma, S. Horiike, Morikazu Takegaki
{"title":"利用ATM网络实现工厂监控系统的实时通信","authors":"I. Mizunuma, S. Horiike, Morikazu Takegaki","doi":"10.1109/RTCSA.1995.528778","DOIUrl":null,"url":null,"abstract":"We propose a method for a schedulability check in ATM networks which provide fixed prioritized virtual connections. Our method does not need any run-time scheduling other than fixed priority scheduling at each output link of all switch nodes and traffic shaping at each output link of cell terminal nodes in a network. Rate monotonic analysis assumes a critical instance in which all tasks arrive at the same time. We, however, can obtain information on the times when messages arrive at switch nodes in a network. Using such information, our method can check the schedulability of a set of channels more exactly than the method assuming a critical instance.","PeriodicalId":111365,"journal":{"name":"Proceedings Second International Workshop on Real-Time Computing Systems and Applications","volume":"156 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Real-time communication in plant-monitoring/controlling systems with ATM networks\",\"authors\":\"I. Mizunuma, S. Horiike, Morikazu Takegaki\",\"doi\":\"10.1109/RTCSA.1995.528778\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a method for a schedulability check in ATM networks which provide fixed prioritized virtual connections. Our method does not need any run-time scheduling other than fixed priority scheduling at each output link of all switch nodes and traffic shaping at each output link of cell terminal nodes in a network. Rate monotonic analysis assumes a critical instance in which all tasks arrive at the same time. We, however, can obtain information on the times when messages arrive at switch nodes in a network. Using such information, our method can check the schedulability of a set of channels more exactly than the method assuming a critical instance.\",\"PeriodicalId\":111365,\"journal\":{\"name\":\"Proceedings Second International Workshop on Real-Time Computing Systems and Applications\",\"volume\":\"156 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Second International Workshop on Real-Time Computing Systems and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTCSA.1995.528778\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Second International Workshop on Real-Time Computing Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTCSA.1995.528778","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

提出了一种在提供固定优先虚拟连接的ATM网络中进行可调度性检查的方法。该方法不需要任何运行时调度,只需要在网络中所有交换节点的每个输出链路上进行固定优先级调度和在蜂窝终端节点的每个输出链路上进行流量整形。速率单调分析假设一个所有任务同时到达的关键实例。然而,我们可以获得消息到达网络中交换节点的时间信息。使用这些信息,我们的方法可以比假设一个关键实例的方法更精确地检查一组通道的可调度性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Real-time communication in plant-monitoring/controlling systems with ATM networks
We propose a method for a schedulability check in ATM networks which provide fixed prioritized virtual connections. Our method does not need any run-time scheduling other than fixed priority scheduling at each output link of all switch nodes and traffic shaping at each output link of cell terminal nodes in a network. Rate monotonic analysis assumes a critical instance in which all tasks arrive at the same time. We, however, can obtain information on the times when messages arrive at switch nodes in a network. Using such information, our method can check the schedulability of a set of channels more exactly than the method assuming a critical instance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信