research-article

Erlang ETS tables and software transactional memory: how transactions make ETS tables more like ordinary actors

Author:

Patrik NyblomAuthors Info & Claims

Erlang '11: Proceedings of the 10th ACM SIGPLAN workshop on Erlang

Pages 2 - 13

https://doi.org/10.1145/2034654.2034658

Published: 23 September 2011 Publication History

Get Access

Abstract

This article describes a way to make the ETS tables of Erlang fit better into the actor programming model. Enhancing the interface of the ETS tables with a concept of transactions is suggested as a means both to achieve increased parallelism, better performance and less error-prone code, while still keeping no less true to the actor model.

Supplementary Material

MP4 File (_talk1.mp4)

Download
59.51 MB

References

[1]

Gul A Agha, Actors: A Model Of Concurrent Computation In Distributed Systems. MIT artificial intelligence laboratory technical report 844, 1985

Google Scholar

[2]

Maurice Herlihy, J. Eliot B. Moss, Transactional memory: Architectural Support for Lock-Free Data Structures. ACM SIGARCH computer architecture news, 1993

Digital Library

Google Scholar

[3]

Simon Peyton Jones, Andrew Gordon, Sigbjorn Finne, Concurrent Haskell. Proceedings of the twenty-third ACM SIGPLAN-SIGACT symposium on principles of programming languages (POPL), ACM, January 1996

Digital Library

Google Scholar

[4]

Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer III, Software Transactional Memory for Dynamic-Sized Data Structures. Proceedings of the twenty-second ACM SIGACT-SIGOPS symposium on principles of distributed computing (PODC), July 2003

Digital Library

Google Scholar

[5]

Tim Harris, Simon Marlow, Simon Peyton Jones, Maurice Herlihy, Composable Memory Transactions. Proceedings of the tenth ACM SIGPLAN symposium on principles and practice of parallel programming, June 2005

Digital Library

Google Scholar

[6]

D. Dice, O. Shalev, N. Shavit, Transactional Locking II. Proceedings of the twentieth international symposium on distributed computing, September 2006

Digital Library

Google Scholar

[7]

Rachid Guerraoui, Michal Kapalka, On Obstruction-Free Transactions, Proceedings of the twentieth ACM Symposium on parallelism in algorithms and architectures (SPAA), 2008

Digital Library

Google Scholar

[8]

R Hickey, The Clojure programming language. Proceedings of the 2008 symposium on dynamic languages.

Digital Library

Google Scholar

[9]

Michael F. Spear, Luke Dalessandro, Virenda J. Marathe, Michael L. Scott, A Comprehensive Strategy for Content Management in Software Transactional Memory. Proceedings of the fourteenth ACM SIGPLAN symposium on principles and practice of parallel programming, 2009

Digital Library

Google Scholar

Cited By

View all

Sagonas KWinblad KCastro LSvensson H(2014)More scalable ordered set for ETS using adaptationProceedings of the Thirteenth ACM SIGPLAN workshop on Erlang10.1145/2633448.2633455(3-11)Online publication date: 3-Sep-2014
https://dl.acm.org/doi/10.1145/2633448.2633455
Francesquini EGoldman AMéhaut J(2013)A NUMA-Aware Runtime Environment for the Actor ModelProceedings of the 2013 42nd International Conference on Parallel Processing10.1109/ICPP.2013.34(250-259)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1109/ICPP.2013.34

Index Terms

Erlang ETS tables and software transactional memory: how transactions make ETS tables more like ordinary actors
1. Computing methodologies
  1. Parallel computing methodologies
    1. Parallel programming languages
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
        Parallel programming languages

Recommendations

Time-Based Software Transactional Memory

Software transactional memory (STM) is a concurrency control mechanism that is widely considered to be easier to use by programmers than other mechanisms such as locking. The first generations of STMs have either relied on visible read designs, which ...
Unbounded page-based transactional memory
Proceedings of the 2006 ASPLOS Conference

Exploiting thread level parallelism is paramount in the multicore era. Transactions enable programmers to expose such parallelism by greatly simplifying the multi-threaded programming model. Virtualized transactions (unbounded in space and time) are ...
Unbounded page-based transactional memory
Proceedings of the 2006 ASPLOS Conference

Exploiting thread level parallelism is paramount in the multicore era. Transactions enable programmers to expose such parallelism by greatly simplifying the multi-threaded programming model. Virtualized transactions (unbounded in space and time) are ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Erlang '11: Proceedings of the 10th ACM SIGPLAN workshop on Erlang

September 2011

108 pages

ISBN:9781450308595

DOI:10.1145/2034654

General Chair:
Kenji Rikitake
Kyoto University, Japan
,
Program Chair:
Erik Stenman
Klarna AB, Sweden

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. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 September 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICFP '11

Sponsor:

SIGPLAN

ICFP '11: ACM SIGPLAN International Conference on Functional Programming

September 23, 2011

Tokyo, Japan

Acceptance Rates

Erlang '11 Paper Acceptance Rate 10 of 14 submissions, 71%;

Overall Acceptance Rate 51 of 68 submissions, 75%

Upcoming Conference

ICFP '25

Sponsor:
sigplan

ACM SIGPLAN International Conference on Functional Programming

October 12 - 18, 2025

Singapore , Singapore

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
238
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sagonas KWinblad KCastro LSvensson H(2014)More scalable ordered set for ETS using adaptationProceedings of the Thirteenth ACM SIGPLAN workshop on Erlang10.1145/2633448.2633455(3-11)Online publication date: 3-Sep-2014
https://dl.acm.org/doi/10.1145/2633448.2633455
Francesquini EGoldman AMéhaut J(2013)A NUMA-Aware Runtime Environment for the Actor ModelProceedings of the 2013 42nd International Conference on Parallel Processing10.1109/ICPP.2013.34(250-259)Online publication date: 1-Oct-2013
https://dl.acm.org/doi/10.1109/ICPP.2013.34

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

Supplementary Material

References

Cited By

Index Terms

Recommendations

Time-Based Software Transactional Memory

Unbounded page-based transactional memory

Unbounded page-based transactional memory

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations