Patent classifications
H03M13/3761
Variable Write Threshold Storage Replication Sites in a Distributed Storage Network
A computing device includes an interface configured to interface and communicate with a storage network, a memory that stores operational instructions, and a processing module operably coupled to the interface and memory configured to transmit a write request for a first write threshold number of encoded data slices of a set of encoded data slices to a set of storage units associated with a first storage site and transmit a write request for a second write threshold number of encoded data slices to a set of storage units associated with a second storage site. The processing module is configured to receive a read request for a read threshold number of encoded data slices of the set of encoded data slices, determine whether a read threshold number of encoded data slices of the set of encoded data slices is available in the set of storage units associated with the first storage site and when a read threshold number of encoded data slices of the set of encoded data slices is not available in the set of storage units associated with a first storage site, transmit a read request for a read threshold number of encoded data slices to the set of storage units associated with a second storage site.
Storage cluster
A method for managing processing power in a storage system is provided. The method includes providing a plurality of blades, each of a first subset having a storage node and storage memory, and each of a second, differing subset having a compute-only node. The method includes distributing authorities across the plurality of blades, to a plurality of nodes including at least one compute-only node, wherein each authority has ownership of a range of user data.
Storage system, information processor, and computer-readable recording medium having stored therein program for generating parity
A storage system includes a first information processor, a second information processor, and a superordinate device. The first information processor includes a first memory device that stores therein the data, a difference generator that generates difference data representing a difference between updating data received from the superordinate device and the data stored in the first memory device before updating, a second memory device stores therein the generated difference data, and a data transmitter that transmits the stored difference data to the second information processor. The second information processor includes a third memory device that stores therein the parity, a data receiver that receives the difference data transmitted from the data transmitter, and a parity difference applier that generates a post-updating parity that is to be written into the third memory device by applying the received difference data to the stored parity before the updating.
Apparatus and method for accessing compressed data
A system and method for storing compressed data in a memory system includes identifying user data to be compressed and compressing pages of user data to form data extents that are less than or equal to the uncompressed data. A plurality of compressed pages are combined to a least fill a page of the memory. The data may be stored as sectors of a page, where each sector includes a CRC or error correcting code for the compressed data of that sector. The stored data may also include error correcting code data for the uncompressed page and error correcting code for the compressed page. When data is read in response to a user request, the sector data is validated using the CRC prior to selecting the data from the read sectors for decompression, and the error correcting code for the uncompressed page may be used to validate the decompressed data.
Data retrieval optimization for redundancy coded data storage systems with static redundancy ratios
Techniques described and suggested herein include systems and methods for improving data performance characteristics for data archives stored on data storage systems using redundancy coding techniques, without necessitating expansion of the implementing data storage system. For example, redundancy coded shards, which may include identity shards that contain unencoded original data of archives, may be configured such that a variable number of the shards can be leveraged to meet performance requirements for retrieval requests associated with the archives stored and/or encoded therein. Multiple shards may be assigned to devices in an existing infrastructure to improve performance characteristics without changing redundancy code parameters. Implementing systems may monitor random access rates, capabilities, and burdens, so as to adaptively account for changes to some or all of the monitored parameters.
Device type differentiation for redundancy coded data storage systems
Techniques described and suggested herein include systems and methods for optimizing performance characteristics by differentiating data storage device types for data archives stored on data storage systems using redundancy coding techniques. For example, redundancy coded shards, which may include identity shards that contain unencoded original data of archives, may be stored on different types of data storage devices to optimize for various retrieval use cases and implemented environments. Implementing systems may monitor various performance characteristics so as to adaptively account for changes to some or all of the monitored parameters.
Transmitter and method for generating additional parity thereof
A transmitter is provided. The transmitter includes: a Low Density Parity Check (LDPC) encoder configured to encode input bits to generate an LDPC codeword including the input bits and parity bits to be transmitted in a current frame; a parity permutator configured to perform parity-permutation by interleaving the parity bits and group-wise interleaving a plurality of bit groups configuring the interleaved parity bits based on a group-wise interleaving pattern including a first pattern and a second pattern; a puncturer configured to puncture some of the parity-permutated parity bits; and an additional parity generator configured to select at least some of the punctured parity bits to generate additional parity bits to be transmitted in a previous frame of the current frame, based on the first pattern and the second pattern, wherein the first pattern determines parity bits to remain after the puncturing and then to be transmitted in the current frame.
PROCESSING SYSTEM AND METHOD FOR LIVE VIDEO STREAMING BASED ON NETWORK CODING AND CONTENT DISTRIBUTION NETWORK
The present invention provides a processing system and method for live video streaming based on network coding and content distribution network, applied in video streaming over a network. The processing system comprises a live broadcast source station, at least one edge server and a plurality of player nodes. The live broadcast source station generates a streaming video file and sends to the edge server, at which network coding is performed to output coded information to the player node. The data amount received by each of the player nodes is less than the original streaming file. The player nodes exchange the coded information with each other. A decoding process is performed when a player node accumulates enough coded information. If a player node cannot accumulate enough coded information, more coded information will be requested from the edge server until the streaming video file is decodable.
Masked fault detection for reliable low voltage cache operation
Systems, apparatuses, and methods for implementing masked fault detection for reliable low voltage cache operation are disclosed. A processor includes a cache that can operate at a relatively low voltage level to conserve power. However, at low voltage levels, the cache is more likely to suffer from bit errors. To mitigate the bit errors occurring in cache lines at low voltage levels, the cache employs a strategy to uncover masked faults during runtime accesses to data by actual software applications. For example, on the first read of a given cache line, the data of the given cache line is inverted and written back to the same data array entry. Also, the error correction bits are regenerated for the inverted data. On a second read of the given cache line, if the fault population of the given cache line changes, then the given cache line's error protection level is updated.
Packet coding based network communication
A method for data communication between a first node and a second node over a data path includes determining one or more redundancy messages from data messages at the first node using an error correcting code and transmitting messages from the first node to the second node. The transmitted messages include the data messages and the redundancy messages. The method includes, receiving, at the first node, a first plurality of messages including messages indicative of a rate of arrival at the second node of the messages transmitted from the first node and messages indicative of successful and unsuccessful delivery of the messages transmitted from the first node to the second node. A first transmission limit and a second transmission limit are maintained according to the first plurality of messages. Transmission of messages from the first node to the second node is limited according to the maintained first transmission limit, and according to the second transmission limit.