Results 1 - 10 of 443

SILT: A Memory-Efficient, High-Performance Key-Value Store

by Hyeontaek Lim, David G. Andersen, Bin Fan, Michael Kaminsky, Bufferhash Flashstore - In Proc. 23rd ACM SOSP, Cascias , 2011
"... SILT (Small Index Large Table) is a memory-efficient, high-performance key-value store system based on flash storage that scales to serve billions of key-value items on a single node. It requires only 0.7 bytes of DRAM per entry and retrieves key/value pairs using on average 1.01 flash reads each. S ..."
Abstract - Cited by 56 (14 self) - Add to MetaCart
SILT (Small Index Large Table) is a memory-efficient, high-performance key-value store system based on flash storage that scales to serve billions of key-value items on a single node. It requires only 0.7 bytes of DRAM per entry and retrieves key/value pairs using on average 1.01 flash reads each

The Stanford FLASH multiprocessor

by Jeffrey Kuskin, David Ofelt, Mark Heinrich, John Heinlein, Richard Simoni, Kourosh Gharachorloo, John Chapin, David Nakahira, Joel Baxter, Mark Horowitz, Anoop Gupta, Mendel Rosenblum, John Hennessy - In Proceedings of the 21st International Symposium on Computer Architecture , 1994
"... The FLASH multiprocessor efficiently integrates support for cache-coherent shared memory and high-performance message passing, while minimizing both hardware and software overhead. Each node in FLASH contains a microprocessor, a portion of the machine’s global memory, a port to the interconnection n ..."
Abstract - Cited by 349 (20 self) - Add to MetaCart
The FLASH multiprocessor efficiently integrates support for cache-coherent shared memory and high-performance message passing, while minimizing both hardware and software overhead. Each node in FLASH contains a microprocessor, a portion of the machine’s global memory, a port to the interconnection

An efficient XOR-Scheduling algorithm for erasure codes encoding

by Jianqiang Luo, Lihao Xu, James S. Plank - in DSN-2009: The International Conference on Dependable Systems and Networks , 2009
"... In large storage systems, it is crucial to protect data from loss due to failures. Erasure codes lay the foundation of this protection, enabling systems to reconstruct lost data when components fail. Erasure codes can however impose significant performance overhead in two core operations: Encoding, ..."
Abstract - Cited by 6 (3 self) - Add to MetaCart
In large storage systems, it is crucial to protect data from loss due to failures. Erasure codes lay the foundation of this protection, enabling systems to reconstruct lost data when components fail. Erasure codes can however impose significant performance overhead in two core operations: Encoding

Reliability Analysis of Deduplicated and Erasure-Coded Storage

by Xiaozhou Li, Mark Lillibridge, Mustafa Uysal
"... Space efficiency and data reliability are two primary concerns for modern storage systems. Chunk-based deduplication, which breaks up data objects into single-instance chunks that can be shared across objects, is an effective method for saving storage space. However, deduplication affects data relia ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
initial results on the reliability analysis of HP-KVS, a deduplicated key-value store that allows each object to specify its own reliability level, and that uses software erasure coding for data reliability. The combination of deduplication and erasure coding gives rise to several interesting research

Mercury: Bringing efficiency to key-value stores Rohan Gandhi

by Aayush Gupta, Anna Povzner, Wendy Belluomini, Tim Kaldewey
"... While the initial wave of in-memory key-value stores has been op-timized for serving relatively fixed content to a very large num-ber of users, an emerging class of enterprise-scale data analytics workloads focuses on capturing, analyzing, and reacting to data in real-time. At the same time, advance ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
, and provide high concurrency with a fine-grained, cache-friendly lock-ing scheme. On a commodity single-socket server with 12 cores, Mercury scales with number of cores and executes 14 times more queries/second than a popular hash-based key-value system, Mem-cached, for both read and write-heavy workloads.

Optimistic Erasure-Coded Distributed Storage ∗

by Partha Dutta, Rachid Guerraoui, Ron R. Levy
"... We study erasure-coded atomic register implementations in an asynchronous crash-recovery model. Erasure coding provides a cheap and space-efficient way to tolerate failures in a distributed system. This paper presents ORCAS, Optimistic eRasure-Coded Atomic Storage, which consists of two separate imp ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
We study erasure-coded atomic register implementations in an asynchronous crash-recovery model. Erasure coding provides a cheap and space-efficient way to tolerate failures in a distributed system. This paper presents ORCAS, Optimistic eRasure-Coded Atomic Storage, which consists of two separate

FAWN: A Fast Array of Wimpy Nodes

by David G. Andersen, Jason Franklin, Amar Phanishayee, Lawrence Tan, Vijay Vasudevan , 2008
"... This paper introduces the FAWN—Fast Array of Wimpy Nodes—cluster architecture for providing fast, scalable, and power-efficient key-value storage. A FAWN links together a large number of tiny nodes built using embedded processors and small amounts (2–16GB) of flash memory into an ensemble capable of ..."
Abstract - Cited by 212 (26 self) - Add to MetaCart
This paper introduces the FAWN—Fast Array of Wimpy Nodes—cluster architecture for providing fast, scalable, and power-efficient key-value storage. A FAWN links together a large number of tiny nodes built using embedded processors and small amounts (2–16GB) of flash memory into an ensemble capable

BloomStore: Bloom-Filter based Memory-efficient Key-Value Store for Indexing of Data Deduplication on Flash

by Guanlin Lu, Young Jin Nam, David H. C. Du
"... Abstract—Due to its better scalability, Key-Value (KV) store has superseded traditional relational databases for many applications, such as data deduplication, on-line multi-player gaming, and Internet services like Amazon and Facebook. The KV store efficiently supports two operations (key lookup an ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract—Due to its better scalability, Key-Value (KV) store has superseded traditional relational databases for many applications, such as data deduplication, on-line multi-player gaming, and Internet services like Amazon and Facebook. The KV store efficiently supports two operations (key lookup

Fine-grain Access Control for Distributed Shared Memory

by Ioannis Schoinas, Steven K. Reinhardt, James R. Larus, David A. Wood - In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS VI , 1994
"... This paper discusses implementations of fine-grain memory access control, which selectively restricts reads and writes to cache-block-sized memory regions. Fine-grain access control forms the basis of efficient cache-coherent shared memory. This paper focuses on low-cost implementations that require ..."
Abstract - Cited by 186 (33 self) - Add to MetaCart
that require little or no additional hardware. These techniques permit efficient implementation of shared memory on a wide range of parallel systems, thereby providing shared-memory codes with a portability previously limited to message passing. This paper categorizes techniques based on where access control

Regenerating codes for errors and erasures in distributed storage

by K. V. Rashmi, Nihar B. Shah, Kannan Ramch, P. Vijay Kumar - in Proc. IEEE International Symposium on Information Theory (ISIT , 2012
"... Abstract—Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures during the data-reconstruction and node-repair operations ..."
Abstract - Cited by 11 (1 self) - Add to MetaCart
Abstract—Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures during the data-reconstruction and node
Results 1 - 10 of 443