Sciweavers

27 search results - page 4 / 6
» Automatic useless-code elimination for HOT functional progra...
Sort
View
ISPAN
2002
IEEE
15 years 4 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
ICLP
2011
Springer
14 years 3 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
ASPLOS
2009
ACM
16 years 8 days ago
Dynamic prediction of collection yield for managed runtimes
The growth in complexity of modern systems makes it increasingly difficult to extract high-performance. The software stacks for such systems typically consist of multiple layers a...
Michal Wegiel, Chandra Krintz
HPDC
2000
IEEE
15 years 3 months ago
Automatic Configuration and Run-time Adaptation of Distributed Applications
Increased platform heterogeneity and varying resource availability in distributed systems motivates the design of resource-aware applications, which ensure a desired performance l...
Fangzhe Chang, Vijay Karamcheti
PPPJ
2006
ACM
15 years 5 months ago
Propagation of JML non-null annotations in Java programs
Development of high quality code is extremely dicult. Tools that help maintaining the proper quality of code produced by programmers can be very useful: they may increase the qua...
Maciej Cielecki, Jedrzej Fulara, Krzysztof Jakubcz...