Sciweavers

201 search results - page 1 / 41
» Estimating the Parallel Start-Up Overhead for Parallelizing ...
Sort
View
PACT
1997
Springer
13 years 10 months ago
Estimating the Parallel Start-Up Overhead for Parallelizing Compilers
A technique for estimating the cost of executing a loop nest in parallel (parallel start-up overhead) is described in this paper. This technique is of utmost importance for paralle...
Rizos Sakellariou
LCPC
1997
Springer
13 years 9 months ago
Reducing Synchronization Overhead for Compiler-Parallelized Codes
Software distributed-shared-memory (DSM) systems providean appealingtarget for parallelizing compilers due to their flexibility. Previous studies demonstrate such systems can prov...
Hwansoo Han, Chau-Wen Tseng, Peter J. Keleher
IPPS
1997
IEEE
13 years 10 months ago
A Compile-Time Partitioning Strategy for Non-Rectangular Loop Nests
This paper presents a compile-time scheme for partitioning non-rectangular loop nests which consist of inner loops whose bounds depend on the index of the outermost, parallel loop...
Rizos Sakellariou
IPPS
1999
IEEE
13 years 10 months ago
Reducing Parallel Overheads Through Dynamic Serialization
If parallelism can be successfully exploited in a program, significant reductions in execution time can be achieved. However, if sections of the code are dominated by parallel ove...
Michael Voss, Rudolf Eigenmann
ICLP
2011
Springer
12 years 9 months ago
Minimizing the overheads of dependent {AND}-parallelism
Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it add...
Peter Wang, Zoltan Somogyi