779 search results - page 15 / 156 » A Simple Program Transformation for Parallelism |
116
Voted
CLOUD
2010
ACM
15 years 4 months ago
2010
ACM
Over the last 10–15 years, our industry has developed and deployed many large-scale Internet services, from e-commerce to social networking sites, all facing common challenges i...
103
click to vote
LOPSTR
2001
Springer
15 years 4 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...
116
Voted
PACT
1997
Springer
15 years 3 months ago
1997
Springer
A technique for estimating the cost of executing a loop nest in parallel (parallel start-up overhead) is described in this paper. This technique is of utmost importance for paralle...
88
Voted
POPL
1995
ACM
15 years 3 months ago
1995
ACM
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...