416 search results - page 53 / 84 » A Paradigm for Parallel Matrix Algorithms: |
144
click to vote
SIAMSC
2010
14 years 10 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
116
click to vote
EUROPAR
2007
Springer
15 years 10 months ago
2007
Springer
In this work we study preference systems suitable for the Peer-to-Peer paradigm. Most of them fall in one of the three following categories: global, symmetric and complementary. Al...
134
click to vote
CCGRID
2001
IEEE
15 years 7 months ago
2001
IEEE
Global Computing achieves high throughput computing by harvesting a very large number of unused computing resources connected to the Internet. This parallel computing model target...
115
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradi...
134
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...