Sciweavers

4045 search results - page 466 / 809
» Special Section on Parallel Distributed Computing and Networ...
Sort
View
ICPP
2003
IEEE
15 years 10 months ago
A Recovery Algorithm for Reliable Multicasting in Reliable Networks
Any reliable multicast protocol requires some recovery mechanism. A generic description of a recovery mechanism consists of a prioritized list of recovery servers/receivers (clien...
Danyang Zhang, Sibabrata Ray, Rajgopal Kannan, S. ...
IPPS
2003
IEEE
15 years 10 months ago
An Extended Link Reversal Protocol in Dynamic Networks
— We consider the problem of maintaining routing paths between nodes in a dynamic network. Gafni and Bertsekas proposed a link reversal approach called the BG method that maintai...
Jie Wu, Fei Dai
DCOSS
2010
Springer
15 years 9 months ago
Halo: Managing Node Rendezvous in Opportunistic Sensor Networks
One vision of an opportunistic sensor network (OSN) uses sensor access points (SAPs) to assign mobile sensors with sensing tasks submitted by applications that could be running any...
Shane B. Eisenman, Hong Lu, Andrew T. Campbell
IPPS
2000
IEEE
15 years 9 months ago
Job Scheduling that Minimizes Network Contention due to both Communication and I/O
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performan...
Jens Mache, Virginia Mary Lo, Sharad Garg
IPPS
2000
IEEE
15 years 9 months ago
Using Time Skewing to Eliminate Idle Time due to Memory Bandwidth and Network Limitations
Time skewing is a compile-time optimization that can provide arbitrarily high cache hit rates for a class of iterative calculations, given a sufficient number of time steps and s...
David Wonnacott