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

Zheng Shi; Alan Burns

doi:10.1109/RTSS.2008.11

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

Zheng Shi, Alan Burns

Computer Science

Research output: Contribution to conference › Paper › peer-review

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.

Original language	Undefined/Unknown
Pages	421-430
DOIs	https://doi.org/10.1109/RTSS.2008.11
Publication status	Published - 2008

Access to Document

10.1109/RTSS.2008.11

http://doi.ieeecomputersociety.org/10.1109/RTSS.2008.11

Cite this

@conference{ebf0f93f529a44058b7a72d62cbd7bfb,

title = "Priority Assignment for Real-Time Wormhole Communication in On-Chip Networks",

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.",

author = "Zheng Shi and Alan Burns",

year = "2008",

doi = "10.1109/RTSS.2008.11",

language = "Undefined/Unknown",

pages = "421--430",

}

TY - CONF

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

AU - Shi, Zheng

AU - Burns, Alan

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=67249133157&partnerID=8YFLogxK

U2 - 10.1109/RTSS.2008.11

DO - 10.1109/RTSS.2008.11

M3 - Paper

SP - 421

EP - 430

ER -

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

Abstract

Access to Document

Other files and links

Cite this