research-article

Scalable join patterns

Authors:

Aaron J. Turon and

Claudio V. RussoAuthors Info & Claims

OOPSLA '11: Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications

October 2011

Pages 575 - 594

https://doi.org/10.1145/2048066.2048111

Published: 22 October 2011 Publication History

Abstract

Coordination can destroy scalability in parallel programming. A comprehensive library of scalable synchronization primitives is therefore an essential tool for exploiting parallelism. Unfortunately, such primitives do not easily combine to yield solutions to more complex problems. We demonstrate that a concurrency library based on Fournet and Gonthier's join calculus can provide declarative and scalable coordination. By declarative, we mean that the programmer needs only to write down the constraints of a coordination problem, and the library will automatically derive a correct solution. By scalable, we mean that the derived solutions deliver robust performance both as the number of processors increases, and as the complexity of the coordination problem grows. We validate our claims empirically on seven coordination problems, comparing our generic solution to specialized algorithms from the literature.

References

[1]

N. Benton. Jingle bells: Solving the Santa Claus problem in Polyphonic C#. Unpublished manuscript, Mar. 2003. URL http://research.microsoft.com/nick/santa.pdf.

[2]

N. Benton, L. Cardelli, and C. Fournet. Modern concurrency abstractions for C#. ACM Transactions on Programming Languages and Systems, 26 (5), Sept. 2004.

Digital Library

[3]

E. W. Dijkstra. Hierarchical ordering of sequential processes. Acta Informatica, 1 (2): 115--138, 1971.

Digital Library

[4]

C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), 1996.

Digital Library

[5]

C. Fournet and G. Gonthier. The join calculus: a language for distributed mobile programming. In APPSEM Summer School, Caminha, Portugal, Sept. 2000, 2002.

Digital Library

[6]

}Fournet97implicittypingC. Fournet, C. Laneve, L. Maranget, and D. Rémy. Implicit typing à la ML for the join-calculus. In International Conference on Concurrency Theory (CONCUR), 1997.

Digital Library

[7]

C. Fournet, F. Le Fessant, L. Maranget, and A. Schmitt. JoCaml: a language for concurrent distributed and mobile programming. In Advanced Functional Programming, 4th International School, Oxford, Aug. 2002, 2003.

[8]

T. Harris, S. Marlow, S. Peyton-Jones, and M. Herlihy. Composable memory transactions. In ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), 2005.

Digital Library

[9]

M. Herlihy and N. Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann, 2008.

Digital Library

[10]

M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12 (3): 463--492, July 1990.

Digital Library

[11]

G. S. Itzstein and D. Kearney. Join Java: An alternative concurrency semantics for Java. Technical Report ACRC-01-001, University of South Australia, 2001.

[12]

F. Le Fessant and L. Maranget. Compiling join-patterns. In International Workshop on High-Level Concurrent Languages (HLCL), Sept. 1998.

[13]

D. Lea. URL http://gee.cs.oswego.edu/dl/concurrency-interest/.

[14]

D. Lea. A java fork/join framework. In ACM conference on Java, 2000.

Digital Library

[15]

D. Lea. The java.util.concurrent synchronizer framework. Science of Computer Programming, 58 (3): 293 -- 309, 2005.

Digital Library

[16]

Y. Liu, 2009. URL http://channel.sourceforge.net/.

[17]

J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems (TOCS), 9 (1): 21--65, February 1991.

Digital Library

[18]

M. M. Michael and M. L. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In ACM Symposium on Principles of Distributed Computing (PODC), 1996.

Digital Library

[19]

M. M. Michael and M. L. Scott. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. Journal of Parallel and Distributed Computing, 51 (1): 1--26, May 1998.

Digital Library

[20]

M. Moir, V. Luchangco, and N. Shavit. Non-blocking k-compare single swap. In ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2003.

Digital Library

[21]

M. Odersky. An overview of functional nets. In APPSEM Summer School, Caminha, Portugal, Sept. 2000, 2002.

[22]

H. Plociniczak and S. Eisenbach. JErlang: Erlang with Joins. In Coordination Models and Languages, 2010.

Digital Library

[23]

J. Reppy, C. V. Russo, and Y. Xiao. Parallel concurrent ml. In ACM SIGPLAN International Conference on Functional Programming (ICFP), 2009.

Digital Library

[24]

C. Russo. The Joins Concurrency Library. In International Symposium on Practical Aspects of Declarative Languages (PADL), 2007.

Digital Library

[25]

C. Russo. Join Patterns for Visual Basic. In ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA), 2008.

Digital Library

[26]

W. Scherer, III, D. Lea, and M. L. Scott. A scalable elimination-based exchange channel. In Synchronization and Concurrency in Object-Oriented Languages (SCOOL), 2005.

[27]

W. N. Scherer, III and M. L. Scott. Nonblocking concurrent objects with condition synchronization. In International Symposium on Distributed Computing (DISC), 2004.

[28]

W. N. Scherer, III, D. Lea, and M. L. Scott. Scalable synchronous queues. In ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), 2006.

Digital Library

[29]

N. Shavit and D. Touitou. Software transactional memory. In ACM Symposium on Principles of Distributed Computing (PODC), 1995.

Digital Library

[30]

S. Singh. Higher-order combinators for join patterns using STM. ACM SIGPLAN Workshop on Transactional Computing (TRANSACT), June 2006.

[31]

M. Sulzmann and E. S. L. Lam. Parallel join patterns with guards and propagation. Unpublished manuscript, 2008.

Cited By

Gerbo RPadovani L(2019)Concurrent Typestate-Oriented Programming in JavaElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.291.3291(24-34)Online publication date: 2-Apr-2019
https://doi.org/10.4204/EPTCS.291.3
Crafa SPadovani L(2017)The Chemical Approach to Typestate-Oriented ProgrammingACM Transactions on Programming Languages and Systems10.1145/306484939:3(1-45)Online publication date: 26-May-2017
https://dl.acm.org/doi/10.1145/3064849
Bračevac OErdweg SSalvaneschi GMezini MFuentes LBatory DCzarnecki K(2016)CPL: a core language for cloud computingProceedings of the 15th International Conference on Modularity10.1145/2889443.2889452(94-105)Online publication date: 14-Mar-2016
https://dl.acm.org/doi/10.1145/2889443.2889452
Show More Cited By

Index Terms

Scalable join patterns
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Concurrent programming structures

Recommendations

Scalable join patterns
OOPSLA '11

Coordination can destroy scalability in parallel programming. A comprehensive library of scalable synchronization primitives is therefore an essential tool for exploiting parallelism. Unfortunately, such primitives do not easily combine to yield ...
Read More
Parallel concurrent ML
ICFP '09: Proceedings of the 14th ACM SIGPLAN international conference on Functional programming

Concurrent ML (CML) is a high-level message-passing language that supports the construction of first-class synchronous abstractions called events. This mechanism has proven quite effective over the years and has been incorporated in a number of other ...
Read More
Concurrent programming with revisions and isolation types
OOPSLA '10: Proceedings of the ACM international conference on Object oriented programming systems languages and applications

Building applications that are responsive and can exploit parallel hardware while remaining simple to write, understand, test, and maintain, poses an important challenge for developers. In particular, it is often desirable to enable various tasks to ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

OOPSLA '11: Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications

October 2011

1104 pages

ISBN:9781450309400

DOI:10.1145/2048066

General Chair:
Cristina Videira Lopes
University of California, Irvine, USA
,
Program Chair:
Kathleen Fisher
Tufts University, USA

ACM SIGPLAN Notices Volume 46, Issue 10
OOPSLA '11
October 2011
1063 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/2076021
Issue’s Table of Contents

Copyright © 2011 ACM.

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]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 October 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SPLASH '11

Sponsor:

SIGPLAN

SPLASH '11: Conference on Systems, Programming, and Applications: Software for Humanity

October 22 - 27, 2011

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 268 of 1,244 submissions, 22%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
308
Total Downloads

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

Other Metrics

View Author Metrics

Citations

Cited By

Gerbo RPadovani L(2019)Concurrent Typestate-Oriented Programming in JavaElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.291.3291(24-34)Online publication date: 2-Apr-2019
https://doi.org/10.4204/EPTCS.291.3
Crafa SPadovani L(2017)The Chemical Approach to Typestate-Oriented ProgrammingACM Transactions on Programming Languages and Systems10.1145/306484939:3(1-45)Online publication date: 26-May-2017
https://dl.acm.org/doi/10.1145/3064849
Bračevac OErdweg SSalvaneschi GMezini MFuentes LBatory DCzarnecki K(2016)CPL: a core language for cloud computingProceedings of the 15th International Conference on Modularity10.1145/2889443.2889452(94-105)Online publication date: 14-Mar-2016
https://dl.acm.org/doi/10.1145/2889443.2889452
Crafa SPadovani L(2015)The chemical approach to typestate-oriented programmingACM SIGPLAN Notices10.1145/2858965.281428750:10(917-934)Online publication date: 23-Oct-2015
https://dl.acm.org/doi/10.1145/2858965.2814287
Crafa SPadovani LAldrich JEugster P(2015)The chemical approach to typestate-oriented programmingProceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications10.1145/2814270.2814287(917-934)Online publication date: 23-Oct-2015
https://dl.acm.org/doi/10.1145/2814270.2814287
Van Ham JSalvaneschi GMezini MNoyé JPeternier ABinder WErnst EHirschfeld R(2014)JEScalaProceedings of the 13th international conference on Modularity10.1145/2577080.2577082(205-216)Online publication date: 22-Apr-2014
https://dl.acm.org/doi/10.1145/2577080.2577082
Calvert PMycroft A(2013)Mapping the Join Calculus to Heterogeneous HardwareElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.109.2109(7-12)Online publication date: 23-Feb-2013
https://doi.org/10.4204/EPTCS.109.2
Turon A(2012)ReagentsACM SIGPLAN Notices10.1145/2345156.225408447:6(157-168)Online publication date: 11-Jun-2012
https://dl.acm.org/doi/10.1145/2345156.2254084
Turon AVitek JLin HTip F(2012)ReagentsProceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/2254064.2254084(157-168)Online publication date: 11-Jun-2012
https://dl.acm.org/doi/10.1145/2254064.2254084
Calvert PMycroft A(2012)Control flow analysis for the join calculusProceedings of the 19th international conference on Static Analysis10.1007/978-3-642-33125-1_14(181-197)Online publication date: 11-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33125-1_14
Show More Cited By

View Options

Get Access

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.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents