Sciweavers

256 search results - page 15 / 52
» Approximation of the worst-case execution time using structu...
Sort
View
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 2 days ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
TOOLS
2008
IEEE
15 years 6 months ago
An AsmL Semantics for Dynamic Structures and Run Time Schedulability in UML-RT
Abstract. Many real-time systems use runtime structural reconfiguration mechanisms based on dynamic creation and destruction of components. To support such features, UML-RT provid...
Stefan Leue, Alin Stefanescu, Wei Wei
SIGMETRICS
2003
ACM
199views Hardware» more  SIGMETRICS 2003»
15 years 5 months ago
Data cache locking for higher program predictability
Caches have become increasingly important with the widening gap between main memory and processor speeds. However, they are a source of unpredictability due to their characteristi...
Xavier Vera, Björn Lisper, Jingling Xue
CGO
2006
IEEE
15 years 5 months ago
Selecting Software Phase Markers with Code Structure Analysis
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...
Jeremy Lau, Erez Perelman, Brad Calder
MEMOCODE
2003
IEEE
15 years 5 months ago
Exact Runtime Analysis Using Automata-Based Symbolic Simulation
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
Tobias Schüle, Klaus Schneider