Sciweavers

176 search results - page 25 / 36
» Automatic Amortised Worst-Case Execution Time Analysis
Sort
View
CONCUR
2010
Springer
13 years 8 months ago
Buffered Communication Analysis in Distributed Multiparty Sessions
Many communication-centred systems today rely on asynchronous messaging among distributed peers to make efficient use of parallel execution and resource access. With such asynchron...
Pierre-Malo Deniélou, Nobuko Yoshida
IPPS
2006
IEEE
14 years 1 months ago
Detecting phases in parallel applications on shared memory architectures
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
Erez Perelman, Marzia Polito, Jean-Yves Bouguet, J...
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
14 years 7 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
14 years 7 months ago
CORDS: Automatic Discovery of Correlations and Soft Functional Dependencies
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
Ihab F. Ilyas, Volker Markl, Peter J. Haas, Paul B...
ICS
2001
Tsinghua U.
13 years 12 months ago
Global optimization techniques for automatic parallelization of hybrid applications
This paper presents a novel technique to perform global optimization of communication and preprocessing calls in the presence of array accesses with arbitrary subscripts. Our sche...
Dhruva R. Chakrabarti, Prithviraj Banerjee