Building design and operation often requires real-time or faster-than-real-time simulations for detailed information on air distributions. By solving the Navier-Stokes equations and transportation equations for energy and species, Fast Fluid Dynamics (FFD) model can provide detailed information as a Computational Fluid Dynamics (CFD) model. Compared to the CFD, the FFD is 50 times faster with s...

In the field of video compression, motion estimation (ME) is a process that leads to high computational complexity. Implementation of ME block-matching (BM) algorithms on general purpose Central Processing Unit (CPU), has resulted in poor performance. In this paper we investigate the performance of two BM ME algorithms: Three Step Search (TSS) and Four Step Search (4SS) on Graphics Processing U...

Direction-of-arrival (DOA) estimation algorithm for uniform planar arrays has been applied in many fields. The multiple signal classification (MUSIC) obvious advantage high-resolution source scenarios. However, the MUSIC high computational costs, therefore it is hard to be used real-time scenes. Many studies are dedicated accelerating by parallel hardware, especially Graphics Processing Units (...

Graphics processing units (GPUs) can act as an attractive alternative to CPUs for general purpose computation in certain scenarios. Traditionally, the GPU has been developed to offload graphics processing from the CPU. In recent years the GPU has continued to become a more flexible and powerful device, responding to the demand of the games industry to execute more and more complex custom graphi...

This paper presents an implementation of the FDTDcompatible Green’s function on a heterogeneous parallel processing system. The developed implementation simultaneously utilizes computational power of the central processing unit (CPU) and the graphics processing unit (GPU) to the computational tasks best suited for each architecture. Recently, closed-form expression for this discrete Green’s fun...

We propose an efficient method to treat dynamic array data on Graphics Processing Unit (GPU), which is applicable to fluid simulations. Few numbers of dynamic structures have been realized on GPU since most of the previous methods store the data in texture to represent the structure and it is difficult to manage the dynamic structure on the texture. Our method uses vertex buffer object for repr...

Neural networks (NNs) are growing in importance and complexity. An NN’s performance (and energy efficiency) can be bound either by computation or memory resources. The processing-in-memory (PIM) paradigm, where is placed near within arrays, a viable solution to accelerate memory-bound NNs. However, PIM architectures vary form, different approaches lead tradeoffs. Our goal analyze, discuss, cont...

Recent developments in radiotherapy therapy demand high computation powers to solve challenging problems in a timely fashion in a clinical environment. The graphics processing unit (GPU), as an emerging high-performance computing platform, has been introduced to radiotherapy. It is particularly attractive due to its high computational power, small size, and low cost for facility deployment and ...

In this paper, we propose an out-of-core branch and bound (B&B) method for solving the 0-1 knapsack problem on a graphics processing unit (GPU). Given a large problem that produces many subproblems, the proposed method dynamically swaps subproblems out to CPU memory. We adopt two strategies to realize this swapping-out procedure with minimum amount of CPU-GPU data transfer. The first strategy i...