The Community for Technology Leaders
Green Image
<p>The occurrence of communication deadlocks caused by the unavailability of message buffers during the execution of distributed parallel programs is investigated. Such deadlocks can occur even if the program is designed for deadlock-freedom, since they are largely dependent on the system's ability to handle message buffering space. A class of deadlock prevention strategies which require that the programmer provide upper bounds on the buffer usage in the several communication channels involved is exploited, and it is argued that such bounds are relatively simple to obtain in many cases. The proposed strategies range from those which require a minimal amount of buffers to those which ensure a reasonable level of concurrency in process execution, although at the expense of more buffering space. It is shown that in general these strategies require the solution of NP-hard optimization problems, and an efficient heuristic to tackle the concurrency-optimal strategy is suggested. Randomly generated systems are then used to show that the heuristic tends to be very successful.</p>
randomly generated systems; communication deadlocks; distributed parallel programs; unavailability; message buffers; message buffering space; deadlock prevention; upper bounds; buffer usage; communication channels; concurrency; process execution; NP-hard optimization problems; heuristic; computational complexity; parallel programming; programming theory

V. Barbosa, "Strategies for the Prevention of Communication Deadlocks in Distributed Parallel Programs," in IEEE Transactions on Software Engineering, vol. 16, no. , pp. 1311-1316, 1990.
108 ms
(Ver 3.3 (11022016))