Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ido Ben-Zvi

dblp:99/8374 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Distributed computing theory · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed computing theory › event ordering
happened-before relation
0.212014
Beyond Lamport's Happened-before: On Time Bounds and the Ordering of Events in Distributed Systems · J. ACM 2014

Methods — techniques the papers use, named apart from their topics

knowledge-based analysis · 0.2
YearPublicationVenuePosition
2014 Beyond Lamport's Happened-before: On Time Bounds and the Ordering of Events in Distributed Systems
abstract
The coordination of a sequence of actions, to be performed in a linear temporal order in a distributed system, is studied. While in asynchronous message-passing systems such ordering of events requires the construction of message chains based on Lamport's happened-before relation, this is no longer true in the presence of time bounds on message delivery. Given such bounds, the mere passage of time can provide information about the occurrence of events at remote sites, without the need for explicit confirmation. A new causal structure called the centipede is introduced, and it is shown that centipedes must exist in every execution where linear ordering of actions is ensured. Centipedes capture the subtle interplay between the explicit information obtained via message chains, and the indirectly derived information gained by the passage of time, given the time bounds. Centipedes are defined using two relations. One is called syncausality, a slight generalisation of the happened-before relation. The other is a novel bound guarantee relation among events, that is based on the bounds on message transmission. In a precise sense, centipedes play a role in the synchronous setting analogous to that played by message chains in asynchronous systems. Our study is based on a knowledge-based analysis of distributed coordination. Temporally linear coordination is reduced to nested knowledge (knowledge about knowledge). Obtaining nested knowledge of a spontaneous event is, in turn, shown to require the existence of an appropriate centipede.
Ido Ben-Zvi, Yoram Moses
J. ACM1
2013 The Shape of Reactive Coordination Tasks
Ido Ben-Zvi, Yoram Moses
TARK1
2011 Known unknowns: time bounds and knowledge of ignorance
abstract
This paper studies the role that known bounds on message transmission times in a computer network play on the evolution of the epistemic state over time. A connection to cones of causal influence analogous to, and more general than, light cones is presented. Focusing on lower bounds on message transmission times, an analysis is presented of how knowledge about when others are guaranteed to be ignorant about an event of interest ("knowing that they don't know") can arise. This has implications in competitive settings, in which knowing about another's ignorance can provide an advantage.
Ido Ben-Zvi, Yoram Moses
TARK1
2010 Beyond Lamport's Happened-Before: On the Role of Time Bounds in Synchronous Systems
Ido Ben-Zvi, Yoram Moses
DISC1