Sciweavers

1469 search results - page 157 / 294
» Characterizing the Structural Complexity of Real-World Compl...
Sort
View
WDAG
2000
Springer
87views Algorithms» more  WDAG 2000»
14 years 1 months ago
A Probabilistically Correct Leader Election Protocol for Large Groups
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
Indranil Gupta, Robbert van Renesse, Kenneth P. Bi...
CAL
2002
13 years 10 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally
IEEECIT
2009
IEEE
13 years 8 months ago
Dynamic Adaptation of the Master-Worker Paradigm
Abstract--The size, heterogeneity and dynamism of the execution platforms of scientific applications, like computational grids, make using those platforms complex. Furthermore, tod...
Françoise André, Guillaume Gauvrit, ...
CORR
2011
Springer
339views Education» more  CORR 2011»
13 years 5 months ago
Context Capture in Software Development
The context of a software developer is something hard to define and capture, as it represents a complex network of elements across different dimensions that are not limited to th...
Bruno Antunes, Francisco Correia, Paulo Gomes
PDP
2008
IEEE
14 years 4 months ago
Routing Performance in a Hierarchical DHT-based Overlay Network
The scalability properties of DHT based overlay networks is considered satisfactory. However, in large scale systems this might still cause a problem since they have a logarithmic...
Isaías Martinez-Yelmo, Rubén Cuevas ...