Sciweavers

186 search results - page 30 / 38
» Analyzing Loop Paths for Execution Time Estimation
Sort
View
PODS
1997
ACM
182views Database» more  PODS 1997»
13 years 11 months ago
A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
Stefan Berchtold, Christian Böhm, Daniel A. K...
ESTIMEDIA
2006
Springer
13 years 11 months ago
Design of a WCET-Aware C Compiler
This paper presents techniques to tightly integrate worstcase execution time (WCET) information into a compiler framework. Currently, a tight integration of WCET information into ...
Heiko Falk, Paul Lokuciejewski, Henrik Theiling
ISVLSI
2003
IEEE
147views VLSI» more  ISVLSI 2003»
14 years 27 days ago
Automated Dynamic Memory Data Type Implementation Exploration and Optimization
The behavior of many algorithms is heavily determined by the input data. Furthermore, this often means that multiple and completely different execution paths can be followed, also...
Marc Leeman, Chantal Ykman-Couvreur, David Atienza...
DATE
2000
IEEE
88views Hardware» more  DATE 2000»
14 years 1 days ago
Free MDD-Based Software Optimization Techniques for Embedded Systems
Embedded systems make a heavy use of software to perform Real-Time embedded control tasks. Embedded software is characterized by a relatively long lifetime and by tight cost, perf...
Chunghee Kim, Luciano Lavagno, Alberto L. Sangiova...
ICPP
2007
IEEE
14 years 1 months ago
Tempest: A portable tool to identify hot spots in parallel code
Compute clusters are consuming more power at higher densities than ever before. This results in increased thermal dissipation, the need for powerful cooling systems, and ultimatel...
Kirk W. Cameron, Hari K. Pyla, Srinidhi Varadaraja...