.png){kind=icon}
返回
IMSuite: A benchmark suite for simulating distributed algorithms
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2014.10.010.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Considering the diverse nature of real-world distributed applications that makes it hard to identify a representative subset of distributed benchmarks, we focus on their underlying distributed algorithms. We present and characterize a new kernel benchmark suite (named IMSuite) that simulates some of the classical distributed algorithms in task parallel languages. We present multiple variations of our kernels, broadly categorized under two heads: (a) varying synchronization primitives (with and without fine grain synchronization primitives); and (b) varying forms of parallelization (data parallel and recursive task parallel). Our characterization covers interesting aspects of distributed applications such as distribution of remote communication requests, number of synchronization, task creation, task termination and atomic operations. We study the behavior (execution time) of our kernels by varying the problem size, the number of compute threads, and the input configurations. We also present an involved set of input generators and output validators. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Benchmarks.
Distributed algorithms
Performance evaluation
Task parallelism
Data parallelism
Recursive task parallelism
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
Velvet: Algorithms for de novo short read assembly using de Bruijn graphsVelvet: 使用de Bruijn图进行从头短读组装的算法.png)
GENOME RESEARCHOAAI
GENOME RESEARCHIF5.5
OAAI分享收藏
查看更多内容