Abstract
The assumption of the existence of global time, which significantly simplifies the analysis of distributed systems, is generally safe since most of the conclusions obtained under the global time axiom can be transferred to the frame where no such assumption is made. In this note, it was shown that the compositionality of the well-known correctness condition for concurrent objects called linearizability does not satisfy this simplification rule. A simple non-linearizable system composed of two objects which are individually linearizable was presented.
| Original language | English |
|---|---|
| Pages (from-to) | 19-24 |
| Number of pages | 6 |
| Journal | Parallel Processing Letters |
| Volume | 13 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Jan 2003 |
Keywords
- Compositionality
- Concurrency
- Distributed system
- Global time
- Linearizability
- Shared memory