Towards Efficient Abstractions for Concurrent Consensus

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Springer Berlin Heidelberg

Access

OpenAccess

Embargo end date

Citation

Carlo Spaccasassi, Vasileios Koutavas, Towards Efficient Abstractions for Concurrent Consensus, Lecture Notes in Computer Science, Trends in Functional Programming, Provo, Utah, USA, 14-16 May 2013, Jay McCarthy, 8322, Springer Berlin Heidelberg, 2013, 76 - 90

Abstract

Consensus is an often occurring problem in concurrent and distributed programming. We present a programming language with simple semantics and build-in support for consensus in the form of communicating transactions. We motivate the need for such a construct with a characteristic example of generalized consensus which can be naturally encoded in our language. We then focus on the challenges in achieving an implementation that can efficiently run such programs. We setup an architecture to evaluate different implementation alternatives and use it to experimentally evaluate runtime heuristics. This is the basis for a research project on realistic programming language support for consensus

Description

PUBLISHED
Provo, Utah, USA

Endorsement

Review

Supplemented By

Referenced By

Sponsor: Science Foundation Ireland (SFI)
Grant Number: SFI 06 IN.1 1898

Author's Homepage: http://people.tcd.ie/vkoutav
Other Titles: Lecture Notes in Computer Science
Publisher: Springer Berlin Heidelberg
Type of material: Conference Paper