Sciweavers

315 search results - page 28 / 63
» On reducing load store latencies of cache accesses
Sort
View
CORR
2010
Springer
224views Education» more  CORR 2010»
13 years 7 months ago
A Cluster Based Replication Architecture for Load Balancing in Peer-to-Peer Content Distribution
In P2P systems, large volumes of data are declustered naturally across a large number of peers. But it is very difficult to control the initial data distribution because every use...
S. Ayyasamy, S. N. Sivanandam
CGO
2009
IEEE
14 years 2 months ago
Reducing Memory Ordering Overheads in Software Transactional Memory
—Most research into high-performance software transactional memory (STM) assumes that transactions will run on a processor with a relatively strict memory model, such as Total St...
Michael F. Spear, Maged M. Michael, Michael L. Sco...
EUC
2007
Springer
14 years 1 months ago
A Selective Push Algorithm for Cooperative Cache Consistency Maintenance over MANETs
Cooperative caching is an important technique to support efficient data dissemination and sharing in Mobile Ad hoc Networks (MANETs). In order to ensure valid data access, the cach...
Yu Huang 0002, Beihong Jin, Jiannong Cao, Guangzho...
ASPLOS
1996
ACM
13 years 11 months ago
Shasta: A Low Overhead, Software-Only Approach for Supporting Fine-Grain Shared Memory
This paper describes Shasta, a system that supports a shared address space in software on clusters of computers with physically distributed memory. A unique aspect of Shasta compa...
Daniel J. Scales, Kourosh Gharachorloo, Chandramoh...
ISPAN
2008
IEEE
14 years 2 months ago
A Taxonomy of Data Prefetching Mechanisms
Data prefetching has been considered an effective way to mask data access latency caused by cache misses and to bridge the performance gap between processor and memory. With hardw...
Surendra Byna, Yong Chen, Xian-He Sun