The entropy of a distributed computation random number generation from memory interleaving
DOI10.1007/s00446-017-0311-5zbMath1451.68035OpenAlexW2760515460WikidataQ60020008 ScholiaQ60020008MaRDI QIDQ1656885
Rachid Guerraoui, Julien Stainer, Karolos Antoniadis, Peva Blanchard
Publication date: 10 August 2018
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-017-0311-5
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Measures of information, entropy (94A17) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A limitation of vector timestamps for reconstructing distributed computations
- On interprocess communication. II: Algorithms
- Generating quasi-random sequences from semi-random sources
- A solution of the cache ping-pong problem in multiprocessor systems
- Randomness is linear in space
- Lock-Free Algorithms under Stochastic Schedulers
- Concurrent Programming: Algorithms, Principles, and Foundations
- Are Lock-Free Concurrent Algorithms Practically Wait-Free?
- Information, Physics, and Computation
- Time, clocks, and the ordering of events in a distributed system
- Geometry and concurrency: a user's guide
- Fast deterministic consensus in a noisy environment
- An introduction to Kolmogorov complexity and its applications
- The mutual exclusion problem
- The mutual exclusion problem
This page was built for publication: The entropy of a distributed computation random number generation from memory interleaving
