Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zheng Shi ; Dept. of Comput. Sci., Univ. of York, York ; Burns, A.

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.

Published in:

Real-Time Systems Symposium, 2008

Date of Conference:

Nov. 30 2008-Dec. 3 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.