186 search results - page 23 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
SPAA
1993
ACM
13 years 11 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
LSSC
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Air pollution models can efficiently be used in different environmental studies. The atmosphere is the most dynamic component of the environment, where the pollutants ca...
CLUSTER
2000
IEEE
13 years 7 months ago
2000
IEEE
Clusters of workstations and networked parallel computing systems are emerging as promising computational platforms for HPC applications. The processors in such systems are typica...
ASAP
2007
IEEE
14 years 1 months ago
2007
IEEE
We present a memory efficient, practical, systolic, parallel architecture for the complete 0/1 knapsack dynamic programming problem, including backtracking. This problem was inte...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...