Sciweavers

5640 search results - page 495 / 1128
» Parallelizing the Data Cube
Sort
View
PDP
2011
IEEE
14 years 8 months ago
Accelerating Parameter Sweep Applications Using CUDA
—This paper proposes a parallelization scheme for parameter sweep (PS) applications using the compute unified device architecture (CUDA). Our scheme focuses on PS applications w...
Masaya Motokubota, Fumihiko Ino, Kenichi Hagihara
CLUSTER
2008
IEEE
15 years 11 months ago
Redistribution aware two-step scheduling for mixed-parallel applications
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...
Sascha Hunold, Thomas Rauber, Frédér...
SC
2003
ACM
15 years 10 months ago
Dyn-MPI: Supporting MPI on Non Dedicated Clusters
Distributing data is a fundamental problem in implementing efficient distributed-memory parallel programs. The problem becomes more difficult in environments where the participa...
D. Brent Weatherly, David K. Lowenthal, Mario Naka...
142
Voted
IEEEPACT
2000
IEEE
15 years 9 months ago
Instruction Scheduling for Clustered VLIW DSPs
Recent digital signal processors (DSPs) show a homogeneous VLIW-like data path architecture, which allows C compilers to generate efficient code. However, still some special rest...
Rainer Leupers
161
Voted
LCPC
1998
Springer
15 years 9 months ago
HPF-2 Support for Dynamic Sparse Computations
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...
Rafael Asenjo, Oscar G. Plata, Juan Touriño...