Performance-aware deployment of streaming applications in distributed stream computing systems

2020 ◽  
Vol 15 (1) ◽  
pp. 52
Author(s):  
Shang Gao ◽  
Rajkumar Buyya ◽  
Fengyun Li ◽  
Xunyun Liu ◽  
Dawei Sun
2020 ◽  
Vol 15 (1) ◽  
pp. 52 ◽  
Author(s):  
Dawei Sun ◽  
Shang Gao ◽  
Xunyun Liu ◽  
Fengyun Li ◽  
Rajkumar Buyya

2019 ◽  
Vol 97 ◽  
pp. 194-209 ◽  
Author(s):  
Dawei Sun ◽  
Shang Gao ◽  
Xunyun Liu ◽  
Fengyun Li ◽  
Xinqi Zheng ◽  
...  

2013 ◽  
Vol 73 (10) ◽  
pp. 1362-1374 ◽  
Author(s):  
Deepak Ajwani ◽  
Shoukat Ali ◽  
Kostas Katrinis ◽  
Cheng-Hong Li ◽  
Alfred J. Park ◽  
...  

Author(s):  
Peng Li ◽  
Jonathan C Beard ◽  
Jeremy D Buhler

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.


Sign in / Sign up

Export Citation Format

Share Document