Sciweavers

1095 search results - page 102 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
116
Voted
COCO
2001
Springer
108views Algorithms» more  COCO 2001»
15 years 7 months ago
Bounded Query Functions with Limited Output Bits
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
Richard Chang, Jon S. Squire
98
Voted
PDP
2007
IEEE
15 years 9 months ago
SockMi: a solution for migrating TCP/IP connections
SockMi is a solution for the migration of TCP/IP connections between Linux systems. Only the migrating peer of the connection needs to reside on a Linux system. The migration is c...
Massimo Bernaschi, Francesco Casadei, Paolo Tassot...
112
Voted
PODC
2003
ACM
15 years 8 months ago
Adapting to a reliable network path
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
Baruch Awerbuch, Yishay Mansour
IPPS
2002
IEEE
15 years 7 months ago
A New Estimation Method for Distributed Java Object Activity
We introduce a new method to estimate the Java object activity in a distributed context of irregular applications. This method uses an observation mechanism which is itself a part...
Amer Bouchi, Richard Olejnik, Bernard Toursel
105
Voted
EUROPAR
2007
Springer
15 years 6 months ago
Fast and Efficient Total Exchange on Two Clusters
Abstract. Total Exchange is one of the most important collective communication patterns for scientific applications. In this paper we propose an algorithm called LG for the total e...
Emmanuel Jeannot, Luiz Angelo Steffenel