Sciweavers

620 search results - page 49 / 124
» Optimizing the BSD routing system for parallel processing
Sort
View
IPPS
2007
IEEE
14 years 3 months ago
PON: Exploiting Proximity on Overlay Networks
We define a proximity overlay network (PON) which allow to realize DHT systems whose aim is to combine routing efficiency – i.e. an optimal degree/diameter tradeoff – and pr...
Gennaro Cordasco, Alberto Negro, Alessandra Sala, ...
DCOSS
2011
Springer
12 years 8 months ago
Transmission Control Policy design for decentralized detection in sensor networks
—A Wireless Sensor Network (WSN) deployed for detection applications has the distinguishing feature that sensors cooperate to perform the detection task. Therefore, the decoupled...
Ashraf Tantawy, Xenofon D. Koutsoukos, Gautam Bisw...
ICDCS
1996
IEEE
14 years 29 days ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg
CLUSTER
2005
IEEE
14 years 2 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
PVM
2005
Springer
14 years 2 months ago
New User-Guided and ckpt-Based Checkpointing Libraries for Parallel MPI Applications
We present design and implementation details as well as performance results for two new parallel checkpointing libraries developed by us for parallel MPI applications. The first o...
Pawel Czarnul, Marcin Fraczak