Sciweavers

1691 search results - page 188 / 339
» The Delayed k-Server Problem
Sort
View
PRIMA
2004
Springer
15 years 8 months ago
Handling Emergent Resource Use Oscillations
— Distributed computing systems are increasingly being created as self-organizing collections of many autonomous (human or software) agents cooperating as peers. Peer-to-peer coo...
Mark Klein, Richard Metzler, Yaneer Bar-Yam
140
Voted
WDAG
2004
Springer
86views Algorithms» more  WDAG 2004»
15 years 8 months ago
Message-Optimal and Latency-Optimal Termination Detection Algorithms for Arbitrary Topologies
An important problem in distributed systems is to detect termination of a distributed computation. A computation is said to have terminated when all processes have become passive ...
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri
ACSC
2003
IEEE
15 years 8 months ago
Policies for Sharing Distributed Probabilistic Beliefs
In this paper, we present several general policies for deciding when to share probabilistic beliefs between agents for distributed monitoring. In order to evaluate these policies,...
Christopher Leckie, Kotagiri Ramamohanarao
123
Voted
HOTOS
2003
IEEE
15 years 8 months ago
High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two
Peer-to-peer storage aims to build large-scale, reliable and available storage from many small-scale unreliable, low-availability distributed hosts. Data redundancy is the key to ...
Charles Blake, Rodrigo Rodrigues
ITC
2002
IEEE
81views Hardware» more  ITC 2002»
15 years 7 months ago
Design Rewiring Using ATPG
—Logic optimization is the step of the very large scale integration (VLSI) design cycle where the designer performs modifications on a design to satisfy different constraints suc...
Andreas G. Veneris, Magdy S. Abadir, Mandana Amiri