Sciweavers

462 search results - page 61 / 93
» Is Data Distribution Necessary in OpenMP
Sort
View
VLDB
1999
ACM
224views Database» more  VLDB 1999»
13 years 12 months ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim
IPPS
2008
IEEE
14 years 2 months ago
On the representation and multiplication of hypersparse matrices
Multicore processors are marking the beginning of a new era of computing where massive parallelism is available and necessary. Slightly slower but easy to parallelize kernels are ...
Aydin Buluç, John R. Gilbert
IPPS
2007
IEEE
14 years 1 months ago
Scheduling Issues in Optimistic Parallelization
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...
Milind Kulkarni, Keshav Pingali
PDP
2006
IEEE
14 years 1 months ago
A Single-Loop Approach to SIMD Parallelization of 2-D Wavelet Lifting
Widespread use of wavelet transforms as in JPEG2000 demands efficient implementations on general purpose computers as well as dedicated hardware. The increasing availability of S...
Rade Kutil
MSS
2005
IEEE
106views Hardware» more  MSS 2005»
14 years 1 months ago
An Architecture for Lifecycle Management in Very Large File Systems
We present a policy-based architecture STEPS for lifecycle management (LCM) in a mass scale distributed file system. The STEPS architecture is designed in the context of IBM’s ...
Akshat Verma, David Pease, Upendra Sharma, Marc Ka...