Acceptance
Title: | IMSuite: A Benchmark Suite for Simulating Distributed Algorithms |
Authors: | Suyash Gupta, V. Krishna Nandivada |
Publication: | Journal of Parallel and Distributed Computing (JPDC) |
Publication Date: | Jan 2015 |
Origin: | JPDC |
Keywords: | benchmarks, distributed algorithms, performance evaluation, task parallelism, data parallelism, recursive task parallelism |
DOI: | http://dx.doi.org/10.1016/j.jpdc.2014.10.010 |
Download URL: | http://authors.elsevier.com/a/1Q5FS2f6jyiqfm |
Bibtex entry
Abstract
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.
Arxive
Title: | IMSuite: A Benchmark Suite for Simulating Distributed Algorithms |
Authors: | Suyash Gupta, V. Krishna Nandivada |
Publication: | eprint arXiv:1310.2814 |
Publication Date: | 10/2013 |
Origin: | ARXIV |
Keywords: | Computer Science - Distributed, Parallel, and Cluster Computing |
Bibliographic Code: | 2013arXiv1310.2814G |
last modified 12:30, 14 November 2014