Towards Efficient Abstractions for Concurrent Consensus

File Type:
PDFItem Type:
Conference PaperDate:
2013Author:
Access:
OpenAccessCitation:
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 - 90Download Item:
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
Sponsor
Grant Number
Science Foundation Ireland (SFI)
SFI 06 IN.1 1898
Author's Homepage:
http://people.tcd.ie/vkoutavDescription:
PUBLISHEDProvo, Utah, USA
Author: KOUTAVAS, VASILEIOS
Sponsor:
Science Foundation Ireland (SFI)Other Titles:
Lecture Notes in Computer ScienceTrends in Functional Programming
Publisher:
Springer Berlin HeidelbergType of material:
Conference PaperCollections
Series/Report no:
8322Availability:
Full text availableSubject:
Concurrency, Programming LanguagesDOI:
http://dx.doi.org/10.1007/978-3-642-45340-3_5Metadata
Show full item recordThe following license files are associated with this item: