Sciweavers

285 search results - page 41 / 57
» PODC: Paradigm-Oriented Distributed Computing
Sort
View
PODC
1989
ACM
14 years 25 days ago
Knowledge, Probability, and Adversaries
: What should it mean for an agent to know or believe an assertion is true with probability :99? Di erent papers FH88, FZ88, HMT88] give di erent answers, choosing to use quite di ...
Joseph Y. Halpern, Mark R. Tuttle
PODC
2011
ACM
12 years 11 months ago
From bounded to unbounded concurrency objects and back
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
Yehuda Afek, Adam Morrison, Guy Wertheim
PODC
1994
ACM
14 years 27 days ago
Using Belief to Reason about Cache Coherence
The notion of belief has been useful in reasoning about authentication protocols. In this paper, we show how the notion of belief can be applied to reasoning about cache coherence...
Lily B. Mummert, Jeannette M. Wing, Mahadev Satyan...
PODC
2010
ACM
14 years 21 days ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
PODC
2012
ACM
11 years 11 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya