Show simple item record

dc.contributor.authorBusch, Costasen
dc.contributor.authorMavronicolas, Mariosen
dc.contributor.authorSpirakis, Paul G.en
dc.contributor.editorPeleg D.en
dc.contributor.editorSibeyn J.en
dc.creatorBusch, Costasen
dc.creatorMavronicolas, Mariosen
dc.creatorSpirakis, Paul G.en
dc.date.accessioned2019-11-13T10:38:51Z
dc.date.available2019-11-13T10:38:51Z
dc.date.issued2005
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/53669
dc.description.abstractThe possibility or impossibility and the corresponding costs of devising concurrent, low-contention implementations of atomic Read&Modify&Write (or RMW) operations in a distributed system were addressed. A natural class of monotone RMW operations associated with monotone groups was introduced. A certain class of algebraic groups was also presented. A Monotone Linearizability Lemma was proved and employed as a chief combinatorial instrument. It establishes inherent ordering constraints of linearizability for a certain class of executions of any distributed system implementing a monotone RMW operation. A lower bound on latency for switching networks that implement monotone groups was proved by using Monotone Linearizability Lemma.en
dc.sourceStructural Information and Communication Complexityen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-13844256855&doi=10.1016%2fj.tcs.2004.04.018&partnerID=40&md5=2d0154d15a1002bf571646b7dbdf9a20
dc.subjectAlgebraen
dc.subjectDistributed computer systemsen
dc.subjectDistributed computingen
dc.subjectSynchronizationen
dc.subjectLower boundsen
dc.subjectCostsen
dc.subjectSwitching networksen
dc.subjectComputer scienceen
dc.subjectData structuresen
dc.subjectDistributing computingen
dc.subjectLinearizabilityen
dc.subjectMonotone Linearizability Lemmaen
dc.titleThe cost of concurrent, low-contention Read&Modify&Writeen
dc.typeinfo:eu-repo/semantics/article
dc.identifier.doi10.1016/j.tcs.2004.04.018
dc.description.volume333
dc.description.issue3
dc.description.startingpage373
dc.description.endingpage400
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: 64317en
dc.description.notesCited By :4</p>en
dc.source.abbreviationTheor.Comput.Sci.en
dc.contributor.orcidBusch, Costas [0000-0002-4381-4333]
dc.contributor.orcidSpirakis, Paul G. [0000-0001-5396-3749]


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