Abstract
In this paper, the authors discuss a real-time on-chip communication service with a priority-based wormhole
switching policy. The authors present a novel off-line schedulability analysis approach, worst case network
latency analysis. By evaluating diverse inter-relationships and service attributes among the traffic flows, this
approach can predict the packet network latency for all practical situations. The simulation results provide
evidence that communication latency calculated using the real time analysis approach is safe, closely matching
the figures obtained from simulation.
switching policy. The authors present a novel off-line schedulability analysis approach, worst case network
latency analysis. By evaluating diverse inter-relationships and service attributes among the traffic flows, this
approach can predict the packet network latency for all practical situations. The simulation results provide
evidence that communication latency calculated using the real time analysis approach is safe, closely matching
the figures obtained from simulation.
| Original language | Undefined/Unknown |
|---|---|
| Number of pages | 23 |
| Journal | International Journal of Embedded and Real-Time Communication Systems (IJERTCS) |
| Volume | 1 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Apr 2010 |