high performance computing on graphics processing units: hgpu.org

Because Cellular Automata (CA) is a dynamic system with inherent parallelism, many studies are focused on mapping CA to the parallel system in order to obtain high performance computing capability, such as using clusters, supercomputers and networks of computers. But the application of these systems are too expensive and difficult to use on the occasions […]

In the finite element method simulation we often deal with large sparse matrices. Sparse matrix-vector multiplication (SpMV) is of high importance for iterative solvers. During the solver stage, most of the time is in fact spent in the SpMV routine. The SpMV routine is highly memory-bound; the processor spends much time waiting for the needed […]

This book brings together research on numerical methods adapted for Graphics Processing Units (GPUs). It explains recent efforts to adapt classic numerical methods, including solution of linear equations and FFT, for massively parallel GPU architectures. This volume consolidates recent research and adaptations, covering widely used methods that are at the core of many scientific and […]

Graphics Processing Units (GPUs) have been used to enhance the speed and efficiency of both data structures and algorithms alike. A common data structure used in Computer Science is the Bloom Filter, which is used in many types of applications including databases and security logging. The Bloom Filter is a lossy data structure that uses […]

In this paper we introduce a novel higher-order regularization term. The proposed regularizer is a non-local extension of the popular second-order Total Generalized variation, which favors piecewise affine solutions and allows to incorporate soft-segmentation cues into the regularization term. These properties make this regularizer especially appealing for optical flow estimation, where it offers accurately localized […]

GPU (General-Purpose computation on Graphics Processing Units) offers an effective computing platform to accelerate a wide class of data-parallel computing. Multi-GPU’s appear as an attractive platform to speed up the computation of data-parallel GPU. This paper aims to explore the feasibility of relaxing the task-level restriction of single GPU use in multi-GPU real-time systems.We develop […]

Being sort is most frequent operation in science of computation, till date many sorting algorithms are proposed for CPUs & GPUs .Generally GPUs suffers with low memory sizes, due to this it is not possible to accommodate large data in GPU global Memory which arises external sorting techniques. These GPU based external sorting algorithms are […]

Submission Deadline: 2014-11-10 Publication: All accepted papers of ICAEE 2015 will be published by International Journal of Information and Electronics Engineering (IJIEE) which will be indexed by Google Scholar, Electronic Journals Library,Engineering & Technology Digital Library,Crossref and ProQuest, DOAJ, Ei (INSPEC, IET). Topics: Electronics and Communications Engineering QoS Provisioning and Architectures Telecommunication Services and Applications […]

Submission Deadline: 2014-10-10 Publication: International Journal of Knowledge Engineering Topics: T1 • Novel Algorithms T2 • Association Rules T3 • Knowledge engineering and management T4 • Classification T5 • Clustering T6 • Text analysis and text understanding T7 • Machine Learning T8 • Privacy Preserving Data Mining T9 • Statistical Methods T10 • Parallel and […]

Submission Deadline: 2014-10-10 Publication: Accepted papers will be published in the one of the following Journal with ISSN： International Journal of Future Computer and Communication (IJFCC) (ISSN: 2010-3751,DOI: 10.7763/IJFCC), Abstracting/ Indexing: Google Scholar, Engineering & Technology Digital Library, and Crossref, DOAJ, Electronic Journals Library, EI (INSPEC, IET). Topics: Algorithms High Performance Computing Artificial Intelligence and […]

Twilight, an interactive multi-touch graph visualization research tool jointly developed by the University of Amsterdam and SURFsara, uses the Fruchterman-Reingold algorithm (amongst others) to create meaningful layouts for graphs. The required time for this algorithm to complete scales exponentially with the size of the graphs, therefore rendering large graphs quickly becomes impractical. To combat this […]

Polygon overlay is one of the complex operations in computational geometry. It is applied in many fields such as Geographic Information Systems (GIS), computer graphics, VLSI CAD, etc. We have two significant results to report. Our first result is the first output-sensitive CREW PRAM algorithm for simple polygons, which can perform typical set operations including […]