Sciweavers

244 search results - page 6 / 49
» Basic Compiler Algorithms for Parallel Programs
Sort
View
PPOPP
1997
ACM
15 years 3 months ago
Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
Martin C. Rinard
88
Voted
PLDI
2010
ACM
15 years 4 months ago
A GPGPU compiler for memory optimization and parallelism management
This paper presents a novel optimizing compiler for general purpose computation on graphics processing units (GPGPU). It addresses two major challenges of developing high performa...
Yi Yang, Ping Xiang, Jingfei Kong, Huiyang Zhou
IFIPPACT
1994
15 years 1 months ago
Exploiting the Parallelism Exposed by Partial Evaluation
: We describe an approach to parallel compilation that seeks to harness the vast amount of ne-grain parallelism that is exposed through partial evaluation of numerically-intensive ...
Rajeev J. Surati, Andrew A. Berlin
APPT
2005
Springer
15 years 5 months ago
Contention-Free Communication Scheduling for Irregular Data Redistribution in Parallelizing Compilers
Abstract. The data redistribution problems on multi-computers had been extensively studied. Irregular data redistribution has been paid attention recently since it can distribute d...
Kun-Ming Yu, Chi-Hsiu Chen, Ching-Hsien Hsu, Chang...
SC
2003
ACM
15 years 5 months ago
Compiler Support for Exploiting Coarse-Grained Pipelined Parallelism
The emergence of grid and a new class of data-driven applications is making a new form of parallelism desirable, which we refer to as coarse-grained pipelined parallelism. This pa...
Wei Du, Renato Ferreira, Gagan Agrawal