.png){kind=icon}
返回
Generating synthetic task graphs for simulating stream computing systems
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2013.06.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Stream-computing is an emerging computational model for performing complex operations on and across multi-source, high-volume data flows. The pool of mature publicly available applications employing this model is fairly small, and therefore the availability of workloads for various types of applications is scarce. Thus, there is a need for synthetic generation of large-scale workloads to drive simulations and estimate the performance of stream-computing applications at scale. We identify the key properties shared by most task graphs of stream-computing applications and use them to extend known random graph generation concepts with stream computing specific features, providing researchers with realistic input stream graphs. Our graph generation techniques serve the purpose of covering a disparity of potential applications and user input. Our first domain-specific framework exhibits high user-controlled configurability while the second application-agnostic framework focuses solely on emulating the key properties of general stream-computing systems, at the loss of domain-specific fine-tuning. (C) 2013 Elsevier Inc. All rights reserved.
Keyword:
Stream computing systems
Workload characterization
Computational task graphs
Synthetic stream-computing graphs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容