Sciweavers

1517 search results - page 257 / 304
» Hardening Functions for Large Scale Distributed Computations
Sort
View
127
Voted
HPCA
2009
IEEE
16 years 4 months ago
Techniques for bandwidth-efficient prefetching of linked data structures in hybrid prefetching systems
Linked data structure (LDS) accesses are critical to the performance of many large scale applications. Techniques have been proposed to prefetch such accesses. Unfortunately, many...
Eiman Ebrahimi, Onur Mutlu, Yale N. Patt
161
Voted
CASES
2003
ACM
15 years 7 months ago
A hierarchical approach for energy efficient application design using heterogeneous embedded systems
Several features such as reconfiguration, voltage and frequency scaling, low-power operating states, duty-cycling, etc. are exploited for latency and energy efficient application ...
Sumit Mohanty, Viktor K. Prasanna
228
Voted
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 3 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
143
Voted
CCGRID
2006
IEEE
15 years 9 months ago
A Shibboleth-Protected Privilege Management Infrastructure for e-Science Education
Simplifying access to and usage of large scale compute resources via the Grid is of critical importance to encourage the uptake of e-Research. Security is one aspect that needs to...
J. P. Watt, Oluwafemi Ajayi, Jipu Jiang, Jos Koets...
125
Voted
ICS
2010
Tsinghua U.
16 years 27 days ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...