Share This Author
Transactional scheduling for read-dominated workloads
A Provably Starvation-Free Distributed Directory Protocol
COMBINE is presented, a distributed directory protocol for shared objects, designed for large-scale distributed systems, and the correctness of the protocol, including starvation freedom, is proved, despite asynchrony and concurrent requests.
Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory
A lower bound of Ω(t) is proved on the number of writes needed in order to implement a read-only transaction of t items, which successfully terminates in a disjoint-access parallel TM implementation, which assumes strict serializability and thus hold under the assumption of opacity.
Optimal propagation-based protocols implementing causal memories
An optimality criterion for a protocol P, based on a complete replication of variables at each process and propagation of write updates, that enforces causal consistency is introduced and it is proved that the optimal protocol embeds a system of vector clocks which captures the read/write semantics of a causal memory.
Tethyan Cenomanian pelagic rhythmic sedimentation and Pleistocene Mediterranean sapropels: is the biotic signal comparable?
Exclusive Perpetual Ring Exploration without Chirality
This paper investigates both the minimal and the maximal number of robots that are necessary and sufficient to solve the exclusive perpetual exploration problem with mobile anonymous and oblivious robots in a discrete space.
Directory Protocols for Distributed Transactional Memory
This chapter describes directory protocols for large-scale distributed systems and discusses the subtleties of incorporating them in a large- scale distributed transactional memory.
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
- Antonio Fernández, Alessia Milani, Miguel A. Mosteiro, S. Zaks
- Computer Science, MathematicsDistributed Computing
- 13 September 2010
Results show that the gap in time complexity between oblivious and quasi-oblivious protocols is almost linear, and this gap is what is called the profit of global synchrony since it represents the gain the network obtains fromglobal synchrony with respect to not having it.
About the Efficiency of Partial Replication to Implement Distributed Shared Memory
- J. Hélary, Alessia Milani
- Computer ScienceInternational Conference on Parallel Processing…
- 14 August 2006
This paper considers PRAM, a consistency criterion weaker enough to allow efficient partial replication implementations and strong enough to solve interesting problems, and illustrates the power of PRAM with the Bellman-Ford shortest path algorithm.
Weakly-Persistent Causal Objects in Dynamic Distributed Systems
- R. Baldoni, M. Malek, Alessia Milani, S. Piergiovanni
- Computer Science25th IEEE Symposium on Reliable Distributed…
- 2 October 2006
The paper introduces the notion of weak persistency that guarantees persistency of values when a system becomes quiescent (arrivals and departures subside) and an implementation of a weakly-persistent object ensuring causal consistency is provided along with its correctness proof.