12301 search results - page 2294 / 2461 » Distributed Computation in Dynamic Networks |
142
click to vote
ICDCS
1999
IEEE
15 years 7 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
119
click to vote
ICS
1999
Tsinghua U.
15 years 7 months ago
1999
Tsinghua U.
This paper proposes a novel way to use virtual memorymapped communication (VMMC) to reduce the failover time on clusters. With the VMMC model, applications’ virtual address spac...
122
click to vote
DAC
1996
ACM
15 years 7 months ago
1996
ACM
1- A methodology is presented in this paper for determining an optimal set of clock path delays for designing high performance VLSI/ULSI-based clock distribution networks. This met...
131
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
143
click to vote
CLUSTER
2006
IEEE
15 years 7 months ago
2006
IEEE
Despite using high-speed network interconnection systems like InfiniBand, the communication overhead for parallel applications is still high. In this paper we show, how such costs...