201 search results - page 8 / 41 » Predicting locality phases for dynamic memory optimization |
110
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We present a method of dynamic coalition formation (DCF) in sensor networks to achieve well-informed sensor-target allocations. Forecasts of target movements are incorp...
127
Voted
MICRO
1997
IEEE
15 years 7 months ago
1997
IEEE
As the disparity between processor and main memory performance grows, the number of execution cycles spent waiting for memory accesses to complete also increases. As a result, lat...
179
Voted
CODES
2004
IEEE
15 years 7 months ago
2004
IEEE
The memory subsystem accounts for a significant portion of the aggregate energy budget of contemporary embedded systems. Moreover, there exists a large potential for optimizing th...
167
Voted
TSP
2010
14 years 10 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
146
Voted
ISCAS
1999
IEEE
15 years 8 months ago
1999
IEEE
In this paper, we present the application of dynamic trellis diagrams (DTDs) to automatic translation of data flow graphs (DFGs) into highly optimized programs for digital signal ...