dc.contributor.author | Busch, Costas | en |
dc.contributor.author | Mavronicolas, Marios | en |
dc.contributor.author | Spirakis, Paul G. | en |
dc.contributor.editor | Peleg D. | en |
dc.contributor.editor | Sibeyn J. | en |
dc.creator | Busch, Costas | en |
dc.creator | Mavronicolas, Marios | en |
dc.creator | Spirakis, Paul G. | en |
dc.date.accessioned | 2019-11-13T10:38:51Z | |
dc.date.available | 2019-11-13T10:38:51Z | |
dc.date.issued | 2005 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/53669 | |
dc.description.abstract | The 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.source | Structural Information and Communication Complexity | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-13844256855&doi=10.1016%2fj.tcs.2004.04.018&partnerID=40&md5=2d0154d15a1002bf571646b7dbdf9a20 | |
dc.subject | Algebra | en |
dc.subject | Distributed computer systems | en |
dc.subject | Distributed computing | en |
dc.subject | Synchronization | en |
dc.subject | Lower bounds | en |
dc.subject | Costs | en |
dc.subject | Switching networks | en |
dc.subject | Computer science | en |
dc.subject | Data structures | en |
dc.subject | Distributing computing | en |
dc.subject | Linearizability | en |
dc.subject | Monotone Linearizability Lemma | en |
dc.title | The cost of concurrent, low-contention Read&Modify&Write | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1016/j.tcs.2004.04.018 | |
dc.description.volume | 333 | |
dc.description.issue | 3 | |
dc.description.startingpage | 373 | |
dc.description.endingpage | 400 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Article | en |
dc.description.notes | <p>Conference code: 64317 | en |
dc.description.notes | Cited By :4</p> | en |
dc.source.abbreviation | Theor.Comput.Sci. | en |
dc.contributor.orcid | Busch, Costas [0000-0002-4381-4333] | |
dc.contributor.orcid | Spirakis, Paul G. [0000-0001-5396-3749] | |
dc.gnosis.orcid | 0000-0002-4381-4333 | |
dc.gnosis.orcid | 0000-0001-5396-3749 | |