research-article

Phasers: a unified deadlock-free construct for collective and point-to-point synchronization

Authors:

David M. Peixotto,

William N. SchererAuthors Info & Claims

ICS '08: Proceedings of the 22nd annual international conference on Supercomputing

Pages 277 - 288

https://doi.org/10.1145/1375527.1375568

Published: 07 June 2008 Publication History

Abstract

Coordination and synchronization of parallel tasks is a major source of complexity in parallel programming. These constructs take many forms in practice including mutual exclusion in accesses to shared resources, termination detection of child tasks, collective barrier synchronization, and point-to-point synchronization. In this paper, we introduce phasers, a new coordination construct that unifies collective and point-to-point synchronizations. We establish two safety properties for phasers: deadlock-freedom and phase-ordering. Performance results obtained from a portable implementation of phasers on three different SMP platforms demonstrate that phasers can deliver superior performance to existing barrier implementations, in addition to the productivity benefits that result from their generality and safety properties.

References

[1]

S. Agarwal, R. Barik, D. Bonachea, V. Sarkar, R. K. Shyamasundar, and K. Yelick. Deadlock-free scheduling of x10 computations with bounded resources. In SPAA '07: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, pages 229--240, New York, NY, USA, 2007. ACM.

Digital Library

[2]

P. Charles, C. Donawa, K. Ebcioglu, C. Grothoff, A. Kielstra, C. von Praun, V. Saraswat, and V. Sarkar. X10: An object-oriented approach to non-uniform cluster computing. In OOPSLA 2005 Onward! Track, 2005.

Digital Library

[3]

S. Deitz. Parallel programming in chapel. http://www.cct.lsu.edu/ estrabd/LACSI2006/Programming%20Models/deitz.pdf, 2006.

[4]

B. Goetz. Java Concurrency In Practice. Addison-Wesley, 2007.

[5]

R. Gupta. The fuzzy barrier: a mechanism for high speed synchronization of processors. In ASPLOS-III: Proceedings of the third international conference on Architectural support for programming languages and operating systems, pages 54--63, New York, NY, USA, 1989. ACM.

Digital Library

[6]

Habanero multicore software research project web page. http://habanero.rice.edu, 2008.

[7]

M. Herlihy and J. E. B. Moss. Transactional memory: architectural support for lock-free data structures. In ISCA '93: Proceedings of the 20th annual international symposium on Computer architecture, pages 289--300, New York, NY, USA, 1993. ACM Press.

Digital Library

[8]

P. Hilfinger, D. Bonachea, D. Gay, S. Graham, B. Liblit, G. Pike, and K. Yelick. Titanium Language Reference Manual. Technical Report CSD-01-1163, University of California at Berkeley, Berkeley, Ca, USA, 2001.

Digital Library

[9]

The Java Grande Forum benchmark suite. http://www.epcc.ed.ac.uk/javagrande/javag.html.

[10]

OpenMP specifications. http://www.openmp.org/blog/specifications/.

[11]

C. F. J. C. K. R. D. Blumofe, C. E. Leiserson, K. H. Randall, and Y. Zhou. CILK: An efficient multithreaded runtime system. Proceedings of Symposium on Principles and Practice of Parallel Programming (PPoPP'95), pages 207--216, July 1995.

Digital Library

[12]

V. Sarkar. Synchronization Using Counting Semaphores. Proceedings of the ACM 1988 International Conference on Supercomputing, pages 627--637, July 1988.

Digital Library

[13]

J. Shirako, H. Kasahara, and V. Sarkar. Language extensions in support of compiler parallelization. In The 20th International Workshop on Languages and Compilers for Parallel Computing (LCPC'07), 2007.

[14]

L. A. Smith and J. M. Bull. A multithreaded java grande benchmark suite. In Proceedings of the Third Workshop on Java for High Performance Computing, June 2001.

[15]

Release 1.5 of x10 system dated 2007-06-29. http://sourceforge.net/project/showfiles.php?group_id=181722&package_id=210532&release_id=519811, 2007.

[16]

K. Yelick, D. Bonachea, W.-Y. Chen, P. Colella, K. Datta, J. Duell, S. L. Graham, P. Hargrove, P. Hilfinger, P. Husbands, C. Iancu, A. Kamil, R. Nishtala, J. Su, M. Welcome, and T. Wen. Productivity and performance using partitioned global address space languages. In PASCO '07: Proceedings of the 2007 international workshop on Parallel symbolic computation, pages 24--32, New York, NY, USA, 2007. ACM.

Digital Library

Cited By

Cheeseman LParkinson MClebsch SKogias MDrossopoulou SChisnall DWrigstad TLiétar P(2023)When Concurrency Matters: Behaviour-Oriented ConcurrencyProceedings of the ACM on Programming Languages10.1145/36228527:OOPSLA2(1531-1560)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622852
Choquette JGandhi WGiroux OStam NKrashinsky R(2021)NVIDIA A100 Tensor Core GPU: Performance and InnovationIEEE Micro10.1109/MM.2021.306139441:2(29-35)Online publication date: 1-Mar-2021
https://doi.org/10.1109/MM.2021.3061394
Fürlinger KGracia JKnüpfer AFuchs THünich DJungblut PKowalewski RSchuchart J(2020)DASH: Distributed Data Structures and Parallel Algorithms in a Global Address SpaceSoftware for Exascale Computing - SPPEXA 2016-201910.1007/978-3-030-47956-5_6(103-142)Online publication date: 31-Jul-2020
https://doi.org/10.1007/978-3-030-47956-5_6
Show More Cited By

Index Terms

Phasers: a unified deadlock-free construct for collective and point-to-point synchronization
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

Insertion Tree Phasers: Efficient and Scalable Barrier Synchronization for Fine-Grained Parallelism
HPCC '10: Proceedings of the 2010 IEEE 12th International Conference on High Performance Computing and Communications

This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with dynamic, two-phase, and point-to-point synchronization. It retains the ...
Unifying barrier and point-to-point synchronization in OpenMP with phasers
IWOMP'11: Proceedings of the 7th international conference on OpenMP in the Petascale era

OpenMP is a widely used standard for parallel programing on a broad range of SMP systems. In the OpenMP programming model, synchronization points are specified by implicit or explicit barrier operations. However, certain classes of computations such as ...
Kronecker Algebra for Static Analysis of Barriers in Ada
Proceedings of the 21st Ada-Europe International Conference on Reliable Software Technologies --- Ada-Europe 2016 - Volume 9695

Kronecker algebra until now has been applied to concurrent programs that use semaphores and protected objects for synchronization. Like many other programming languages, Ada uses barriers, too. In this paper, we present a new synchronization construct ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICS '08: Proceedings of the 22nd annual international conference on Supercomputing

June 2008

390 pages

ISBN:9781605581583

DOI:10.1145/1375527

General Chairs:
Theo Papatheodorou
University of Patras, Greece
,
Utpal Banerjee
Intel (retired), USA
,
Program Chairs:
Avi Mendelson
Intel, Israel
,
Kyle Gallivan
Florida State University, USA

Copyright © 2008 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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ICS08

Sponsor:

ICS08: International Conference on Supercomputing

June 7 - 12, 2008

Island of Kos, Greece

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

90
Total Citations
View Citations
665
Total Downloads

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

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cheeseman LParkinson MClebsch SKogias MDrossopoulou SChisnall DWrigstad TLiétar P(2023)When Concurrency Matters: Behaviour-Oriented ConcurrencyProceedings of the ACM on Programming Languages10.1145/36228527:OOPSLA2(1531-1560)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622852
Choquette JGandhi WGiroux OStam NKrashinsky R(2021)NVIDIA A100 Tensor Core GPU: Performance and InnovationIEEE Micro10.1109/MM.2021.306139441:2(29-35)Online publication date: 1-Mar-2021
https://doi.org/10.1109/MM.2021.3061394
Fürlinger KGracia JKnüpfer AFuchs THünich DJungblut PKowalewski RSchuchart J(2020)DASH: Distributed Data Structures and Parallel Algorithms in a Global Address SpaceSoftware for Exascale Computing - SPPEXA 2016-201910.1007/978-3-030-47956-5_6(103-142)Online publication date: 31-Jul-2020
https://doi.org/10.1007/978-3-030-47956-5_6
Vandierendonck HNikolopoulos D(2019)HyperqueuesACM Transactions on Parallel Computing10.1145/33656606:4(1-35)Online publication date: 19-Nov-2019
https://dl.acm.org/doi/10.1145/3365660
Ganjei ZRezine AHenrio LEles PPeng Z(2019)On Reachability in Parameterized Phaser ProgramsTools and Algorithms for the Construction and Analysis of Systems10.1007/978-3-030-17462-0_17(299-315)Online publication date: 4-Apr-2019
https://doi.org/10.1007/978-3-030-17462-0_17
Utture ANandivada V(2019)Efficient lock‐step synchronization in task‐parallel languagesSoftware: Practice and Experience10.1002/spe.272649:9(1379-1401)Online publication date: Jul-2019
https://doi.org/10.1002/spe.2726
Cogumbreiro THu RMartins FYoshida N(2018)Dynamic Deadlock Verification for General Barrier SynchronisationACM Transactions on Programming Languages and Systems10.1145/322906041:1(1-38)Online publication date: 11-Dec-2018
https://dl.acm.org/doi/10.1145/3229060
Bianchi FMargara APezze M(2018)A Survey of Recent Trends in Testing Concurrent Software SystemsIEEE Transactions on Software Engineering10.1109/TSE.2017.270708944:8(747-783)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1109/TSE.2017.2707089
Ganjei ZRezine AEles PPeng ZStewart DWeissenbacher G(2017)Safety verification of phaser programsProceedings of the 17th Conference on Formal Methods in Computer-Aided Design10.5555/3168451.3168471(68-75)Online publication date: 2-Oct-2017
https://dl.acm.org/doi/10.5555/3168451.3168471
Ganjei ZRezine AEles PPeng Z(2017)Safety verification of phaser programs2017 Formal Methods in Computer Aided Design (FMCAD)10.23919/FMCAD.2017.8102243(68-75)Online publication date: Oct-2017
https://doi.org/10.23919/FMCAD.2017.8102243
Show More Cited By

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.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents