84 search results - page 10 / 17 » A Parallel Distance-2 Graph Coloring Algorithm for Distribut... |
ICPADS
2005
IEEE
14 years 9 days 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 1 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...
IPPS
2002
IEEE
13 years 11 months ago
2002
IEEE
Multiple memory module architecture enjoys higher memory access bandwidth and thus higher performance. Two key problems in gaining high performance in this kind of architecture ar...
SC
1990
ACM
13 years 10 months ago
1990
ACM
Loop distribution is an integral part of transforming a sequential program into a parallel one. It is used extensively in parallelization,vectorization, and memory management. For...
ICPP
1999
IEEE
13 years 11 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...