36 search results - page 3 / 8 » Hypergraph Partitioning for Faster Parallel PageRank Computa... |
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--With the development of high-performance computing, I/O issues have become the bottleneck for many massively parallel applications. This paper investigates scalable paral...
ISCA
1998
IEEE
13 years 9 months ago
1998
IEEE
Much of the improvement in computer performance over the last twenty years has come from faster transistors and architectural advances that increase parallelism. Historically, par...
EGH
2011
Springer
12 years 5 months ago
2011
Springer
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
ICPP
1995
IEEE
13 years 8 months ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
IPPS
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...