183 search results - page 13 / 37 » Linear-Time Algorithms in Memory Hierarchies |
153
click to vote
ICDCN
2011
Springer
14 years 1 months ago
2011
Springer
Distributed processing of real-world graphs is challenging due to their size and the inherent irregular structure of graph computations. We present HIPG, a distributed framework th...
MICRO
2006
IEEE
15 years 3 months ago
2006
IEEE
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
PLDI
2010
ACM
15 years 2 months ago
2010
ACM
This paper presents a novel optimizing compiler for general purpose computation on graphics processing units (GPGPU). It addresses two major challenges of developing high performa...
PPOPP
1999
ACM
15 years 1 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...
HPCC
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a new algorithm for computing the singular value decomposition (SVD) on multilevel memory hierarchy architectures. This algorithm is based on one-sided JRS iter...