1022 search results - page 8 / 205 » Automatic data and computation decomposition on distributed ... |
NIPS
2007
13 years 9 months ago
2007
Support Vector Machines (SVMs) suffer from a widely recognized scalability problem in both memory use and computational time. To improve scalability, we have developed a parallel ...
PPOPP
1999
ACM
13 years 11 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
IPPS
1997
IEEE
1997
IEEE
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
13 years 11 months ago
We present a fast and scalable matrix multiplication algorithm on distributed memory concurrent computers, whose performance is independent of data distribution on processors, and...
ISVC
2009
Springer
14 years 2 months ago
2009
Springer
In this work we describe a parallel implementation of the Poisson Surface Reconstruction algorithm based on multigrid domain decomposition. We compare implementations using differ...
ISPAN
1996
IEEE
13 years 11 months ago
1996
IEEE
In this paper, we have presented the design and evaluation of a compiler system, called APE,for automatic parallelization of scientific and engineering applications on distributed...