NDLI: On the cost of composing shared-memory algorithms

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

Time vs. space trade-offs for rendezvous in trees

In search of parallel dimensions

Delegation and nesting in best-effort hardware transactional memory

Brief announcement: the problem based benchmark suite

Parallel and I/O efficient set covering algorithms

Deterministic multi-channel information exchange

Abstraction failures in concurrent programming

SALSA: scalable and low synchronization NUMA-aware algorithm for producer-consumer pools

Brief announcement: towards a communication optimal fast multipole method and its implications at exascale

Communication-optimal parallel algorithm for strassen's matrix multiplication

$A_{(3/2+ε)}$ approximation algorithm for scheduling moldable and non-moldable parallel tasks

Hedonic clustering games

Memory-mapping support for reducer hyperobjects

Efficient computation of distance sketches in distributed networks

Allowing each node to communicate only once in a distributed system: shared whiteboard models

Design, verification and applications of a new read-write lock algorithm

Brief announcement: subgraph isomorphism on a multithreaded shared memory architecture

A scalable framework for heterogeneous GPU-based clusters

High-performance RMA-based broadcast on the intel SCC

A non-blocking internal binary search tree

Brief announcement: application-sensitive QoS scheduling in storage servers

Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design

Cache-conscious scheduling of streaming applications

Enforcing efficient equilibria in network design games via subsidies

On the cost of composing shared-memory algorithms

Scheduling in wireless networks with rayleigh-fading interference

Optimal and competitive runtime bounds for continuous, local gathering of mobile robots

A lock-free B+tree

Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model

Faster and simpler width-independent parallel algorithms for positive semidefinite programming

The impact of the power law exponent on the behavior of a dynamic epidemic type process

Lower bounds for restricted-use objects: extended abstract

Brief announcement: a GPU accelerated iterated local search TSP solver

A parallel buffer tree

Non-clairvoyant weighted flow time scheduling with rejection penalty

Greedy sequential maximal independent set and matching are parallel on average

Online multi-robot exploration of grid graphs with rectangular obstacles

Brief announcement: strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds

Discovery through gossip

Brief announcement: speedups for parallel graph triconnectivity

Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters

Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane

On the cost of composing shared-memory algorithms

Content Provider	ACM Digital Library
Author	Kuznetsov, Petr Guerraoui, Rachid Losa, Giuliano Alistarh, Dan
Abstract	Decades of research in distributed computing have led to a variety of perspectives on what it means for a concurrent algorithm to be efficient, depending on model assumptions, progress guarantees, and complexity metrics. It is therefore natural to ask whether one could compose algorithms that perform efficiently under different conditions, so that the composition preserves the performance of the original components when their conditions are met. In this paper, we evaluate the cost of composing shared-memory algorithms. First, we formally define the notion of safely composable algorithms and we show that every sequential type has a safely composable implementation, as long as enough state is transferred between modules. Since such generic implementations are inherently expensive, we present a more general light-weight specification that allows the designer to transfer very little state between modules, by taking advantage of the semantics of the implemented object. Using this framework, we implement a composed long-lived test-and-set object, with the property that each of its modules is asymptotically optimal with respect to the progress condition it ensures, while the entire implementation only uses objects with consensus number at most two. Thus, we show that the overhead of composition can be negligible in the case of some important shared-memory abstractions.
Starting Page	298
Ending Page	307
Page Count	10
File Format	PDF
ISBN	9781450312134
DOI	10.1145/2312005.2312057
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-06-25
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Composition Test-and-set Modularity Consensus Complexity
Content Type	Text
Resource Type	Article

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

On the Cost of Composing Shared-Memory Algorithms

On the time and space complexity of randomized test-and-set

A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]

Test-and-Set in Optimal Space

Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms

Brief Announcement: A Tight Space Bound for Consensus

A closer look at fault tolerance

The Combinatorial Structure of Wait-Free Solvable Tasks

A hierarchy of conditions for consensus solvability

On the cost of composing shared-memory algorithms

Similar Documents

On the Cost of Composing Shared-Memory Algorithms

On the time and space complexity of randomized test-and-set

A Complexity-Based Hierarchy for Multiprocessor Synchronization: [Extended Abstract]

Test-and-Set in Optimal Space

Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms

Brief Announcement: A Tight Space Bound for Consensus

A closer look at fault tolerance

The Combinatorial Structure of Wait-Free Solvable Tasks

A hierarchy of conditions for consensus solvability

On the cost of composing shared-memory algorithms