Sciweavers

779 search results - page 49 / 156
» A Simple Program Transformation for Parallelism
Sort
View
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 1 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
LCPC
1993
Springer
14 years 12 hour ago
Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution
Abstract. Loop fusion is a program transformation that merges multiple loops into one. It is e ective for reducing the synchronization overhead of parallel loops and for improving ...
Ken Kennedy, Kathryn S. McKinley
SAS
2010
Springer
262views Formal Methods» more  SAS 2010»
13 years 6 months ago
Concurrent Separation Logic for Pipelined Parallelization
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
Christian J. Bell, Andrew W. Appel, David Walker
PLDI
2011
ACM
12 years 10 months ago
Automatic CPU-GPU communication management and optimization
The performance benefits of GPU parallelism can be enormous, but unlocking this performance potential is challenging. The applicability and performance of GPU parallelizations is...
Thomas B. Jablin, Prakash Prabhu, James A. Jablin,...
ICSE
2009
IEEE-ACM
14 years 8 months ago
Refactoring sequential Java code for concurrency via concurrent libraries
Parallelizing existing sequential programs to run efficiently on multicores is hard. The Java 5 package java.util.concurrent (j.u.c.) supports writing concurrent programs: much of...
Danny Dig, John Marrero, Michael D. Ernst