Sciweavers

19 search results - page 2 / 4
» Average case analysis of DJ graphs
Sort
View
IPPS
2007
IEEE
13 years 11 months ago
Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
Juan Paulo Alvarado-Magaña, José Alb...
TSP
2010
13 years 2 days ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
11 years 7 months ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...
STACS
2004
Springer
13 years 10 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
IEEEPACT
2003
IEEE
13 years 10 months ago
Constraint Graph Analysis of Multithreaded Programs
This paper presents a framework for analyzing the performance of multithreaded programs using a model called a constraint graph. We review previous constraint graph definitions fo...
Harold W. Cain, Mikko H. Lipasti, Ravi Nair