%0 Journal Article %1 shi2010analysis %A Shi, Zheng %A Burns, Alan %C Norwell, MA, USA %D 2010 %I Kluwer Academic Publishers %J Real-Time Syst. %K analysis noc schedulability %N 3 %P 360--385 %R 10.1007/s11241-010-9108-3 %T Schedulability Analysis and Task Mapping for Real-time On-chip Communication %U http://dx.doi.org/10.1007/s11241-010-9108-3 %V 46 %X Priority-based wormhole switching with a priority share policy has been proposed as a possible solution for real-time on-chip communication. However, the blocking introduced by priority share complicates the analysis process. In this paper, we propose a new "per-priority" basis analysis scheme which computes the total time window at each priority level instead of each traffic-flow. By checking the release instance of each flow at the corresponding priority window, we can determine schedulability efficiently. Building on this static analysis, for a given set of tasks and network topology, we further propose a task mapping and priority assignment algorithm, in such a way that the hard time bounds are met with a reduced hardware overhead. Experiment results show that significant resource saving can be achieved with no performance degradation in terms of missed deadlines. By using this approach, a broad class of real-time communications with different QoS requirements can be explored and developed in a SoC/NoC communication platform.

@article{shi2010analysis, abstract = {Priority-based wormhole switching with a priority share policy has been proposed as a possible solution for real-time on-chip communication. However, the blocking introduced by priority share complicates the analysis process. In this paper, we propose a new "per-priority" basis analysis scheme which computes the total time window at each priority level instead of each traffic-flow. By checking the release instance of each flow at the corresponding priority window, we can determine schedulability efficiently. Building on this static analysis, for a given set of tasks and network topology, we further propose a task mapping and priority assignment algorithm, in such a way that the hard time bounds are met with a reduced hardware overhead. Experiment results show that significant resource saving can be achieved with no performance degradation in terms of missed deadlines. By using this approach, a broad class of real-time communications with different QoS requirements can be explored and developed in a SoC/NoC communication platform.}, acmid = {1891604}, added-at = {2014-11-06T10:58:33.000+0100}, address = {Norwell, MA, USA}, author = {Shi, Zheng and Burns, Alan}, biburl = {https://www.bibsonomy.org/bibtex/2f31b599f716880ae8f14b8a49ba499c7/eberle18}, description = {Schedulability analysis and task mapping for real-time on-chip communication}, doi = {10.1007/s11241-010-9108-3}, interhash = {065ddca5a7ac771da32bed0b05f04609}, intrahash = {f31b599f716880ae8f14b8a49ba499c7}, issn = {0922-6443}, issue_date = {December 2010}, journal = {Real-Time Syst.}, keywords = {analysis noc schedulability}, month = dec, number = 3, numpages = {26}, pages = {360--385}, publisher = {Kluwer Academic Publishers}, timestamp = {2014-11-06T10:58:33.000+0100}, title = {Schedulability Analysis and Task Mapping for Real-time On-chip Communication}, url = {http://dx.doi.org/10.1007/s11241-010-9108-3}, volume = 46, year = 2010 }