43 search results - page 3 / 9 » Reducing the Storage Burden via Data Deduplication |
MICRO
1997
IEEE
14 years 23 days ago
1997
IEEE
We revisit memory hierarchy design viewing memory as an inter-operation communication agent. This perspective leads to the development of novel methods of performing inter-operati...
PDSE
1998
13 years 10 months ago
1998
This paper describes how to reduce the burden of parallel programming by utilizing relevant parallel programs. Parallel algorithms are divided into four classes and a case base fo...
GLOBECOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—Over the last decade, numerous admission control schemes have been studied to allocate network resources. Although per-flow control schemes can provide guaranteed QoS, such sch...
ICFP
2009
ACM
14 years 9 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
ICCD
2004
IEEE
14 years 5 months ago
2004
IEEE
Many test data compression schemes are based on LFSR reseeding. A drawback of these schemes is that the unspecified bits are filled with random values resulting in a large number ...