Sciweavers

1182 search results - page 154 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
TKDE
2008
137views more  TKDE 2008»
15 years 5 months ago
GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
Abstract-- In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based rep...
Runfang Zhou, Kai Hwang, Min Cai
178
Voted
CLUSTER
2004
IEEE
15 years 5 months ago
Seamless Access to Decentralized Storage Services in Computational Grids via a Virtual File System
This paper describes a novel technique for establishing a virtual file system that allows data to be transferred user-transparently and on-demand across computing and storage serve...
Renato J. O. Figueiredo, Nirav H. Kapadia, Jos&eac...
157
Voted
MICRO
2010
IEEE
186views Hardware» more  MICRO 2010»
15 years 3 months ago
SAFER: Stuck-At-Fault Error Recovery for Memories
As technology scaling poses a threat to DRAM scaling due to physical limitations such as limited charge, alternative memory technologies including several emerging non-volatile me...
Nak Hee Seong, Dong Hyuk Woo, Vijayalakshmi Sriniv...
FPGA
2010
ACM
209views FPGA» more  FPGA 2010»
16 years 2 months ago
FPGA power reduction by guarded evaluation
Guarded evaluation is a power reduction technique that involves identifying sub-circuits (within a larger circuit) whose inputs can be held constant (guarded) at specific times d...
Chirag Ravishankar, Jason Helge Anderson
194
Voted
ISCA
2006
IEEE
187views Hardware» more  ISCA 2006»
15 years 11 months ago
A Case for MLP-Aware Cache Replacement
Performance loss due to long-latency memory accesses can be reduced by servicing multiple memory accesses concurrently. The notion of generating and servicing long-latency cache m...
Moinuddin K. Qureshi, Daniel N. Lynch, Onur Mutlu,...