Sciweavers

3202 search results - page 72 / 641
» Memory access scheduling
Sort
View
133
Voted
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
15 years 5 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
HPCA
2011
IEEE
14 years 7 months ago
Bloom Filter Guided Transaction Scheduling
Contention management is an important design component to a transactional memory system. Without effective contention management to ensure forward progress, a transactional memory...
Geoffrey Blake, Ronald G. Dreslinski, Trevor N. Mu...
RTAS
1998
IEEE
15 years 8 months ago
Managing Memory Requirements in the Synthesis of Real-Time Systems from Processing Graphs
In the past, environmental restrictions on size, weight, and power consumption have severely limited both the processing and storage capacity of embedded signal processing systems...
Steve Goddard, Kevin Jeffay
ESOP
2003
Springer
15 years 9 months ago
Requirements on the Execution of Kahn Process Networks
Kahn process networks (KPNs) are a programming paradigm suitable for streaming-based multimedia and signal-processing applications. We discuss the execution of KPNs, and the criter...
Marc Geilen, Twan Basten
164
Voted
CODES
2010
IEEE
15 years 1 months ago
Automatic memory partitioning: increasing memory parallelism via data structure partitioning
In high-level synthesis, pipelined designs are often restricted by the number of memory banks available to the synthesis system. Using multiple memory banks can improve the perfor...
Yosi Ben-Asher, Nadav Rotem