By Topic

Supporting preemption in wormhole 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
$33 $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)
K. Knauber ; Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA ; Biao Chen

When a computer network is used to support real time applications, meeting delay requirements is a key issue that has to be addressed. We study high performance networks with wormhole routing and investigate their performance in terms of meeting message delay constraints. We found that in this kind of network, preemption control performed at each node plays an important role in supporting real time traffic. In wormhole networks, this may result in unbounded packet blocking time, making it very difficult to efficiently support real time applications. To overcome this problem, we propose both transparent and non-transparent preemption schemes. Simulations show that combining proposed preemption schemes with other priority based schemes can outperform the conventional priority based schemes by a large margin, and the schemes have stable performance in large scale networks

Published in:

Computer Software and Applications Conference, 1999. COMPSAC '99. Proceedings. The Twenty-Third Annual International

Date of Conference: