Sciweavers

215 search results - page 7 / 43
» Optimization Techniques for Parallel Codes of Irregular Scie...
Sort
View
55
Voted
IPPS
2007
IEEE
15 years 4 months ago
Scheduling Issues in Optimistic Parallelization
Irregular applications, which rely on pointer-based data structures, are often difficult to parallelize. The inputdependent nature of their execution means that traditional paral...
Milind Kulkarni, Keshav Pingali
75
Voted
IPPS
2009
IEEE
15 years 4 months ago
High-order stencil computations on multicore clusters
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...
Liu Peng, Richard Seymour, Ken-ichi Nomura, Rajiv ...
71
Voted
IPPS
1998
IEEE
15 years 1 months ago
Local Enumeration Techniques for Sparse Algorithms
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
Gerardo Bandera, Pablo P. Trabado, Emilio L. Zapat...
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
15 years 3 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
67
Voted
ISPAN
1996
IEEE
15 years 1 months ago
Design and evaluation of an environment APE for automatic parallelization of programs
In this paper, we have presented the design and evaluation of a compiler system, called APE,for automatic parallelization of scientific and engineering applications on distributed...
Vipin Chaudhary, Cheng-Zhong Xu, Sumit Roy, Jialin...