Sciweavers

2313 search results - page 69 / 463
» On Heuristic Time Hierarchies
Sort
View
PLDI
2005
ACM
15 years 12 months ago
Automatic pool allocation: improving performance by controlling data structure layout in the heap
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
Chris Lattner, Vikram S. Adve
WMPI
2004
ACM
15 years 11 months ago
Scalable cache memory design for large-scale SMT architectures
The cache hierarchy design in existing SMT and superscalar processors is optimized for latency, but not for bandwidth. The size of the L1 data cache did not scale over the past dec...
Muhamed F. Mudawar
AMW
2010
15 years 7 months ago
Multiresolution Cube Estimators for Sensor Network Aggregate Queries
In this work we present in-network techniques to improve the efficiency of spatial aggregate queries. Such queries are very common in a sensornet setting, demanding more targeted t...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
ACMMSP
2004
ACM
101views Hardware» more  ACMMSP 2004»
15 years 11 months ago
Metrics and models for reordering transformations
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
Michelle Mills Strout, Paul D. Hovland
SCHEDULING
2008
97views more  SCHEDULING 2008»
15 years 5 months ago
Effective on-line algorithms for reliable due date quotation and large-scale scheduling
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
Philip Kaminsky, Zu-Hsu Lee