Sciweavers

166 search results - page 13 / 34
» Efficient worst case timing analysis of data caching
Sort
View
CASES
2003
ACM
14 years 26 days ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...
BMCBI
2008
178views more  BMCBI 2008»
13 years 7 months ago
Identification of coherent patterns in gene expression data using an efficient biclustering algorithm and parallel coordinate vi
Background: The DNA microarray technology allows the measurement of expression levels of thousands of genes under tens/hundreds of different conditions. In microarray data, genes ...
Kin-On Cheng, Ngai-Fong Law, Wan-Chi Siu, Alan Wee...
ISCA
1995
IEEE
120views Hardware» more  ISCA 1995»
13 years 11 months ago
Streamlining Data Cache Access with Fast Address Calculation
For many programs, especially integer codes, untolerated load instruction latencies account for a significant portion of total execution time. In this paper, we present the desig...
Todd M. Austin, Dionisios N. Pnevmatikatos, Gurind...
SODA
2004
ACM
76views Algorithms» more  SODA 2004»
13 years 9 months ago
A maiden analysis of Longest Wait First
We consider server scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform size. The algorithm Longest Wait First (LWF) always...
Jeff Edmonds, Kirk Pruhs
FPL
2005
Springer
131views Hardware» more  FPL 2005»
14 years 1 months ago
An Efficient Approach to Hide the Run-Time Reconfiguration from SW Applications
Dynamically reconfigurable logic is becoming an important design unit in SoC system. A method to make the reconfiguration management transparent to software applications is requir...
Yang Qu, Juha-Pekka Soininen, Jari Nurmi