Sciweavers

1095 search results - page 15 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
ICDCS
2012
IEEE
11 years 9 months ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang
ISPA
2007
Springer
14 years 1 months ago
Parallelization Strategies for the Points of Interests Algorithm on the Cell Processor
The Cell processor is a typical example of a heterogeneous multiprocessor-on-chip architecture that uses several levels of parallelism to deliver high performance. Closing the gap ...
Tarik Saidani, Lionel Lacassagne, Samir Bouaziz, T...
EUROPAR
2010
Springer
13 years 7 months ago
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
Marin Bougeret, Pierre-François Dutot, Klau...
ICPPW
2002
IEEE
14 years 10 days ago
A Statistical Approach for the Analysis of the Relation Between Low-Level Performance Information, the Code, and the Environment
This paper presents a methodology for aiding a scientific programmer to evaluate the performance of parallel programs on advanced architectures. It applies well-defined design o...
Nayda G. Santiago, Diane T. Rover, Domingo Rodr&ia...
WG
1997
Springer
13 years 11 months ago
Parallel Algorithms for Treewidth Two
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...
Babette de Fluiter, Hans L. Bodlaender