243 search results - page 38 / 49 » Precise Interprocedural Dependence Analysis of Parallel Prog... |
138
click to vote
ASPLOS
1996
ACM
15 years 5 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...
100
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
122
click to vote
SIAMSC
2008
15 years 1 months ago
2008
Given a vector of floating-point numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s, i.e. the result is one of the immediate floating-point ...
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
SIGSOFT
2005
ACM
16 years 2 months ago
2005
ACM
We present a context- and path-sensitive algorithm for detecting memory leaks in programs with explicit memory management. Our leak detection algorithm is based on an underlying e...