1434 search results - page 146 / 287 » Distributed Computing with Imperfect Randomness |
103
click to vote
PDP
2008
IEEE
15 years 6 months ago
2008
IEEE
The match between a peer-to-peer overlay and the physical Internet infrastructure is a constant issue. Time-constrained peer-to-peer applications such as live streaming systems ar...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
81
Voted
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
A general approach to achieve anonymity on P2P networks is to construct an indirect path between client and server for each data transfer. The indirection, together with randomnes...
ACSC
2005
IEEE
15 years 5 months ago
2005
IEEE
We examine the robustness of critical infrastructure networks in the face of terrorist attack, using a simulation experiment that incorporates link capacity; and an extension of d...
ICPP
2005
IEEE
15 years 5 months ago
2005
IEEE
We propose a novel replication-based two-phase scheduling algorithm designed to achieve DAG scheduling with small makespans and high efficiency. In the first phase, the schedule...