5640 search results - page 77 / 1128 » Parallelizing the Data Cube |
IPPS
2005
IEEE
14 years 2 months ago
2005
IEEE
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
ISCAPDCS
2007
13 years 10 months ago
2007
—The tremendous growth in the information culture, efficient digital searches are needed to extract and identify information from huge data. The notion that evolution in silicon ...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper presents the optimization and evaluation of parallel I/O for the BIPS3D parallel irregular application, a 3-dimensional simulation of BJT and HBT bipolar devices. The p...
LCR
2000
Springer
14 years 14 days ago
2000
Springer
Abstract. We present a system that allows task parallel OpenMP programs to execute on a network of workstations (NOW) with a variable number of nodes. Such adaptivity, generally ca...
IPPS
2002
IEEE
14 years 1 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...