By Topic

Determining Deadlock Exposure for a Class of Store and Forward Communication 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 $31
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

1 Author(s)
Ahuja, Vijay ; IBM System Communications Division laboratory, Research Triangle Park, North Carolina 27709, USA

Given a network design, is the network exposed to deadlock for message buffers? This problem is addressed for a class of networks called “routed networks.” A routed network is a store and forward communication network in which all transmissions follow predefined routes through the network. It is shown that a routed network is exposed to deadlock if and only if there exists a complete weighted matching of an appropriately defined bipartite graph for some subgraph of the network graph. An approach for determining whether a deadlock can occur is presented.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:24 ,  Issue: 1 )