skip to main content
10.1145/1989493.1989533acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
abstract

Brief announcement: processor allocation for optimistic parallelization of irregular programs

Published: 04 June 2011 Publication History

Abstract

Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent activities, aborting and rolling back conflicting tasks. However, parallelism in irregular algorithms can be a function of input parameters, and the amount of parallelism can vary dramatically during the execution. Therefore, determine how many processors should be allocated to execute (the processor allocation problem) for irregular algorithms is very difficult. In this work, we outline the first systematic strategy for addressing this problem.

References

[1]
Alon, N., and Spencer, J. The probabilistic method. Wiley-Interscience, 2000.
[2]
Kulkarni, M., et al. Optimistic parallelism requires abstractions. Commun. ACM 52, 9 (2009), 89--97.
[3]
Pingali, K., et al. The Tao of parallelism in algorithms. In ACM PLDI (2011).

Cited By

View all
  • (2012)Processor allocation for optimistic parallelization of irregular programsProceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I10.1007/978-3-642-31125-3_1(1-14)Online publication date: 18-Jun-2012

Index Terms

  1. Brief announcement: processor allocation for optimistic parallelization of irregular programs

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SPAA '11: Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
    June 2011
    404 pages
    ISBN:9781450307437
    DOI:10.1145/1989493

    Sponsors

    In-Cooperation

    • EATCS: European Association for Theoretical Computer Science

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 04 June 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. amorphous data-parallelism
    2. irregular algorithms
    3. optimistic parallelization
    4. processor allocation
    5. tur?n's theorem.

    Qualifiers

    • Abstract

    Conference

    SPAA '11

    Acceptance Rates

    Overall Acceptance Rate 447 of 1,461 submissions, 31%

    Upcoming Conference

    SPAA '25
    37th ACM Symposium on Parallelism in Algorithms and Architectures
    July 28 - August 1, 2025
    Portland , OR , USA

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 05 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2012)Processor allocation for optimistic parallelization of irregular programsProceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I10.1007/978-3-642-31125-3_1(1-14)Online publication date: 18-Jun-2012

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media