Sciweavers

1434 search results - page 146 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
PDP
2008
IEEE
14 years 4 months ago
Internet-Scale Simulations of a Peer Selection Algorithm
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...
Ali Boudani, Yiping Chen, Gilles Straub, Gwendal S...
IPPS
2007
IEEE
14 years 4 months ago
Analyzing the Scalability of Graph Algorithms on Eldorado
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...
Keith D. Underwood, Megan Vance, Jonathan W. Berry...
IPPS
2006
IEEE
14 years 4 months ago
Shubac: a searchable P2P network utilizing dynamic paths for client/server anonymity
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...
A. Brodie, Cheng-Zhong Xu, Weisong Shi
ACSC
2005
IEEE
14 years 3 months ago
Simulating Network Robustness for Critical Infrastructure Networks
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...
Anthony H. Dekker
ICPP
2005
IEEE
14 years 3 months ago
A Task Duplication Based Scheduling Algorithm Using Partial Schedules
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...
Doruk Bozdag, Füsun Özgüner, Eylem ...