Sciweavers

484 search results - page 2 / 97
» Caching function calls using precise dependencies
Sort
View
ICFP
2007
ACM
14 years 5 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
RTS
2000
143views more  RTS 2000»
13 years 5 months ago
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
Henrik Theiling, Christian Ferdinand, Reinhard Wil...
ICDE
2009
IEEE
182views Database» more  ICDE 2009»
14 years 7 months ago
Adaptive Parallelization of Queries over Dependent Web Service Calls
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
Manivasakan Sabesan, Tore Risch
ISCAPDCS
2003
13 years 6 months ago
Utilization of Separate Caches to Eliminate Cache Pollution Caused by Memory Management Functions
Data intensive service functions such as memory allocation/de-allocation, data prefetching, and data relocation can pollute processor cache in conventional systems since the same ...
Mehran Rezaei, Krishna M. Kavi
POPL
1994
ACM
13 years 9 months ago
Reducing Indirect Function call Overhead in C++ Programs
Modern computer architectures increasingly depend on mechanisms that estimate future control flow decisions to increase performance. Mechanisms such as speculative execution and p...
Brad Calder, Dirk Grunwald