Sciweavers

1055 search results - page 103 / 211
» Computing Real Time Jobs in P2P Networks
Sort
View
PPOPP
1999
ACM
15 years 8 months ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
DCOSS
2007
Springer
15 years 8 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
HPDC
2007
IEEE
15 years 10 months ago
Failure-aware checkpointing in fine-grained cycle sharing systems
Fine-Grained Cycle Sharing (FGCS) systems aim at utilizing the large amount of idle computational resources available on the Internet. Such systems allow guest jobs to run on a ho...
Xiaojuan Ren, Rudolf Eigenmann, Saurabh Bagchi
ECAL
2001
Springer
15 years 8 months ago
The Shifting Network: Volume Signalling in Real and Robot Nervous Systems
This paper presents recent work in computational modelling of diffusing gaseous neuromodulators in biological nervous systems. It goes on to describe work in adaptive autonomous sy...
Phil Husbands, Andrew Philippides, Tom Smith, Mich...
PAM
2005
Springer
15 years 9 months ago
New Methods for Passive Estimation of TCP Round-Trip Times
We propose two methods to passively measure and monitor changes in round-trip times (RTTs) throughout the lifetime of a TCP connection. Our first method associates data segments w...
Bryan Veal, Kang Li, David K. Lowenthal