Posts
Jun, 3
Mixed-Tool Performance Analysis on Hybrid Multicore Architectures
This paper proposes a triangular solve algorithm with variable block size for graphics processing unit (GPU). By using diagonal blocks inversion with recursion, this algorithm works with tunable block size to achieve the best performance. Various methods are shown on how to make use of existing profiling tools to successfully measure and analyze performance of […]
Jun, 3
Toward efficient GPU-accelerated N-body simulations
N-body algorithms are applicable to a number of common problems in computational physics including gravitation, electrostatics, and fluid dynamics. Fast algorithms (those with better than O(N^2) performance) exist, but have not been successfully implemented on GPU hardware for practical problems. In the present work, we introduce not only best-in-class performance for a multipole-accelerated treecode method, […]
Jun, 3
Modeling Rotor Wakes with a Hybrid OVERFLOW-Vortex Method on a GPU Cluster
The vortex core shed from rotorcraft blades maintains coherency-and thus dynamic relevance-many blade turns after its creation. This presents a challenge to traditional Eulerian computational methods, as fine grids are required to suppress numerical diffusion which would weaken the vortex cores after a small number of revolutions. Vortex methods have been used in the past […]
Jun, 3
A GPU-accelerated Boundary Element Method and Vortex Particle Method
Vortex particle methods, when combined with multipole-accelerated boundary element methods (BEM), become a complete tool for direct numerical simulation (DNS) of internal or external vortex-dominated flows. In previous work, we presented a method to accelerate the vorticity-velocity inversion at the heart of vortex particle methods by performing a multipole treecode N-body method on parallel graphics […]
Jun, 3
Bayesian Sparsity-Path-Analysis of Genetic Association Signal using Generalized t Priors
We explore the use of generalized t priors on regression coefficients to help understand the nature of association signal within "hit regions" of genome-wide association studies. The particular generalized t distribution we adopt is a Student distribution on the absolute value of its argument. For low degrees of freedom we show that the generalized t […]
Jun, 2
High Performance Computational Systems Biology, HiBi 2011
Special session of 9th International Conference on Computational Methods in Systems Biology (CMSB 2011) Computational methods in biology enable the systematic study of the complex interactions that characterize biological systems. Mathematical modelling is a necessary tool to unambiguously represent the information about the behaviour of the considered system and to enable sophisticated predictive analysis. One […]
Jun, 2
The 10th International Symposium on Parallel and Distributed Computing, ISPDC 2011
The 10th International Symposium on Parallel and Distributed Computing (ISPDC 2011) will take place between July 6th and 8th, 2011, in Cluj-Napoca, Romania. This year’s edition is organized by the Computer Science Department of the Technical University of Cluj-Napoca. It will feature keynote presentations and oral paper presentations, as well as several special sessions and […]
Jun, 2
CUDA-based Signed Distance Field Calculation for Adaptive Grids
We present a simple yet robust signed distance field (SDF) generator based on recent GPU architectures. In our approach, the squared Euclidean distance is calculated for each triangle face in parallel, and then an optimized stream reduction process is used to find the shortest distance. During this process, the stream reduction operation acts like a […]
Jun, 2
Sparse matrix computations on manycore GPU’s
Modern microprocessors are becoming increasingly parallel devices, and GPUs are at the leading edge of this trend. Designing parallel algorithms for manycore chips like the GPU can present interesting challenges, particularly for computations on sparse data structures. One particularly common example is the collection of sparse matrix solvers and combinatorial graph algorithms that form the […]
Jun, 2
A Reverse-Projecting Pixel-Level Painting Algorithm
Traditional Texturing using a set of two dimensional image maps is an established and widespread practice. However, it is difficult to parameterize a model in texture space, particularly with representations such as implicit surfaces, subdivision surfaces, and very dense or detailed polygonal meshes. Based on an adaptive octree textures definition, this paper proposes a direct […]
Jun, 2
Massively Parallel Finite Element Simulator for Full-Chip STI Stress Analysis
In modern integrated circuit (IC) designs with feature size finer than 90nm, the stress among different material layers is playing an important role in determining device performance. The stress can be classified into two categories, stress deliberately introduced during semiconductor process, and stress unintentionally formed through the synergy of different processing steps. Among different types […]
Jun, 2
RNA secondary structure prediction using dynamic programming algorithm – A review and proposed work
Ribonucleic acid (RNA) plays a fundamental and important role in cellular life forms and their function is directly related to their structure. RNA secondary structure prediction is a significant area of study for many scientists seeking insights into potential drug interactions or innovative new treatment methodologies. Predicting structure can overcome many issues related with physical […]
