Brief announcement: processor allocation for optimistic parallelization of irregular programs

Authors:
Francesco Versaci;Keshav Pingali
Affiliations:
University of Padova, Padova, Italy;The University of Texas at Austin, Austin, TX, USA
Venue:
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Year:
2011

Citing 2
Cited 1

Optimistic parallelism requires abstractions

Communications of the ACM - The Status of the P versus NP Problem
The tao of parallelism in algorithms

Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation

Processor allocation for optimistic parallelization of irregular programs

ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.