Back to Search
Start Over
Leader-based de-anonymization of an anonymous read/write memory
- Source :
- Theoretical Computer Science, Theoretical Computer Science, 2020, 836, pp.110-123. ⟨10.1016/j.tcs.2020.07.027⟩, Theoretical Computer Science, Elsevier, 2020, 836, pp.110-123. ⟨10.1016/j.tcs.2020.07.027⟩
- Publication Year :
- 2020
- Publisher :
- Elsevier BV, 2020.
-
Abstract
- Anonymous shared memory is a memory in which processes use different names for the same shared read/write register. As an example, a shared register named A by a process p and a shared register named B by another process q can correspond to the very same register X, and similarly for the names B at p and A at q which can correspond to the same register \(Y\ne X\). Hence, there is a permanent disagreement on the register names among the processes. This new notion of anonymity was recently introduced by G. Taubenfeld (PODC 2017), who presented several memory-anonymous algorithms and impossibility results.
- Subjects :
- Register (sociolinguistics)
General Computer Science
De-anonymization
Computer science
[INFO.INFO-CE]Computer Science [cs]/Computational Engineering, Finance, and Science [cs.CE]
Concurrent algorithm
020207 software engineering
0102 computer and information sciences
02 engineering and technology
01 natural sciences
Theoretical Computer Science
Read-write memory
Shared memory
010201 computation theory & mathematics
Synchronization (computer science)
0202 electrical engineering, electronic engineering, information engineering
Mutual exclusion
Arithmetic
Impossibility
Hardware_REGISTER-TRANSFER-LEVELIMPLEMENTATION
ComputingMilieux_MISCELLANEOUS
Subjects
Details
- ISSN :
- 03043975 and 18792294
- Volume :
- 836
- Database :
- OpenAIRE
- Journal :
- Theoretical Computer Science
- Accession number :
- edsair.doi.dedup.....c4b814cffa33b7673aff65b3aef4929a
- Full Text :
- https://doi.org/10.1016/j.tcs.2020.07.027