The RedBlue Adaptive Universal Constructions

Fatourou, Panagiota; Kallimanis, Nikolaos D.

doi:10.1007/978-3-642-04355-0_15

Cited by 12 publications

(20 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fatourou and Kallimanis have presented in [10] a family of wait-free, adaptive, universal constructions, called RedBlue. The first algorithm (F-RedBlue) performed O(min{k, log n}) shared memory accesses, where k is the interval contention, i.e., the maximum number of processes that are active during the execution interval of any operation; the second (SRedBlue) used smaller objects than F-RedBlue and performed O(k) shared memory accesses.…”

Section: Introductionmentioning

confidence: 99%

A highly-efficient wait-free universal construction

Fatourou

Kallimanis

2011

Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures

Self Cite

103

113

View full text Add to dashboard Cite

We present a new simple wait-free universal construction, called Sim, that uses just a Fetch&Add and an LL/SC object and performs a constant number of shared memory accesses. We have implemented Sim in a real shared-memory machine. In theory terms, our practical version of Sim, called P-Sim, has worse complexity than its theoretical analog; in practice though, we experimentally show that P-Sim outperforms several state-of-the-art lock-based and lock-free techniques, and this given that it is wait-free, i.e., that it satisfies a stronger progress condition than all the algorithms it outperforms.We have used P-Sim to get highly-efficient wait-free implementations of stacks and queues. Our experiments show that our implementations outperform the currently stateof-the-art shared stack and queue implementations which ensure only weaker progress properties than wait-freedom.

show abstract

Section: Introductionmentioning

confidence: 99%

A highly-efficient wait-free universal construction

Fatourou

Kallimanis

2011

Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures

Self Cite

103

113

View full text Add to dashboard Cite

show abstract

“…The thread acquiring the lock services the pending requests of others in LIFO order, and afterwards removes them from the list. Flat combining by Hendler et al [20] and CC-BSim [13] allow a single thread that acquires a global lock on a shared data structure to learn about all concurrent access request to it, then perform the combined access of all other threads to the structure. None of these approaches provide the simple, general and high-level programming interface of Aida.…”

Section: Related Workmentioning

confidence: 99%

Delegated isolation

et al. 2011

View full text Add to dashboard Cite

Isolation-the property that a task can access shared data without interference from other tasks-is one of the most basic concerns in parallel programming. In this paper, we present Aida, a new model of isolated execution for parallel programs that perform frequent, irregular accesses to pointer-based shared data structures. The three primary benefits of Aida are dynamism, safety and liveness guarantees, and programmability. First, Aida allows tasks to dynamically select and modify, in an isolated manner, arbitrary fine-grained regions in shared data structures, all the while maintaining a high level of concurrency. Consequently, the model can achieve scalable parallelization of regular as well as irregular shared-memory applications. Second, the model offers freedom from data races, deadlocks, and livelocks. Third, no extra burden is imposed on programmers, who access the model via a simple, declarative isolation construct that is similar to that for transactional memory.The key new insight in Aida is a notion of delegation among concurrent isolated tasks (known in Aida as assemblies). Each assembly A is equipped with a region in the shared heap that it owns-the only objects accessed by A are those it owns, guaranteeing race-freedom. The region owned by A can grow or shrink flexibly-however, when A needs to own a datum owned by B, A delegates itself, as well as its owned region, to B. From now on, B has the responsibility of re-executing the task A set out to complete. Delegation as above is the only inter-assembly communication primitive in Aida. In addition to reducing contention in a local, Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. data-driven manner, it guarantees freedom from deadlocks and livelocks.We offer an implementation of Aida on top of the Habanero Java parallel programming language. The implementation employs several novel ideas, including the use of a union-find data structure to represent tasks and the regions that they own. A thorough evaluation using several irregular data-parallel benchmarks demonstrates the low overhead and excellent scalability of Aida, as well as its benefits over existing approaches to declarative isolation. Our results show that Aida performs on par with the state-of-the-art customized implementations of irregular applications and much better than coarse-grained locking and transactional memory approaches.

show abstract

“…Those blocks are addressed by a set of pointers, all stored in one LL/SC object. An adaptive version of this algorithm is presented in [15]. An algorithm is adaptive if its step complexity depends on the maximum number of active processes at each point in time, rather than on the total number n of processes in the system.…”

Section: Introductionmentioning

confidence: 99%

“…In particular, universal constructions provide concurrent implementations of any sequential data structure: Each operation supported by the data structure is a piece of code that can be executed. Many existing universal constructions [1,12,15,16,19,20] restrict parallelism by executing each of the desired operations one after the other. We are interested in universal constructions that allow for increased parallelism by being disjoint-access parallel.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Universal constructions that ensure disjoint-access parallelism and wait-freedom

Ellen

Fatourou

Kosmas

et al. 2012

Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

Disjoint-access parallelism and wait-freedom are two desirable properties for implementations of concurrent objects. Disjoint-access parallelism guarantees that processes operating on different parts of an implemented object do not interfere with each other by accessing common base objects. Thus, disjointaccess parallel algorithms allow for increased parallelism. Wait-freedom guarantees progress for each nonfaulty process, even when other processes run at arbitrary speeds or crash.A universal construction provides a general mechanism for obtaining a concurrent implementation of any object from its sequential code. We identify a natural property of universal constructions and prove that there is no universal construction (with this property) that ensures both disjoint-access parallelism and wait-freedom. This impossibility result also holds for transactional memory implementations that require a process to re-execute its transaction if it has been aborted and guarantee each transaction is aborted only a finite number of times.Our proof is obtained by considering a dynamic object that can grow arbitrarily large during an execution. In contrast, we present a universal construction which produces concurrent implementations that are both wait-free and disjoint-access parallel, when applied to objects that have a bound on the number of data items accessed by each operation they support.

show abstract

The RedBlue Adaptive Universal Constructions

Cited by 12 publications

References 17 publications

A highly-efficient wait-free universal construction

A highly-efficient wait-free universal construction

Delegated isolation

Universal constructions that ensure disjoint-access parallelism and wait-freedom

Contact Info

Product

Resources

About