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. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/WFCS.2012.6242556 | Factory Communication Systems |
Keywords | Field | DocType |
field buses,local area networks,DFP mechanism,PROFINET IRT networks,dynamic frame packing,industrial network,real-time Ethernet,scheduling algorithm | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Computer network,Two-level scheduling,Real-time computing,Rate-monotonic scheduling,Dynamic priority scheduling,PROFINET,Earliest deadline first scheduling,Round-robin scheduling,Distributed computing | Conference |
ISSN | ISBN | Citations |
Pending | 978-1-4673-0693-5 | 8 |
PageRank | References | Authors |
0.73 | 5 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lukasz Wisniewski | 1 | 18 | 6.87 |
Markus Schumacher | 2 | 33 | 4.95 |
Jasperneite, J. | 3 | 53 | 7.80 |
Sebastian Schriegel | 4 | 39 | 6.86 |