1628 search results - page 17 / 326 » Dynamically Adaptive Parallel Programs |
120
Voted
SPAA
2006
ACM
15 years 8 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...
115
click to vote
EUROPAR
1998
Springer
15 years 6 months ago
1998
Springer
Instruction Balanced Time Slicing IBTS allows multiple parallel jobs to be scheduled in a manner akin to the well-known gang scheduling scheme in parallel computers. IBTS however a...
131
Voted
PSB
2001
15 years 3 months ago
2001
This paper discusses the issues involved in implementing a dynamic programming algorithm for biological sequence comparison on a generalpurpose parallel computing platform based o...
123
Voted
PPOPP
2012
ACM
13 years 9 months ago
2012
ACM
We present Dynamic Out-of-Order Java (DOJ), a dynamic parallelization approach. In DOJ, a developer annotates code blocks as tasks to decouple these blocks from the parent executi...
117
Voted
IEEEPACT
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—Load elimination is a classical compiler transformation that is increasing in importance for multi-core and many-core architectures. The effect of the transformation is ...