210 search results - page 19 / 42 » A Scalable Parallel Graph Coloring Algorithm for Distributed... |
FTTCS
2006
13 years 7 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
HIPC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Parallelizing a sequential algorithm—i.e., manually or automatically converting it into an equivalent parallel distributed algorithm—is an important problem. Ideally,...
ICPADS
2005
IEEE
14 years 1 months ago
2005
IEEE
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse line...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We consider approaches that allow task migration for scheduling recurrent directed-acyclic-graph (DAG) tasks on symmetric, shared-memory multiprocessors (SMPs) in order t...