321 search results - page 32 / 65 » Implementing Randomized Matrix Algorithms in Parallel and Di... |
133
click to vote
IOPADS
1997
15 years 3 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
135
click to vote
TC
2010
15 years 22 days ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
109
click to vote
JSSPP
2004
Springer
15 years 7 months ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
121
click to vote
ISPAN
1999
IEEE
15 years 6 months ago
1999
IEEE
A Distributed Clustering Algorithm DCA and a Distributed Mobility-Adaptive Clustering DMAC algorithm are presented that partition the nodes of a fully mobile network ad hoc networ...
147
Voted
CCGRID
2011
IEEE
14 years 6 months ago
2011
IEEE
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...