Sciweavers

272 search results - page 31 / 55
» Code Transformations to Improve Memory Parallelism
Sort
View
PPOPP
2009
ACM
14 years 9 months ago
OpenMP to GPGPU: a compiler framework for automatic translation and optimization
GPGPUs have recently emerged as powerful vehicles for generalpurpose high-performance computing. Although a new Compute Unified Device Architecture (CUDA) programming model from N...
Seyong Lee, Seung-Jai Min, Rudolf Eigenmann
CPHYSICS
2004
92views more  CPHYSICS 2004»
13 years 8 months ago
Ultrahigh resolution simulations of mode converted ion cyclotron waves and lower hybrid waves
Full Wave studies of mode conversion (MC) processes in toroidal plasmas have required prohibitive amount of computer resources in the past because of the disparate spatial scales ...
J. C. Wright, P. T. Bonoli, E. D'Azevedo, M. Bramb...
POPL
2007
ACM
14 years 9 months ago
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Constraint Handling Rules (CHR) is a concurrent committedchoice constraint logic programming language to describe transformations (rewritings) among multi-sets of constraints (ato...
Edmund S. L. Lam, Martin Sulzmann
JPDC
2006
185views more  JPDC 2006»
13 years 8 months ago
Commodity cluster-based parallel processing of hyperspectral imagery
The rapid development of space and computer technologies has made possible to store a large amount of remotely sensed image data, collected from heterogeneous sources. In particul...
Antonio Plaza, David Valencia, Javier Plaza, Pablo...
BMCBI
2011
13 years 3 months ago
A lightweight, flow-based toolkit for parallel and distributed bioinformatics pipelines
Background: Bioinformatic analyses typically proceed as chains of data-processing tasks. A pipeline, or ‘workflow’, is a well-defined protocol, with a specific structure defin...
Marcin Cieslik, Cameron Mura