Sciweavers

PPOPP
2012
ACM
11 years 12 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
CLUSTER
2011
IEEE
12 years 4 months ago
Achieving Scalable Parallelization for the Hessenberg Factorization
—Much of dense linear algebra has been successfully blocked to concentrate the majority of its time in the Level 3 BLAS, which are not only efficient for serial computation, but...
Anthony M. Castaldo, R. Clint Whaley
ICPP
1989
IEEE
13 years 8 months ago
Efficient Serial and Parallel Algorithms for Median Filtering
We develop a serial algorithm for separable median filtering that requires only two comparisons per element when the window size is three. In addition, fast parallel CREW PRAM al...
Sanjay Ranka, Sartaj Sahni