Sciweavers

401 search results - page 17 / 81
» Static Dependent Costs for Estimating Execution Time
Sort
View
CODES
2008
IEEE
14 years 2 months ago
Static analysis for fast and accurate design space exploration of caches
Application-specific system-on-chip platforms create the opportunity to customize the cache configuration for optimal performance with minimal chip estate. Simulation, in partic...
Yun Liang, Tulika Mitra
WOSP
2010
ACM
14 years 2 months ago
A page fault equation for dynamic heap sizing
For garbage-collected applications, dynamically-allocated objects are contained in a heap. Programmer productivity improves significantly if there is a garbage collector to autom...
Y. C. Tay, X. R. Zong
ASPLOS
1994
ACM
13 years 11 months ago
Reducing Branch Costs via Branch Alignment
Several researchers have proposed algorithms for basic block reordering. We call these branch alignment algorithms. The primary emphasis of these algorithms has been on improving ...
Brad Calder, Dirk Grunwald
ATS
1998
IEEE
76views Hardware» more  ATS 1998»
13 years 12 months ago
Partitioning and Reordering Techniques for Static Test Sequence Compaction of Sequential Circuits
We propose a new static test set compaction method based on a careful examination of attributes of fault coverage curves. Our method is based on two key ideas: 1 fault-list and te...
Michael S. Hsiao, Srimat T. Chakradhar
FMSD
2007
133views more  FMSD 2007»
13 years 7 months ago
Static priority scheduling of event-triggered real-time embedded systems
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
Cagkan Erbas, Andy D. Pimentel, Selin Cerav-Erbas