Sciweavers

3202 search results - page 175 / 641
» Memory access scheduling
Sort
View
IEEEPACT
2007
IEEE
15 years 11 months ago
L1 Cache Filtering Through Random Selection of Memory References
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
Yoav Etsion, Dror G. Feitelson
ISVLSI
2007
IEEE
204views VLSI» more  ISVLSI 2007»
15 years 11 months ago
Designing Memory Subsystems Resilient to Process Variations
As technology scales, more sophisticated fabrication processes cause variations in many different parameters in the device. These variations could severely affect the performance ...
Mahmoud Ben Naser, Yao Guo, Csaba Andras Moritz
ISORC
2002
IEEE
15 years 10 months ago
Service Differentiation in Real-Time Main Memory Databases
The demand for real-time database services has been increasing recently. Examples include sensor data fusion, stock trading, decision support, web information services, and data-i...
Kyoung-Don Kang, Sang Hyuk Son, John A. Stankovic
137
Voted
FMICS
2010
Springer
15 years 3 months ago
A Study of Shared-Memory Mutual Exclusion Protocols Using CADP
Mutual exclusion protocols are an essential building block of concurrent systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurr...
Radu Mateescu, Wendelin Serwe
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
15 years 11 months ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood