Many algorithms of practical interest require evaluation of a given function F on each point of a domain consisting of all k-partitions of an N-element set. Because the cardinality of such a domain grows rapidly for fixed k and increasing N, such algorithms are appealing candidates for parallelization; but to implement such parallelization efficiently in […]

May 25, 2014 by hgpu

Feature or variable selection still remains an unsolved problem, due to the infeasible evaluation of all the solution space. Several algorithms based on heuristics have been proposed so far with successful results. However, these algorithms were not designed for considering very large datasets, making their execution impossible, due to the memory and time limitations. This […]

February 25, 2014 by hgpu

High data rate waveforms for software defined radios (SDR) have to cope with frequency selective fading due to the mobile use in different harsh transmission environments. The received signal needs to be equalized in order to restore the transmitted information. Turbo equalization is a promising approach to deal with the inter-symbol interference occurring at the […]

December 31, 2013 by hgpu

Binary Space Partitioning (BSP) Tree can be used for hidden surface removal. In order to hide invisible surfaces, all surfaces are sorted back to front or front to back order. Traversal of BSP Trees for back to front order of faces requires calculation for all BSP Tree nodes, which can be made in parallel manner. […]

July 12, 2013 by hgpu

The gap between a supercomputer’s theoretical maximum ("peak") floating-point performance and that actually achieved by applications has grown wider over time. Today, a typical scientific application achieves only 5-20% of any given machine’s peak processing capability, and this gap leaves room for significant improvements in execution times. This problem is most pronounced for modern "accelerator" […]

May 21, 2013 by hgpu

With the introduction of GPGPUs, parallel programming has become simple and affordable. APIs such as NVIDIA’s CUDA have attracted many programmers to port their applications to GPGPUs. But writing CUDA codes still remains a challenging task. Moreover, the vast repositories of legacy serial C codes, which are still in wide use in the industry, are […]

August 2, 2012 by hgpu

Numerical solution models to Maxwell’s equations, which describe electromagnetic wave propagation phenomenon with complete clarity, are of atmost importance in pre-fabrication simulation analyses of the photonic and optoelectronic devices. The Finite Difference Time Domain (FDTD) method, which is based on modeling the differential equations as difference equations in a discretized domain in both space and […]

July 13, 2012 by hgpu

Concern about the threats posed by natural proliferation of animal-borne human diseases like BSE ("mad cow disease") and by the possible use of animals as disease vectors in bioterrorism, have spurred heightened interest in the development of methods for rapid automated identification of individual animals of various societally and commercially important mammalian species. Just as […]

May 29, 2012 by hgpu

Today every personal computer and almost every work-related computer has a GPU powerful enough to be used as a supplementary computational device. One framework which enables utilization of this is called OpenCL. We asked the question how one writes efficient algorithms on these GPGPU devices. We found that there are two major ways to run […]

April 19, 2012 by hgpu

In this study, we visualize Pareto-optimum solutions derived from multiple-objective optimization using spherical self-organizing maps (SOMs) that lay out SOM data in three dimensions. There have been a wide range of studies involving plane SOMs where Pareto-optimal solutions are mapped to a plane. However, plane SOMs have an issue that similar data differing in a […]

April 5, 2012 by hgpu

Finite difference time domain (FDTD) is a numerical method for solving differential equations like Maxwell’s equations. Normally, simulation time of these equations is very long and there has been a great effort to reduce it. The most recent and useful way to reduce the simulation time of these equations is through using GPUs. Graphical processing […]

March 10, 2012 by hgpu

In this paper, we present the optimization of the particle-based volume rendering for GPU platforms. In general, data transfer between CPU and GPU accompanies long latency. Using page lock memory of the CUDA runtime API, data area is selected so that the data transfer between CPU and GPU becomes faster to reduce the execution time. […]

November 30, 2011 by hgpu