4155 search results - page 69 / 831 » External Memory Algorithms |
132
Voted
EUROPAR
2005
Springer
15 years 7 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
120
click to vote
ALGORITHMICA
2006
15 years 2 months ago
2006
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
216
click to vote
APDC
1997
15 years 3 months ago
1997
Delaunaytriangulationhas beenmuchusedin suchapplicationsas volumerendering, shape representation, terrain modeling and so on. The main disadvantage of Delaunay triangulationis lar...
128
click to vote
IEEEPACT
1999
IEEE
15 years 6 months ago
1999
IEEE
Image processing applications tend to access their data non-sequentially and reuse that data infrequently. As a result, they tend to perform poorly on conventional memory systems ...
126
click to vote
OPODIS
2003
15 years 3 months ago
2003
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...