Performance Evaluation of Mixed-Mode OpenMP/MPI Implementations

Bull, J. Mark; Enright, James P.; Guo, Xu; Maynard, C.M.; Reid, Fiona

doi:10.1007/s10766-010-0137-2

Cited by 18 publications

(11 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Graph coloring color growth bounded graphs such as unit disk graphs; for resolving resource conflicts. Our study of existing benchmark suites [4,5,6,7,8,9,10,11,12,13,14,15,16,17,18] has found that none of them meet majority of the aforementioned key requirements. Our goal is to design a benchmark suite that meets all our stated requirements.…”

Section: Problemmentioning

confidence: 99%

“…While PARSEC, JGF, NPB and BenchERL also contain a few kernels, benchmark suites like PBBS [4] focus only on kernel benchmarks. Similarly, JGF contains a few micro-kernels as well, while EPCC [11,8] and IntelMPI [14] contain only micro kernels. Compared to the application-oriented benchmarks, the kernel benchmarks are small in size, simpler to understand, easier to debug and provide insights on how a certain algorithm behaves.…”

Section: Related Workmentioning

confidence: 99%

“…This is due to the additional task creation, scheduling and termination overheads present in these kernels. As we increase the number of hardware threads (8,16,32,64), the task scheduling overheads decrease, and the effect of increased workload sharing starts dominating the above mentioned overheads.…”

Section: Effect Of Varying the Number Of Hwts (Input Size And Number mentioning

confidence: 99%

See 2 more Smart Citations

IMSuite: A benchmark suite for simulating distributed algorithms

Gupta

Nandivada

2015

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

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.

show abstract

Section: Problemmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Effect Of Varying the Number Of Hwts (Input Size And Number mentioning

confidence: 99%

See 1 more Smart Citation

IMSuite: A benchmark suite for simulating distributed algorithms

Gupta

Nandivada

2015

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Thus, it is associated to GCC but simple to deploy in existing environments as it does not modify the compilation chain. To show the impact of PARCOACH analysis on the compilation and execution time, we tested the NAS-MZ [12], AMG benchmark [1], the EPCC suite [2] and HERA [5]. All results were conducted on Tera100, a petaflopic supercomputer at the CEA.…”

Section: Resultsmentioning

confidence: 99%

PARCOACH Extension for Hybrid Applications with Interprocedural Analysis

Saillard¹,

Brunie²,

Carribault³

et al. 2016

Tools for High Performance Computing 2015

View full text Add to dashboard Cite

Supercomputers are rapidly evolving with now millions of processing units, posing the questions of their programmability. Despite the emergence of more widespread and functional programming models, developing correct and effective parallel applications still remains a complex task. Although debugging solutions have emerged to address this issue, they often come with restrictions. Furthermore, programming model evolutions stress the requirement for a validation tool able to handle hybrid applications. Indeed, as current scientific applications mainly rely on MPI (Message-Passing Interface), new hardwares designed with a larger node-level parallelism advocate for an MPI+X solution with X a shared-memory model like OpenMP. But integrating two different approaches inside the same application can be error-prone leading to complex bugs. In an MPI+X program, not only the correctness of MPI should be ensured but also its interactions with the multi-threaded model. For example, identical MPI collective operations cannot be performed by multiple non-synchronized threads. In this paper, we present an extension of the PARallel COntrol flow Anomaly CHecker (PARCOACH) to enable verification of hybrid HPC applications. Relying on a GCC plugin that combines static and dynamic analysis, the first pass statically verifies the thread level required by an MPI+OpenMP application and outlines execution paths leading to potential deadlocks. Based on this analysis, the code is selectively instrumented, displaying an error and interrupting all processes if the actual scheduling leads to a deadlock situation.Emmanuelle Saillard CEA, DAM,

show abstract

“…The usage of parallelism improves the execution time and allows the treatment of more voluminous databases. We envisage to experiment P-STM on machines more larges (with more cores) and to develop hybrid distributed version with the library MPI (Message Passing Interface) [13]. Another perspective is to test another way to proceed for generating candidates: to generate only signature candidates (without generating candidate itemsets).…”

Section: Discussionmentioning

confidence: 99%

Parallel Binary Approach for Frequent Itemsets Mining

Missaoui¹,

Arour²,

Slimani³

2013

IJCCE

View full text Add to dashboard Cite

Abstract-The technique of association rules discovering is one of the most known and the most explored techniques of data mining. This technique has two main phases: the first is to extract all the frequent itemsets and the second is to generate association rules from these frequent itemsets. The first phase is the most expensive given the large number of accesses to transactions database and the large number of candidate itemsets. As databases are generally very large, a solution to avoid the repetitive and costly accesses is to represent them by compact structures. In this paper, we propose a parallel binary approach for frequent itemsets extracting, to deal with the great number of candidates and to take advantage of multicore architectures. This approach is implemented using a compact data structure based on signatures tree for the representation of the database to access it only once. Index Terms-Data structure, frequent itemsets, open MP, parallelism.

show abstract

Performance Evaluation of Mixed-Mode OpenMP/MPI Implementations

Cited by 18 publications

References 10 publications

IMSuite: A benchmark suite for simulating distributed algorithms

IMSuite: A benchmark suite for simulating distributed algorithms

PARCOACH Extension for Hybrid Applications with Interprocedural Analysis

Parallel Binary Approach for Frequent Itemsets Mining

Contact Info

Product

Resources

About