high performance computing on graphics processing units: hgpu.org

The hardware and software evolutions related to Graphics Processing Units (GPUs), for general purpose computations, have changed the way the parallel programming issues are addressed. Many applications are being ported onto GPU for achieving performance gain. The GPU execution time is continuously optimized by the GPU programmers while optimizing pre-GPU computation overheads attracted the research […]

This paper deals with a Galerkin-based multi-scale time integration of a viscoelastic rope model. Using Hamilton’s dynamical formulation, Newton’s equation of motion as a second-order partial differential equation is transformed into two coupled first order partial differential equations in time. The considered finite viscoelastic deformations are described by means of a deformation-like internal variable determined […]

We present a new protocol for maliciously secure two-partycomputation based on cut-and-choose of garbled circuits using the recent idea of "forge-and-loose" which eliminates around a factor 3 of garbled circuits that needs to be constructed and evaluated. Our protocol introduces a new way to realize the "forge-and-loose" approach which avoids an auxiliary secure two-party computation […]

The Physical Optics approximation is a widely used asymptotic method for calculating the scattering from electrically large bodies. It requires significant computational work and little memory, and is thus well suited for application on a Graphics Processing Unit. Here, we investigate the performance of an implementation and demonstrate that while there are some implementational pitfalls, […]

Spatiotemporal databases are utilized in many applications to store the trajectories of moving objects. In this context, we focus on in-memory distance threshold queries that return all trajectories found within a distance d of a fixed or moving object over a time interval. We present performance results for a sequential query processing algorithm that uses […]

A recent development, called isogeometric analysis, provides a unified approach for design, analysis and optimization of functional products in industry. Common volume rendering methods for inspecting the results from the numerical simulations can not be applied directly to isogeometric models. We present a novel approach for interactive visualization of isogeometric analysis results, ensuring correct, i.e., […]

The Internet ecosystem comprising of thousands of Autonomous Systems (ASes) now include Internet eXchange Points (IXPs) as another critical component in the infrastructure. Peering plays a significant part in driving the economic growth of ASes and is contributing to a variety of structural changes in the Internet. IXPs are a primary component of this peering […]

Submission Deadline: 2014-10-20 Publication: All accepted papers will be published in one of the indexed Journals after being selected. Journal of Computers (JCP, ISSN: 1796-203X, 20 Papers) Journal of Software (JSW, ISSN: 1796-217X, 20 Papers) International Journal of Future Computer and Communication (IJFCC, ISSN: 2010-3751, 30 Papers) International Journal of Computer and Communication Engineering (IJCCE, […]

In this report, we have taken the first steps in investigating the feasibility of using the GPU as a cryptographic accelerator for the AES algorithm on mobile devices. In particular, our focus was on exploring the use of OpenCL as a framework for implementing the algorithm. Using modifications of an existing implementation [11], we first […]

High performance architectures are increasingly heterogeneous with shared and distributed memory components, and accelerators like GPUs. Programming such architectures is complicated and performance portability is a major issue as the architectures evolve. This thesis explores the potential for algorithmic skeletons integrating a dynamically parametrised static cost model, to deliver portable performance for mostly regular data […]

The maximal sensitivity of the Smith-Waterman (SW) algorithm has enabled its wide use in biological sequence database search. Unfortunately, the high sensitivity comes at the expense of quadratic time complexity, which makes the algorithm computationally demanding for big databases. In this paper, we present SWAPHI, the first parallelized algorithm employing Xeon Phi coprocessors to accelerate […]

Handwriting recognition is having high demand in commercial & academics. In recent years lots of good work has been done on hand written digit recognition to improve accuracy. Handwritten digit recognition system needs larger dataset and long training time to improve accuracy & reduce error rate. Training of Neural Networks for large data sets is […]