Change search
ReferencesLink to record
Permanent link

Direct link
A fault-tolerant sequentially consistent DSM with a compositional correctness proof
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.
KTH, School of Information and Communication Technology (ICT), Software and Computer systems, SCS.ORCID iD: 0000-0002-6718-0144
2016 (English)In: 4th International Conference on Networked Systems, NETYS 2016, Springer, 2016, 183-192 p.Conference paper (Refereed)
Abstract [en]

We present the SC-ABD algorithm that implements sequentially consistent distributed shared memory (DSM). The algorithm tolerates that less than half of the processes are faulty (crash-stop). Compared to the multi-writer ABD algorithm, SC-ABD requires one instead of two round-trips of communication to perform a write operation, and an equal number of round-trips (two) to perform a read operation. Although sequential consistency is not a compositional consistency condition, the provided correctness proof is compositional.

Place, publisher, year, edition, pages
Springer, 2016. 183-192 p.
Keyword [en]
Artificial intelligence, Computer science, Computers, Consistency conditions, Correctness proofs, Crash stop, Distributed shared memory, Fault-tolerant, Read operation, Sequential consistency, Write operations, Memory architecture
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-195476DOI: 10.1007/978-3-319-46140-3_14ScopusID: 2-s2.0-84990042048ISBN: 9783319461397OAI: oai:DiVA.org:kth-195476DiVA: diva2:1047756
Conference
18 May 2016 through 20 May 2016
Note

QC 20161118

Available from: 2016-11-18 Created: 2016-11-03 Last updated: 2016-11-18Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Ekström, NiklasHaridi, Seif
By organisation
Software and Computer systems, SCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 5 hits
ReferencesLink to record
Permanent link

Direct link