快速、简单的PROFINET IRT网络调度算法

2012 9th IEEE International Workshop on Factory Communication Systems Pub Date : 2012-05-21 DOI:10.1109/WFCS.2012.6242556

Lukasz Wisniewski, M. Schumacher, J. Jasperneite, S. Schriegel

{"title":"快速、简单的PROFINET IRT网络调度算法","authors":"Lukasz Wisniewski, M. Schumacher, J. Jasperneite, S. Schriegel","doi":"10.1109/WFCS.2012.6242556","DOIUrl":null,"url":null,"abstract":"Scheduling of the communication in industrial networks takes time. Since it has to be carried out every time a new network is brought to work, the time necessary to perform scheduling becomes a prominent factor. The approach presented in this paper, simplifies the scheduling problem of PROFINET IRT by resolving communication conflicts by utilization of the dynamic frame packing (DFP) mechanism.","PeriodicalId":110610,"journal":{"name":"2012 9th IEEE International Workshop on Factory Communication Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Fast and simple scheduling algorithm for PROFINET IRT networks\",\"authors\":\"Lukasz Wisniewski, M. Schumacher, J. Jasperneite, S. Schriegel\",\"doi\":\"10.1109/WFCS.2012.6242556\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scheduling of the communication in industrial networks takes time. Since it has to be carried out every time a new network is brought to work, the time necessary to perform scheduling becomes a prominent factor. The approach presented in this paper, simplifies the scheduling problem of PROFINET IRT by resolving communication conflicts by utilization of the dynamic frame packing (DFP) mechanism.\",\"PeriodicalId\":110610,\"journal\":{\"name\":\"2012 9th IEEE International Workshop on Factory Communication Systems\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 9th IEEE International Workshop on Factory Communication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WFCS.2012.6242556\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 9th IEEE International Workshop on Factory Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WFCS.2012.6242556","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 23

摘要

工业网络中的通信调度需要一定的时间。由于每次新网络投入使用时都必须进行调度，因此执行调度所需的时间就成为一个突出的因素。该方法利用动态帧打包(DFP)机制解决通信冲突，简化了PROFINET IRT的调度问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Fast and simple scheduling algorithm for PROFINET IRT networks

Scheduling of the communication in industrial networks takes time. Since it has to be carried out every time a new network is brought to work, the time necessary to perform scheduling becomes a prominent factor. The approach presented in this paper, simplifies the scheduling problem of PROFINET IRT by resolving communication conflicts by utilization of the dynamic frame packing (DFP) mechanism.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 9th IEEE International Workshop on Factory Communication Systems

自引率

0.00%

发文量