{"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}
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.