NDLI: From bounded to unbounded concurrency objects and back

Please wait, while we are loading the content...

Coordinated consensus in dynamic networks

Distributed graph coloring in a few rounds

The complexity of robust atomic storage

On the power of hardware transactional memory to simplify memory management

Distributed deterministic edge coloring using bounded neighborhood independence

Compact policy routing

Adaptively secure broadcast, revisited

Distributed k-core decomposition

Transforming worst-case optimal solutions for simultaneous tasks into all-case optimal solutions

A tight unconditional lower bound on distributed randomwalk computation

The universe of symmetry breaking tasks

Xheal: localized self-healing using expanders

Scalability versus semantics of concurrent FIFO queues

Tight bounds on information dissemination in sparse mobile networks

Error-free multi-valued consensus with byzantine failures

Resilience of mutual exclusion algorithms to transient memory faults

A complexity separation between the cache-coherent and distributed shared memory models

The space complexity of long-lived and one-shot timestamp implementations

Locally checkable proofs

Scalable rational secret sharing

Fork-consistent constructions from registers

Optimal-time adaptive strong renaming, with applications to counting

Minimum congestion mapping in a cloud

Rationality authority for provable rational behavior

Fast and compact self stabilizing verification, computation, and fault detection of an MST

Distributed computing with rules of thumb

Order optimal information spreading using algebraic gossip

Byzantine agreement with homonyms

Toward more localized local algorithms: removing assumptions concerning global knowledge

Structuring unreliable radio networks

From bounded to unbounded concurrency objects and back

Fault-tolerant spanners: better and simpler

Analyzing consistency properties for fun and profit

Unbounded contention resolution in multiple-access channels

The round complexity of distributed sorting: extended abstract

Conflict on a communication channel

Secure data structures based on multi-party computation

Stability of a peer-to-peer communication system

Incentive-compatible distributed greedy protocols

Time-efficient randomized multiple-message broadcast in radio networks

The impact of memory models on software reliability in multiprocessors

Tracking distributed aggregates over time-based sliding windows

Robust network supercomputing without centralized control

Sustaining collaboration in multicast despite rational collusion

Faster information dissemination in dynamic networks via network coding

Accurate byzantine agreement with feedback

On the hardness and approximation of minimum topic-connected overlay

Reliable end-user communication under a changing packet network protocol

B-neck: a distributed and quiescent max-min fair algorithm

A generalization of multiple choice balls-into-bins

Securing social networks

Information dissemination on multiple channels

A theory of goal-oriented communication

Parallel and distributed programming extensions for mainstream languages based on pi-calculus

Robust data sharing with key-value stores

A nonblocking set optimized for querying the minimum value

Network synchronization and localization based on stolen signals

Time bounds for shared objects in partially synchronous systems

Validity bound of regular registers with churn and byzantine processes

The inherent difficulty of timely primary-backup replication

Easy impossibility proofs for k-set agreement in message passing systems

Randomized compact routing in decomposable metrics

Solving the at-most-once problem with nearly optimal effectiveness

Partial reversal acyclicity

From bounded to unbounded concurrency objects and back

Content Provider	ACM Digital Library
Author	Wertheim, Guy Afek, Yehuda Morrison, Adam
Abstract	We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may increase without bound. By studying this model we obtain new results and observations that are relevant and meaningful to the standard bounded concurrency model. First we resolve an open problem from 2006 and provide, contrary to what was conjectured, an unbounded concurrency wait-free implementation of a swap object from 2-consensus objects. This construction resolves another puzzle that has eluded us for a long time, that of considerably simplifying a 16 year old complicated bounded concurrency swap construction. A further insight to the traditional bounded concurrency model that we obtain by studying the unbounded concurrency model, is a refinement of the top level of the wait-free hierarchy, the class of infinite-consensus number objects. First we resolve an open question of Merritt and Taubenfeld from 2003, showing that having n-consensus objects for all n does not imply consensus under unbounded concurrency. I.e., consensus alone, treated as a black box, cannot be "boosted" in this way. We continue to show an infinite-number consensus object that while able to perform consensus for any n-bounded concurrency (n unknown in advance) cannot solve consensus in the face of unbounded concurrency. This divides the infinite-consensus class of objects into two, those that can solve consensus for unbounded concurrency, and those that cannot.
Starting Page	119
Ending Page	128
Page Count	10
File Format	PDF
ISBN	9781450307192
DOI	10.1145/1993806.1993823
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2011-06-06
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Swap Unbounded concurrency Common2 Wait-free Consensus
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in