1761 search results - page 108 / 353 » Parallel timing simulation on a distributed memory multiproc... |
PAMI
2011
14 years 26 days ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
HPCA
1998
IEEE
14 years 10 months ago
1998
IEEE
The goal of this paper is to gain insight into the relative performance of communication mechanisms as bisection bandwidth and network latency vary. We compare shared memory with ...
HIPC
1999
Springer
14 years 10 months ago
1999
Springer
The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects a...
IPPS
1998
IEEE
14 years 10 months ago
1998
IEEE
We have built an eight node SMP cluster called COMPaS (Cluster Of Multi-Processor Systems), each node of which is a quadprocessor Pentium Pro PC. We have designed and implemented a...
IPPS
2008
IEEE
15 years 10 days ago
2008
IEEE
The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov Chain Mont...