Deadlock-free buffer configuration for stream computing. (September 2017)

• Record Type: Journal Article
• Authors: Li, Peng; Beard, Jonathan C; Buhler, Jeremy D
• Other Names: Balaji Pavan guest-editor.; Huang Zhiyi guest-editor.
• Is Part Of: International journal of high performance computing applications. Volume 31:Number 5(2017)
• Page Start: 441
• Page End: 450
• Publication Date: 2017-09
• Subjects: Buffer configuration -- deadlock avoidance -- feedback channels -- parallel and distributed computing -- streaming computing; High performance computing -- Periodicals; Supercomputers -- Periodicals; 004.1105
• DOI: 10.1177/1094342016675679
• Languages: English
• ISSNs: 1094-3420

Abstract

Stream computing is a popular paradigm for parallel and distributed computing, where compute nodes are connected by first-in first-out data channels. Each channel can be considered as a concatenation of several data buffers, including an output buffer for the sender and an input buffer for the receiver. The configuration of buffer sizes impacts the performance as well as the correctness of the application. In this article, we focus on application deadlocks that are caused by incorrect configuration of buffer sizes. We describe three types of deadlock in streaming applications, categorized by how they can be created. To avoid them, we first prove necessary and sufficient conditions for deadlock-free computations; then based on the theorems, we propose both compile-time and runtime solutions for deadlock avoidance.