Sciweavers

1141 search results - page 86 / 229
» Compiler-Directed Performance Model Construction for Paralle...
Sort
View
ICPP
2005
IEEE
15 years 6 months ago
Filter Decomposition for Supporting Coarse-Grained Pipelined Parallelism
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
Wei Du, Gagan Agrawal
121
Voted
NMELP
1994
15 years 4 months ago
Static Semantics as Program Transformation and Well-founded Computation
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
Stefania Costantini, Gaetano Aurelio Lanzarone
84
Voted
PPOPP
2010
ACM
15 years 10 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
107
Voted
POPL
1996
ACM
15 years 4 months ago
A Provably Time-Efficient Parallel Implementation of Full Speculation
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
John Greiner, Guy E. Blelloch
95
Voted
HPDC
2010
IEEE
15 years 1 months ago
Twister: a runtime for iterative MapReduce
MapReduce programming model has simplified the implementation of many data parallel applications. The simplicity of the programming model and the quality of services provided by m...
Jaliya Ekanayake, Hui Li, Bingjing Zhang, Thilina ...