Genetic algorithms (GAs) are useful for solving multimodal problems. It is quite difficult to search the search space of the multimodal problem with large dimensions. There is a challenge to use all the core of the system. The Dual Population GA (DPGA) attempts to explore and exploit search space on the multimodal problems. Parallel GAs (PGAs) are better option to optimize multimodal problems. ...

The work reported in this report evaluates the correctness, performance and usefulness of the four MetaFork translators (MetaFork to CilkPlus, CilkPlus to MetaFork, MetaFork to OpenMP, OpenMP to MetaFork). To this end, we run these translates on various input programs written either in CilkPlus or OpenMP, or both. We stress the fact that our purpose is not to compare the performance of the Cilk...

The recently introduced OpenMP device constructs open a whole new world for application writers, enabling them to easily utilize the host cpus along with other attached computational resources, in an intuitive and productive manner. At the same time, multicore architectures have conquered the whole computing spectrum. General-purpose and embedded system alike integrate multicore cpus and multic...

AthenaMP1 is an open-source parallel pattern library in C++ and OpenMP that is currently under development. This paper reports on the implementations of several data-parallel patterns: modify each, transmute, combine, reduce, and filter. We describe the patterns as well as our experiences implementing them in C++ and OpenMP. The results of two benchmarks showing no performance losses when compa...

This paper describes OpenMP parser for Ada, which is meant to make parallel programming in Ada simpler. We present different approaches to parallel programming and advantages of OpenMP solution. Next, implemented directives and clauses are described, and appropriated examples given. General look at parsing algorithm is presented in another part of this article. Finally, we present the source co...

Context: The rise of multicore is bringing shared-memory parallelism to the masses. The community is struggling to identify which parallel models are most productive. Objective: Measure the effect of MPI and OpenMP models on programmer productivity. Design: One group of programmers solved the sharks and fishes problem using MPI and a second group solved the same problem using OpenMP, then each ...

Future generations of Chip Multiprocessors (CMP) will provide dozens or even hundreds of cores inside the chip. Writing applications that benefit from the massive computational power offered by these chips is not going to be an easy task for mainstream programmers who are used to sequential algorithms rather than parallel ones. This paper explores the possibility of using Transactional Memory (...

OpenMP is still in the process of being defined and extended to broad the range of applications and parallelization strategies it can be used for. The proposal of OpenMP extensions may require the implementation of new features in the runtime system supporting the OpenMP parallel execution and modifications in an existing OpenMP compiler, either at the front end (parsing of new directives and c...

The fast emergence of OpenMP as the preferable parallel programming paradigm for small-to-medium scale parallelism could decline unless OpenMP will show capabilities to be the model-of-choice for large scale high performance parallel computing of the next decade. The main stumbling block from adapting OpenMP for distributed shared memory (DSM) machines, which are based on architecture like cc-N...

Clusters of small-scale SMP computers are becoming more and more common as high-performance computing needs have arised, not only in national scientific laboratories, but also in enterprises of various kinds. An SMP-cluster represents a sweet-spot of cost-efficiency compared to a larger SMP system or to a cluster with smaller nodes. With the emergance of OpenMP, shared memory computing has also...