327 search results - page 12 / 66 » Automatic Generation of DAG Parallelism |
ASAP
2007
IEEE
14 years 1 months ago
2007
IEEE
Monte-Carlo simulations are used in many applications, such as option pricing and portfolio evaluation. Due to their high computational load and intrinsic parallelism, they are id...
PPOPP
1997
ACM
14 years 1 months ago
1997
ACM
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
ICS
2001
Tsinghua U.
14 years 2 months ago
2001
Tsinghua U.
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
IESS
2007
Springer
14 years 3 months ago
2007
Springer
The stringent performance constraints and short time to market of modern digital systems require automatic methods for design of high performance applicationspecific architectures...
SPAA
2006
ACM
14 years 3 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...