Sciweavers

365 search results - page 51 / 73
» Achieving accurate and context-sensitive timing for code opt...
Sort
View
IPPS
1998
IEEE
14 years 1 months ago
Memory Hierarchy Management for Iterative Graph Structures
The increasing gap in processor and memory speeds has forced microprocessors to rely on deep cache hierarchies to keep the processors from starving for data. For many applications...
Ibraheem Al-Furaih, Sanjay Ranka
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 years 14 days ago
Improving evolutionary real-time testing
Embedded systems are often used in a safety-critical context, e.g. in airborne or vehicle systems. Typically, timing constraints must be satisfied so that real-time embedded syste...
Marouane Tlili, Stefan Wappler, Harmen Sthamer
JILP
2000
165views more  JILP 2000»
13 years 8 months ago
BMAT - A Binary Matching Tool for Stale Profile Propagation
A major challenge of applying profile-based optimization on large real-world applications is how to capture adequate profile information. A large program, especially a GUI-based a...
Zheng Wang, Ken Pierce, Scott McFarling
NSDI
2004
13 years 10 months ago
Designing a DHT for Low Latency and High Throughput
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...
Frank Dabek, Jinyang Li, Emil Sit, James Robertson...
CASES
2003
ACM
14 years 2 months ago
Compiler-decided dynamic memory allocation for scratch-pad based embedded systems
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
Sumesh Udayakumaran, Rajeev Barua