Paper Info
Title
Priority Assignment for Real-Time Wormhole Communication 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, none of current priority assignment policies works well in on-chip networks due to some inherent properties of the protocol. In this paper, a novel heuristic branch and bound search algorithm is introduced to explore the possible priority ordering. Differing from the traditional exhaust algorithm which costs exponential complexity, our algorithm can effectively reduce the search space. In addition, this algorithm can ensure that if a priority ordering exists that makes the traffic-flows schedulable, this priority ordering will be found by the search algorithm. By combining with schedulability analysis, a broad class of real-time communication with different QoS requirements can be explored and developed in a SoC/NoC communication platform.
Year
DOI
Venue
2008
10.1109/RTSS.2008.11
RTSS
Keywords
Field
DocType
real-life cyber-physical system,telecommunication switching,building automation system,automotive vehicle,wormhole switch,networked control system,overall system dynamic,tree searching,quality of service,branch and bound search algorithm,wormhole switching,qos,exponential complexity,unmanned vehicle,priority assignment,real-time wormhole communication,on-chip networks,network-on-chip,traffic flow,network on chip,search algorithm,real time systems,search space,chip,system on a chip,real time,switches,algorithm design and analysis,branch and bound,interference,upper bound
Priority ceiling protocol,Branch and bound,Search algorithm,Wormhole switching,Computer science,Deadline-monotonic scheduling,Computer network,Real-time computing,Priority queue,Priority inheritance,Best-first search,Distributed computing
Conference
ISSN
ISBN
Citations 
1052-8725
978-0-7695-3477-0
19
PageRank 
References 
Authors
0.77
16
2
Name
Order
Citations
PageRank
Zheng Shi11655.46
Alan Burns273959.60