Loading [a11y]/accessibility-menu.js
Deadlock-avoidance for streaming applications with split-join structure: Two case studies | IEEE Conference Publication | IEEE Xplore

Deadlock-avoidance for streaming applications with split-join structure: Two case studies


Abstract:

Streaming is a highly effective paradigm for expressing parallelism in high-throughput applications. A streaming computation is a network of compute nodes connected by un...Show More

Abstract:

Streaming is a highly effective paradigm for expressing parallelism in high-throughput applications. A streaming computation is a network of compute nodes connected by unidirectional FIFO channels. When these computations are mapped onto real parallel platforms, however, some computations, especially ones in which some nodes act as filters, can deadlock the system due to finite buffering on channels. In this paper, we focus on streaming computations which contain a commonly used structure called split-join. Based on our previous work, we propose two correct deadlock-avoidance algorithms, named the Propagating Algorithm and the Non-propagating Algorithm. Our evaluation of two representative applications, biological sequence alignment and random number generation, shows that the Non-propagating Algorithm has very small communication overhead. For systems with large buffers or a low filtering ratio, the communication overhead of the Non-propagating Algorithm is negligible.
Date of Conference: 07-09 July 2010
Date Added to IEEE Xplore: 05 August 2010
ISBN Information:
Print ISSN: 1063-6862
Conference Location: Rennes, France

References

References is not available for this document.