Sciweavers

478 search results - page 41 / 96
» Diameter and Center Computations in Networks
Sort
View
SPAA
2004
ACM
15 years 5 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
ICC
2007
IEEE
106views Communications» more  ICC 2007»
15 years 6 months ago
A Distributed Approach to End-to-End Network Topology Inference
Abstract— To construct an efficient overlay network, the information of underlay is important. However, the inference of an underlay topology is not easy. We consider using end-...
Xing Jin, Qiuyan Xia, Shueng-Han Gary Chan
IPPS
2000
IEEE
15 years 4 months ago
Sorting on the OTIS-Mesh
In this paper we present sorting algorithms on the recently introduced N2 processor OTIS-Mesh, a network with diameter 4 p N , 3 consisting of N connected meshes of size p N  p N...
Andre Osterloh
PODC
2009
ACM
16 years 11 days ago
Tight bounds for clock synchronization
d Abstract] Christoph Lenzen Computer Engineering and Networks Laboratory (TIK) ETH Zurich, 8092 Zurich, Switzerland lenzen@tik.ee.ethz.ch Thomas Locher Computer Engineering and N...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
DSN
2000
IEEE
15 years 4 months ago
Experiences with Group Communication Middleware
Group communication is a widely studied paradigm for building fault-tolerant distributed systems. The Armada project at the University of Michigan is a collaborative effort with t...
Scott Johnson, Farnam Jahanian, Sunondo Ghosh, Bri...