Posts
Aug, 27
Motion planning for autonomous driving with a conformal spatiotemporal lattice
We present a motion planner for autonomous highway driving that adapts the state lattice framework pioneered for planetary rover navigation to the structured environment of public roadways. The main contribution of this paper is a search space representation that allows the search algorithm to systematically and efficiently explore both spatial and temporal dimensions in real […]
Aug, 27
Fast and sleek glyph rendering for interactive HARDI data exploration
High angular resolution diffusion imaging (HARDI) is an emerging magnetic resonance imaging (MRI) technique that overcomes some decisive limitations of its predecessor diffusion tensor imaging (DTI). HARDI can resolve locally more than one direction in the diffusion pattern of water molecules and thereby opens up the opportunity to display and track crossing fibers. Showing the […]
Aug, 27
Rapid RNA Folding: Analysis and Acceleration of the Zuker Recurrence
RNA folding is a compute-intensive task that lies at the core of search applications in bioinformatics such as RNAfold and UNAFold. In this work, we analyze the Zuker RNA folding algorithm, which is challenging to accelerate because it is resource intensive and has a large number of variable-length dependencies. We use a technique of Lyngso […]
Aug, 27
A New Approach for Color Character Extraction Based on Parallel Clustering
A new approach of fast color character extraction was proposed. Clustering algorithm was adopted in our method to differentiate between objective character regions and background regions on the premise that character regions are nearly monochromatic. However, the key point of this approach was how to select suitable elements’ features based upon the original image information […]
Aug, 27
A new adaptive model for real-time fluid simulation with complex boundaries
In this paper, we present a new adaptive model for real-time fluid simulation with complex boundaries based on smoothed particle hydrodynamics (SPH) framework. Firstly, we introduce an adaptive SPH framework that is based on our character field function composed of 4 factors: geometrical complexity, boundary condition, physical complexity and complementary condition in terms of the […]
Aug, 26
Parallel Fast Gauss Transform
We present fast adaptive parallel algorithms to compute the sum of N Gaussians at N points. Direct sequential computation of this sum would take $O(N^2)$ time. The parallel time complexity estimates for our algorithms are $O(N/np)$ for uniform point distributions and $O(N/np log N/np + nplognp)$ for nonuniform distributions using np CPUs. We incorporate a […]
Aug, 26
PFunc: modern task parallelism for modern high performance computing
HPC today faces new challenges due to paradigm shifts in both hardware and software. The ubiquity of multi-cores, many-cores, and GPGPUs is forcing traditional serial as well as distributed-memory parallel applications to be parallelized for these architectures. Emerging applications in areas such as informatics are placing unique requirements on parallel programming tools that have not […]
Aug, 26
Challenging cloning related problems with GPU-based algorithms
Graphics Processing Unit (GPU) have been around for a while. Although they are primarily used for high-end 3D graphics processing, their use is now acknowledged for general massive parallel computing. This paper presents an original technique based on [10] to compute many instances of the longest common subsequence problem on a generic GPU architecture using […]
Aug, 26
Considerations when evaluating microprocessor platforms
Motivated by recent papers comparing CPU and GPU performance, this paper explores the questions: Why do we compare microprocessors and by what means should we compare them? We distinguish two distinct perspectives from which to make comparisons: application developers and computer architecture researchers. We survey the distinct concerns of these groups, identifying essential information each […]
Aug, 26
Exploring graphics processing units as parallel coprocessors for online aggregation
Multidimensional aggregation is one of the most important computational building blocks and hence also a potential performance bottleneck in Online Analytic Processing (OLAP). In order to deliver fast query responses for interactive operations such as slicing, dicing, roll-up and drill-down, it is essential that aggregates along the relevant dimensions of a data cube can be […]
Aug, 26
Parallel Viewshed Analysis on GPU Using CUDA
Viewshed analysis is a long established function of many geographical information systems to determine the visible cells of an input raster from one or more observers. It can be extended into large scale or higher resolution which requires the parallel implementation for time-tolerance. In this paper, we describe a GPU parallelization of viewshed analysis using […]
Aug, 26
GPU Based Real-time Correction for Optical Distortions in Head-Mounted Displays
This paper presents a GPU-based real-time method to correct optical distortions in head-mounted displays (HMDs). The HMD to be corrected is a lightweight and wide field-of-view HMD system with free-form-surface (FFS) prism, in which the image distortion is not rectilinear and centrosymmetric. A special predistortion model is constructed to correct the distortion of the HMD. […]