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

Deadlock avoidance for systolic communication

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

1 Author(s)
Kung, H.T. ; Dept. of Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, USA

The nature of the deadlock problem for the systolic model of communication is described. This problem does not exist for special-purpose systolic arrays for which the hardware designer can afford providing as many queues as required by the specific computation that the array intends to implement. However, for programmable systolic arrays, the number of messages crossing the interval between two adjacent cells can be arbitrarily large, depending on the program. As a result, the possibility of deadlock always exists, since the number of queues between adjacent cells is fixed. The problem of avoiding queue-induced deadlocks, for deadlock-free programs, at run time is described, and a solution to the problem is given. Schemes for consistent labeling and compatible queue assignment, for which the solution calls, as also described, as is how to take advantage of the buffering capability provided by queues

Published in:

Computer Architecture, 1988. Conference Proceedings. 15th Annual International Symposium on

Date of Conference:

30 May-2 Jun 1988

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.