5640 search results - page 224 / 1128 » Parallelizing the Data Cube |
130
Voted
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
123
click to vote
ACSC
2008
IEEE
15 years 10 months ago
2008
IEEE
In the future, if we are to continue to expect improved application performance we will have to achieve it by exploiting course-grained hardware parallelism rather then simply rel...
160
Voted
MST
2002
15 years 3 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
176
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
The Coarse-Grained Monte Carlo (CGMC) method is a multi-scale stochastic mathematical and simulation framework for spatially distributed systems. CGMC simulations are important too...
145
Voted
ITNG
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...