242 search results - page 13 / 49 » Distributed algorithms with dynamical random transitions |
108
click to vote
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
ICPP
1998
IEEE
15 years 4 months ago
1998
IEEE
We address the problems of I/O scheduling and buffer management for general reference strings in a parallel I/O system. Using the standard parallel disk model withD disks and a sh...
104
click to vote
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
101
click to vote
CCGRID
2010
IEEE
15 years 24 days ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
113
click to vote
HYBRID
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. Networked embedded systems are composed of a large number of components that interact with the physical world via a set of sensors and actuators, have their own computati...