Sciweavers

2168 search results - page 300 / 434
» Using Approximation Hardness to Achieve Dependable Computati...
Sort
View
SIGCOMM
2010
ACM
15 years 4 months ago
NapSAC: design and implementation of a power-proportional web cluster
Energy consumption is a major and costly problem in data centers. A large fraction of this energy goes to powering idle machines that are not doing any useful work. We identify tw...
Andrew Krioukov, Prashanth Mohan, Sara Alspaugh, L...
EDBT
2012
ACM
246views Database» more  EDBT 2012»
13 years 6 months ago
"Cut me some slack": latency-aware live migration for databases
Cloud-based data management platforms often employ multitenant databases, where service providers achieve economies of scale by consolidating multiple tenants on shared servers. I...
Sean Kenneth Barker, Yun Chi, Hyun Jin Moon, Hakan...
ICS
1998
Tsinghua U.
15 years 8 months ago
Load Execution Latency Reduction
In order to achieve high performance, contemporary microprocessors must effectively process the four major instruction types: ALU, branch, load, and store instructions. This paper...
Bryan Black, Brian Mueller, Stephanie Postal, Ryan...
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
15 years 9 months ago
Sparse Matrix-Vector multiplication on FPGAs
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
Ling Zhuo, Viktor K. Prasanna
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 4 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim