Sciweavers

500 search results - page 1 / 100
» Procedure Placement Using Temporal Ordering Information
Sort
View
MICRO
1997
IEEE
84views Hardware» more  MICRO 1997»
13 years 9 months ago
Procedure Placement Using Temporal Ordering Information
Nicholas C. Gloy, Trevor Blackwell, Michael D. Smi...
CASES
2004
ACM
13 years 10 months ago
Procedure placement using temporal-ordering information: dealing with code size expansion
Abstract— In a direct-mapped instruction cache, all instructions that have the same memory address modulo the cache size, share a common and unique cache slot. Instruction cache ...
Christophe Guillon, Fabrice Rastello, Thierry Bida...
HICSS
2003
IEEE
138views Biometrics» more  HICSS 2003»
13 years 10 months ago
Towards Verifying Parametrised Hardware Libraries with Relative Placement Information
Abstract— This paper presents a framework for verifying compilation tools for parametrised hardware libraries with placement information. Such libraries are captured in Pebble, a...
Steve McKeever, Wayne Luk, Arran Derbyshire
CASES
2010
ACM
13 years 3 months ago
Improved procedure placement for set associative caches
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
Yun Liang, Tulika Mitra
DAWAK
2007
Springer
13 years 9 months ago
Mining First-Order Temporal Interval Patterns with Regular Expression Constraints
Most methods for temporal pattern mining assume that time is represented by points in a straight line starting at some initial instant. In this paper, we consider a new kind of fir...
Sandra de Amo, Arnaud Giacometti, Waldecir Pereira...