2110 search results - page 267 / 422 » What is the complexity of a distributed computing system |
144
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
149
click to vote
IMC
2010
ACM
15 years 2 months ago
2010
ACM
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...
172
Voted
UML
2005
Springer
15 years 10 months ago
2005
Springer
Autonomic computer systems aim to reduce the configuration, operational, and maintenance costs of distributed applications by enabling them to self-manage, self-heal, self-optimiz...
127
click to vote
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
We study coalitional games where the value of cooperation among the agents are solely determined by the attributes the agents possess, with no assumption as to how these attribute...
137
click to vote
ASAP
2003
IEEE
15 years 10 months ago
2003
IEEE
On-chip implementation of multiprocessor systems requires the planarization of the interconnect network onto the silicon floorplan. Manual floorplanning approaches will become i...