Implementation on CUDA of the Smoothing Problem with Tissue-Like P Systems

2011 ◽  
Vol 2 (3) ◽  
pp. 25-34 ◽  
Author(s):  
Francisco Peña-Cantillana ◽  
Daniel Díaz-Pernil ◽  
Hepzibah A. Christinal ◽  
Miguel A. Gutiérrez-Naranjo

Smoothing is often used in Digital Imagery for improving the quality of an image by reducing its level of noise. This paper presents a parallel implementation of an algorithm for smoothing 2D images in the framework of Membrane Computing. The chosen formal framework has been tissue-like P systems. The algorithm has been implemented by using a novel device architecture called CUDA (Compute Unified Device Architecture) which allows the parallel NVIDIA Graphics Processors Units (GPUs) to solve many complex computational problems. Some examples are presented and compared; research lines for the future are also discussed.

Author(s):  
Francisco Peña-Cantillana ◽  
Daniel Díaz-Pernil ◽  
Hepzibah A. Christinal ◽  
Miguel A. Gutiérrez-Naranjo

Smoothing is often used in Digital Imagery for improving the quality of an image by reducing its level of noise. This paper presents a parallel implementation of an algorithm for smoothing 2D images in the framework of Membrane Computing. The chosen formal framework has been tissue-like P systems. The algorithm has been implemented by using a novel device architecture called CUDA (Compute Unified Device Architecture) which allows the parallel NVIDIA Graphics Processors Units (GPUs) to solve many complex computational problems. Some examples are presented and compared; research lines for the future are also discussed.


Author(s):  
Artiom Alhazov ◽  
Svetlana Cojocaru ◽  
Ludmila Malahova ◽  
Yurii Rogozhin

Membrane computing is a formal framework of distributed parallel com- puting. In this paper we implement the work with the prefix tree by P systems with strings and active membranes. We present the algorithms of searching in a dictionary and updating it implemented as membrane systems. The systems are constructed as reusable modules, so they are suitable for using as sub-algorithms for solving more complicated problems.


2009 ◽  
Vol 19 (04) ◽  
pp. 513-533 ◽  
Author(s):  
FUMIHIKO INO ◽  
YUKI KOTANI ◽  
YUMA MUNEKAWA ◽  
KENICHI HAGIHARA

This paper presents a parallel system capable of accelerating biological sequence alignment on the graphics processing unit (GPU) grid. The GPU grid in this paper is a desktop grid system that utilizes idle GPUs and CPUs in the office and home. Our parallel implementation employs a master-worker paradigm to accelerate an OpenGL-based algorithm that runs on a single GPU. We integrate this implementation into a screensaver-based grid system that detects idle resources on which the alignment code can run. We also show some experimental results comparing our implementation with three different implementations running on a single GPU, a single CPU, or multiple CPUs. As a result, we find that a single non-dedicated GPU can provide us almost the same throughput as two dedicated CPUs in our laboratory environment, where GPU-equipped machines are ordinarily used to develop GPU applications. In a dedicated environment, the GPU-accelerated code achieves five times higher throughput than the CPU-based code. Furthermore, a linear speedup of 30.7X is observed on a 32-node cluster of dedicated GPUs. We also implement a compute unified device architecture (CUDA) based algorithm to demonstrate further acceleration.


2012 ◽  
Vol 22 (03) ◽  
pp. 1250007 ◽  
Author(s):  
PEDRO RODRÍGUEZ ◽  
MARÍA CECILIA RIVARA ◽  
ISAAC D. SCHERSON

A novel parallelization of the Lepp-bisection algorithm for triangulation refinement on multicore systems is presented. Randomization and wise use of the memory hierarchy are shown to highly improve algorithm performance. Given a list of selected triangles to be refined, random selection of candidates together with pre-fetching of Lepp-submeshes lead to a scalable and efficient multi-core parallel implementation. The quality of the refinement is shown to be preserved.


Author(s):  
Ioan DZITAC

Membrane Computing is a branch of Computer Science initiated by<br />Gheorghe Păun in 1998, in a technical report of Turku Centre for Computer Science<br />published as a journal paper ("Computing with Membranes" in Journal of Computer<br />and System Sciences) in 2000. Membrane systems, as Gheorghe Păun called the<br />models he has introduced, are known nowadays as "P Systems" (with the letter P<br />coming from the initial of the name of this research area "father").<br />This note is an overview of the impact in ISI WoS of Gheorghe Păun’s works, focused<br />on Membrane Computing and P Systems field, on the occasion of his 65th birthday<br />anniversary.


Sign in / Sign up

Export Citation Format

Share Document