Name
Abstract | ||
|---|---|---|
Scheduling of time triggered communication systems belongs to the well known hard mathematical optimization problems. This paper tackles the communication scheduling problem in redundant network topologies, where the real-time process data has to be duplicated and sent on two different paths to its destination. This paper proposes an algorithm that is able to find a feasible schedule in a short time, while keeping the makespan of the schedule in average 10% shorter than the makespan of the schedule produced by a commercial tool, which is the current benchmark. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/WFCS.2016.7496530 | 2016 IEEE World Conference on Factory Communication Systems (WFCS) |
Keywords | Field | DocType |
scheduling,PROFINET IRT communication,redundant network topologies,communication systems,mathematical optimization problems | Job shop scheduling,Fair-share scheduling,Computer science,Two-level scheduling,Schedule,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lukasz Wisniewski | 1 | 18 | 6.87 |
| Verena Wendt | 2 | 0 | 0.68 |
| Jürgen Jasperneite | 3 | 237 | 32.90 |
| Christian Diedrich | 4 | 3 | 1.48 |