Brief announcement: Processor allocation for optimistic parallelization of irregular programs

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2011, Pages 261-262

  Versaci, Francesco ^a   Pingali, Keshav ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b University of Texas at Austin   (United States)

Author keywords

amorphous data parallelism; irregular algorithms; optimistic parallelization; processor allocation; tur n's theorem

Indexed keywords

CONCURRENT ACTIVITIES; DATA PARALLELISM; INPUT PARAMETER; IRREGULAR ALGORITHMS; PARALLELIZATIONS; PROCESSOR ALLOCATION; RUNTIME SYSTEMS;

ALGORITHMS; COMPUTER ARCHITECTURE;

PARALLEL PROCESSING SYSTEMS;

EID: 79959642150     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989493.1989533     Document Type: Conference Paper

References (3)

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).