Sciweavers

758 search results - page 39 / 152
» Timing Analysis of Optimised Code
Sort
View
DAC
2009
ACM
14 years 11 months ago
Optimal static WCET-aware scratchpad allocation of program code
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access will result in a definite cache hit or miss. This unpredictabilit...
Heiko Falk, Jan C. Kleinsorge
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
13 years 11 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
14 years 10 months ago
Skippy: a new snapshot indexing method for time travel in the storage manager
The storage manager of a general-purpose database system can retain consistent disk page level snapshots and run application programs "back-in-time" against long-lived p...
Ross Shaull, Liuba Shrira, Hao Xu
EUROSYS
2007
ACM
14 years 7 months ago
Melange: creating a "functional" internet
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...
Anil Madhavapeddy, Alex Ho, Tim Deegan, David Scot...
ICALP
1990
Springer
14 years 2 months ago
Analytic Variations on the Common Subexpression Problem
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
Philippe Flajolet, Paolo Sipala, Jean-Marc Steyaer...