Priority Assignment for Real-Time Wormhole Communication in On-Chip Networks

Research output: Contribution to conferencePaper

Author(s)

Department/unit(s)

Publication details

DatePublished - 2008
Original languageUndefined/Unknown

Abstract

Wormhole switching with fixed priority preemptionhas been proposed as a possible solution for real-time on-chipcommunication. However, none of current priority assignmentpolicies works well in on-chip networks due to some inherentproperties of the protocol. In this paper, a novel heuristicbranch and bound search algorithm is introduced to explore thepossible priority ordering. Differing from the traditional exhaustalgorithm which costs exponential complexity, our algorithm caneffectively reduce the search space. In addition, this algorithmcan ensure that if a priority ordering exists that makes thetraffic-flows schedulable, this priority ordering will be found bythe search algorithm. By combining with schedulability analysis,a broad class of real-time communication with different QoSrequirements can be explored and developed in a SoC/NoCcommunication platform.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations