Show simple item record

dc.contributor.authorHerlihy, Maurice
dc.contributor.authorShavit, Nir N.
dc.date.accessioned2012-10-11T20:02:17Z
dc.date.available2012-10-11T20:02:17Z
dc.date.issued2011-12
dc.date.submitted2011-12
dc.identifier.isbn978-3-642-25872-5
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.urihttp://hdl.handle.net/1721.1/73900
dc.description15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedingsen_US
dc.description.abstractWe identify a simple relationship that unifies seemingly unrelated progress conditions ranging from the deadlock-free and starvation-free properties common to lock-based systems, to non-blocking conditions such as obstruction-freedom, lock-freedom, and wait-freedom. Properties can be classified along two dimensions based on the demands they make on the operating system scheduler. A gap in the classification reveals a new non-blocking progress condition, weaker than obstruction-freedom, which we call clash-freedom. The classification provides an intuitively-appealing explanation why programmers continue to devise data structures that mix both blocking and non-blocking progress conditions. It also explains why the wait-free property is a natural basis for the consensus hierarchy: a theory of shared-memory computation requires an independent progress condition, not one that makes demands of the operating system scheduler.en_US
dc.language.isoen_US
dc.publisherSpringer Berlin / Heidelbergen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/978-3-642-25873-2_22en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceOther Repositoryen_US
dc.titleOn the nature of progressen_US
dc.typeArticleen_US
dc.identifier.citationHerlihy, Maurice, and Nir Shavit. “On the Nature of Progress.” Principles of Distributed Systems. Ed. Antonio Fernàndez Anta, Giuseppe Lipari, & Matthieu Roy. LNCS Vol. 7109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 313–328. Web. 11 Oct. 2012.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorShavit, Nir N.
dc.relation.journalPrinciples of Distributed Systemsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsHerlihy, Maurice; Shavit, Niren
dc.identifier.orcidhttps://orcid.org/0000-0002-4552-2414
mit.licenseOPEN_ACCESS_POLICYen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record