Show simple item record

dc.contributor.authorEnglert, B.en
dc.contributor.authorGeorgiou, Chryssisen
dc.contributor.authorMusiał, Peter M.en
dc.contributor.authorNicolaou, Nicolas C.en
dc.contributor.authorShvartsman, A. A.en
dc.creatorEnglert, B.en
dc.creatorGeorgiou, Chryssisen
dc.creatorMusiał, Peter M.en
dc.creatorNicolaou, Nicolas C.en
dc.creatorShvartsman, A. A.en
dc.date.accessioned2019-11-13T10:39:59Z
dc.date.available2019-11-13T10:39:59Z
dc.date.issued2009
dc.identifier.issn0302-9743
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/53895
dc.description.abstractThis paper considers quorum-replicated, multi-writer, multi-reader (MWMR) implementations of survivable atomic registers in a distributed message-passing system with processors prone to failures. Previous implementations in such settings invariably required two rounds of communication between readers/writers and replica owners. Hence the question arises whether it is possible to have single round read and/or write operations in this setting. We thus devise an algorithm, called Sfw, that exploits a new technique called server side ordering (SSO), which -unlike previous approaches- places partial responsibility for the ordering of write operations on the replica owners (the servers). With SSO, fast write operations are introduced for the very first time in the MWMR setting. We prove that our algorithm preserves atomicity in all permissible executions. While algorithm SFW shows that in principle fast writes are possible, we also show that under certain conditions the MWMR model imposes inherent limitations on any quorum-based fast write implementation of a safe read/write register and potentially even restricts the number of writer participants in the system. In this case our algorithm achieves near optimal efficiency. © 2009 Springer-Verlag.en
dc.source13th International Conference on Principles of Distributed Systems, OPODIS 2009en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-73049084212&doi=10.1007%2f978-3-642-10877-8_20&partnerID=40&md5=0c0f7e56c2755914fe212f34606ca1c1
dc.subjectAlgorithmsen
dc.subjectMessage passingen
dc.subjectServersen
dc.subjectDistributed Memoryen
dc.subjectMessage passing systemsen
dc.subjectInherent limitationsen
dc.subjectAtomic registeren
dc.subjectOptimal efficiencyen
dc.subjectRead/Write registersen
dc.subjectSanitary sewersen
dc.subjectWrite operationsen
dc.titleOn the efficiency of atomic multi-reader, multi-writer distributed memoryen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1007/978-3-642-10877-8_20
dc.description.volume5923 LNCSen
dc.description.startingpage240
dc.description.endingpage254
dc.author.faculty002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences
dc.author.departmentΤμήμα Πληροφορικής / Department of Computer Science
dc.type.uhtypeArticleen
dc.description.notes<p>Conference code: 78932en
dc.description.notesCited By :7</p>en
dc.source.abbreviationLect. Notes Comput. Sci.en
dc.contributor.orcidGeorgiou, Chryssis [0000-0003-4360-0260]
dc.gnosis.orcid0000-0003-4360-0260


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record