Real-Time Communication Analysis with a Priority Share Policy in On-Chip Networks

Abstract

Wormhole switching with fixed priority preemption has been proposed as a possible solution for real-time on-chip communication. However, the hardware implementation cost is expensive and hence constrains its practical deployment. To address this problem, we propose a new solution by utilizing apriority share policy to reduce the resource overhead while still achieving the hard real-time service guarantees. The composite model-based schedulability analysis technique and relevant priority allocation scheme are represented in this paper. 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 communication with different QoS requirements can be explored and developed in a SoC/NoC communication platform.