.png){kind=icon}
Return
Safe Data Parallelism for General Streaming
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2013.221.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Streaming applications process possibly infinite streams of data and often have both high throughput and low latency requirements. They are comprised of operator graphs that produce and consume data tuples. General streaming applications use stateful, selective, and user-defined operators. The stream programming model naturally exposes task and pipeline parallelism, enabling it to exploit parallel systems of all kinds, including large clusters. However, data parallelism must either be manually introduced by programmers, or extracted as an optimization by compilers. Previous data parallel optimizations did not apply to selective, stateful and user-defined operators. This article presents a compiler and runtime system that automatically extracts data parallelism for general stream processing. Data-parallelization is safe if the transformed program has the same semantics as the original sequential version. The compiler forms parallel regions while considering operator selectivity, state, partitioning, and graph dependencies. The distributed runtime system ensures that tuples always exit parallel regions in the same order they would without data parallelism, using the most efficient strategy as identified by the compiler. Our experiments using 100 cores across 14 machines show linear scalability for parallel regions that are computation-bound, and near linear scalability when tuples are shuffled across parallel regions.
Keywords:
Data processing
distributed computing
parallel programming
Journal
IF:
3.8
Papers:
5.4K
Citations:
9.8K
Organization
Cited Papers
Latitude and Weather Influences on Sun Light Quality and the Relationship to Tree Growth.png)
ForestsOAAI
ForestsIF0
OAAIShareSaveMetal carbonyls—II Carbon monoxide and chloride exchange with some cyclopentadienyl metal carbonyls
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave
View more