US20170192898A1 - Intelligent slice caching - Google Patents
Intelligent slice caching Download PDFInfo
- Publication number
- US20170192898A1 US20170192898A1 US15/353,939 US201615353939A US2017192898A1 US 20170192898 A1 US20170192898 A1 US 20170192898A1 US 201615353939 A US201615353939 A US 201615353939A US 2017192898 A1 US2017192898 A1 US 2017192898A1
- Authority
- US
- United States
- Prior art keywords
- memory
- dispersed storage
- access rate
- encoded data
- stored
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability of storage systems
- G06F3/0619—Improving the reliability of storage systems in relation to data integrity, e.g. data losses, bit errors
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/06—Addressing a physical block of locations, e.g. base addressing, module addressing, memory dedication
- G06F12/0646—Configuration or reconfiguration
- G06F12/0684—Configuration or reconfiguration with feedback, e.g. presence or absence of unit detected by addressing, overflow detection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0806—Multiuser, multiprocessor or multiprocessing cache systems
- G06F12/0813—Multiuser, multiprocessor or multiprocessing cache systems with a network or matrix configuration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0888—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches using selective caching, e.g. bypass
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/14—Protection against unauthorised use of memory or access to memory
- G06F12/1408—Protection against unauthorised use of memory or access to memory by using cryptography
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/18—File system types
- G06F16/182—Distributed file systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0608—Saving storage space on storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
- G06F3/0611—Improving I/O performance in relation to response time
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0614—Improving the reliability of storage systems
- G06F3/0616—Improving the reliability of storage systems in relation to life time, e.g. increasing Mean Time Between Failures [MTBF]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/062—Securing storage systems
- G06F3/0623—Securing storage systems in relation to content
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
- G06F3/0631—Configuration or reconfiguration of storage systems by allocating resources to storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/064—Management of blocks
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0638—Organizing or formatting or addressing of data
- G06F3/0644—Management of space entities, e.g. partitions, extents, pools
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/0647—Migration mechanisms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/0652—Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0653—Monitoring storage devices or systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
- G06F3/0659—Command handling arrangements, e.g. command buffers, queues, command scheduling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
- G06F3/0661—Format or protocol conversion arrangements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- H03M13/3761—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
- H04L43/0888—Throughput
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1076—Parity data used in redundant arrays of independent storages, e.g. in RAID systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F11/1076—Parity data used in redundant arrays of independent storages, e.g. in RAID systems
- G06F11/1092—Rebuilding, e.g. when physically replacing a failing disk
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/10—Providing a specific technical effect
- G06F2212/1032—Reliability improvement, data loss prevention, degraded operation etc
- G06F2212/1036—Life time enhancement
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/15—Use in a specific computing environment
- G06F2212/154—Networked environment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/26—Using a specific storage system architecture
- G06F2212/263—Network storage, e.g. SAN or NAS
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/60—Details of cache memory
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/62—Details of cache specific to multiprocessor cache arrangements
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0662—Virtualisation aspects
- G06F3/0665—Virtualisation aspects at area level, e.g. provisioning of virtual or logical volumes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
- H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
- H03M13/151—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes using error location or error correction polynomials
- H03M13/1515—Reed-Solomon codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/16—Threshold monitoring
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Definitions
- This invention relates generally to computer networks, and more particularly to dispersed or cloud storage.
- FIG. 6 is a schematic block diagram of an example of slice naming information for an encoded data slice (EDS) in accordance with the present disclosure
- FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of data in accordance with the present disclosure.
- FIG. 8 is a schematic block diagram of a generic example of an error decoding function in accordance with the present disclosure.
- FIG. 9 is a schematic block diagram of an example of a dispersed storage network in accordance with the present disclosure.
- FIG. 10A is a schematic block diagram of another embodiment of a dispersed storage network (DSN) in accordance with the present invention.
- FIG. 1 is a schematic block diagram of an embodiment of a dispersed, or distributed, storage network (DSN) 10 that includes a plurality of dispersed storage (DS) computing devices or processing units 12 - 16 , a DS managing unit 18 , a DS integrity processing unit 20 , and a DSN memory 22 .
- the components of the DSN 10 are coupled to a network 24 , which may include one or more wireless and/or wire lined communication systems; one or more non-public intranet systems and/or public internet systems; and/or one or more local area networks (LAN) and/or wide area networks (WAN).
- LAN local area network
- WAN wide area network
- the DSN memory 22 includes a plurality of dispersed storage units 36 (DS units) that may be located at geographically different sites (e.g., one in Chicago, one in Milwaukee, etc.), at a common site, or a combination thereof. For example, if the DSN memory 22 includes eight dispersed storage units 36 , each storage unit is located at a different site. As another example, if the DSN memory 22 includes eight storage units 36 , all eight storage units are located at the same site.
- DS units dispersed storage units 36
- DS computing devices 12 - 16 , the managing unit 18 , and the integrity processing unit 20 include a computing core 26 , and network or communications interfaces 30 - 33 which can be part of or external to computing core 26 .
- DS computing devices 12 - 16 may each be a portable computing device and/or a fixed computing device.
- a portable computing device may be a social networking device, a gaming device, a cell phone, a smart phone, a digital assistant, a digital music player, a digital video player, a laptop computer, a handheld computer, a tablet, a video game controller, and/or any other portable device that includes a computing core.
- a fixed computing device may be a computer (PC), a computer server, a cable set-top box, a satellite receiver, a television set, a printer, a fax machine, home entertainment equipment, a video game console, and/or any type of home or office computing equipment.
- each of the managing unit 18 and the integrity processing unit 20 may be separate computing devices, may be a common computing device, and/or may be integrated into one or more of the computing devices 12 - 16 and/or into one or more of the dispersed storage units 36 .
- computing devices 12 and 16 include a dispersed storage (DS) client module 34 , which enables the computing device to dispersed storage error encode and decode data (e.g., data object 40 ) as subsequently described with reference to one or more of FIGS. 3-8 .
- computing device 16 functions as a dispersed storage processing agent for computing device 14 . In this role, computing device 16 dispersed storage error encodes and decodes data on behalf of computing device 14 .
- the second primary function begins and ends with a DS computing devices 12 - 14 .
- a second type of computing device 14 has data 40 to store in the DSN memory 22 , it sends the data 40 to the DS computing device 16 via its interface 30 .
- the interface 30 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.).
- OS operating system
- NFS network file system
- FFS flash file system
- DFS disk file system
- FTP file transfer protocol
- WebDAV web-based distributed authoring and versioning
- block memory interface e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.
- the managing unit 18 performs DS management services. For example, the managing unit 18 establishes distributed data storage parameters (e.g., vault creation, distributed storage parameters, security parameters, billing information, user profile information, etc.) for computing devices 12 - 16 individually or as part of a group of user devices. As a specific example, the managing unit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within the DSN memory 22 for a user device, a group of devices, or for public access and establishes per vault dispersed storage (DS) error encoding parameters for a vault.
- distributed data storage parameters e.g., vault creation, distributed storage parameters, security parameters, billing information, user profile information, etc.
- the managing unit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within the DSN memory 22 for a user device, a group of devices, or for public access and establishes
- the DS error encoding parameters include data segmenting information (e.g., how many segments data (e.g., a file, a group of files, a data block, etc.) is divided into), segment security information (e.g., per segment encryption, compression, integrity checksum, etc.), error coding information (e.g., pillar width, decode threshold, read threshold, write threshold, etc.), slicing information (e.g., the number of encoded data slices that will be created for each data segment); and slice security information (e.g., per encoded data slice encryption, compression, integrity checksum, etc.).
- data segmenting information e.g., how many segments data (e.g., a file, a group of files, a data block, etc.) is divided into
- segment security information e.g., per segment encryption, compression, integrity checksum, etc.
- error coding information e.g., pillar width, decode threshold, read threshold, write threshold, etc.
- slicing information
- the managing unit 18 creates and stores user profile information (e.g., an access control list (ACL)) in local memory and/or within memory of the DSN memory 22 .
- the user profile information includes authentication information, permissions, and/or the security parameters.
- the security parameters may include encryption/decryption scheme, one or more encryption keys, key generation scheme, and/or data encoding/decoding scheme.
- Bad and/or missing slices may be subsequently rebuilt using other retrieved encoded data slices that are deemed to be good slices in order to produce rebuilt slices.
- a multi-stage decoding process may be employed in certain circumstances to recover data even when the number of valid encoded data slices of a set of encoded data slices is less than a relevant decode threshold number.
- the rebuilt slices may then be written to DSN memory 22 .
- the integrity processing unit 20 may be a separate unit as shown, included in DSN memory 22 , included in the computing device 16 , managing unit 18 , stored on a DS unit 36 , and/or distributed among multiple storage units 36 .
- the one or more memory interface module(s) includes one or more of a universal serial bus (USB) interface module 66 , a host bus adapter (HBA) interface module 68 , a network interface module 70 , a flash interface module 72 , a hard drive interface module 74 , and a DSN interface module 76 .
- USB universal serial bus
- HBA host bus adapter
- the DSN interface module 76 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.).
- OS operating system
- the DSN interface module 76 and/or the network interface module 70 may function as one or more of the interface 30 - 33 of FIG. 1 .
- the IO device interface module 62 and/or the memory interface modules 66 - 76 may be collectively or individually referred to as IO ports.
- FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data.
- a computing device 12 or 16 When a computing device 12 or 16 has data to store it disperse storage error encodes the data in accordance with a dispersed storage error encoding process based on dispersed storage error encoding parameters.
- the dispersed storage error encoding parameters include an encoding function (e.g., information dispersal algorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematic encoding, on-line codes, etc.), a data segmenting protocol (e.g., data segment size, fixed, variable, etc.), and per data segment encoding values.
- an encoding function e.g., information dispersal algorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematic encoding, on-line codes, etc.
- a data segmenting protocol e.g., data segment size
- the per data segment encoding values include a total, or pillar width, number (T) of encoded data slices per encoding of a data segment (i.e., in a set of encoded data slices); a decode threshold number (D) of encoded data slices of a set of encoded data slices that are needed to recover the data segment; a read threshold number (R) of encoded data slices to indicate a number of encoded data slices per set to be read from storage for decoding of the data segment; and/or a write threshold number (W) to indicate a number of encoded data slices per set that must be accurately stored before the encoded data segment is deemed to have been properly stored.
- T total, or pillar width, number
- D decode threshold number
- R read threshold number
- W write threshold number
- the dispersed storage error encoding parameters may further include slicing information (e.g., the number of encoded data slices that will be created for each data segment) and/or slice security information (e.g., per encoded data slice encryption, compression, integrity checksum, etc.).
- slicing information e.g., the number of encoded data slices that will be created for each data segment
- slice security information e.g., per encoded data slice encryption, compression, integrity checksum, etc.
- the encoding function has been selected as Cauchy Reed-Solomon (a generic example is shown in FIG. 4 and a specific example is shown in FIG. 5 );
- the data segmenting protocol is to divide the data object into fixed sized data segments; and the per data segment encoding values include: a pillar width of 5, a decode threshold of 3, a read threshold of 4, and a write threshold of 4.
- FIG. 4 illustrates a generic Cauchy Reed-Solomon encoding function, which includes an encoding matrix (EM), a data matrix (DM), and a coded matrix (CM).
- the size of the encoding matrix (EM) is dependent on the pillar width number (T) and the decode threshold number (D) of selected per data segment encoding values.
- EM encoding matrix
- T pillar width number
- D decode threshold number
- Z is a function of the number of data blocks created from the data segment and the decode threshold number (D).
- the coded matrix is produced by matrix multiplying the data matrix by the encoding matrix.
- FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encoding with a pillar number (T) of five and decode threshold number of three.
- a first data segment is divided into twelve data blocks (D 1 -D 12 ).
- the coded matrix includes five rows of coded data blocks, where the first row of X 11 -X 14 corresponds to a first encoded data slice (EDS 1 _ 1 ), the second row of X 21 -X 24 corresponds to a second encoded data slice (EDS 2 _ 1 ), the third row of X 31 -X 34 corresponds to a third encoded data slice (EDS 3 _ 1 ), the fourth row of X 41 -X 44 corresponds to a fourth encoded data slice (EDS 4 _ 1 ), and the fifth row of X 51 -X 54 corresponds to a fifth encoded data slice (EDS 5 _ 1 ).
- the second number of the EDS designation corresponds to the data segment number.
- X 11 aD 1 +bD 5 +cD 9
- X 12 aD 2 +bD 6 +cD 10
- X 53 mD 3 +nD 7 +oD 11
- X 54 mD 4 +nD 8 +oD 12 .
- the computing device also creates a slice name (SN) for each encoded data slice (EDS) in the set of encoded data slices.
- a typical format for a slice name 80 is shown in FIG. 6 .
- the slice name (SN) 80 includes a pillar number of the encoded data slice (e.g., one of 1-T), a data segment number (e.g., one of 1-Y), a vault identifier (ID), a data object identifier (ID), and may further include revision level information of the encoded data slices.
- the slice name functions as at least part of a DSN address for the encoded data slice for storage and retrieval from the DSN memory 22 .
- the computing device 12 or 16 produces a plurality of sets of encoded data slices, which are provided with their respective slice names to the storage units for storage.
- the first set of encoded data slices includes EDS 1 _ 1 through EDS 5 _ 1 and the first set of slice names includes SN 1 _ 1 through SN 5 _ 1 and the last set of encoded data slices includes EDS 1 _Y through EDS 5 _Y and the last set of slice names includes SN 1 _Y through SN 5 _Y.
- FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of a data object that was dispersed storage error encoded and stored in the example of FIG. 4 .
- the computing device 12 or 16 retrieves from the storage units at least the decode threshold number of encoded data slices per data segment. As a specific example, the computing device retrieves a read threshold number of encoded data slices.
- the computing device uses a decoding function as shown in FIG. 8 .
- the decoding function is essentially an inverse of the encoding function of FIG. 4 .
- the coded matrix includes a decode threshold number of rows (e.g., three in this example) and the decoding matrix in an inversion of the encoding matrix that includes the corresponding rows of the coded matrix. For example, if the coded matrix includes rows 1 , 2 , and 4 , the encoding matrix is reduced to rows 1 , 2 , and 4 , and then inverted to produce the decoding matrix.
- FIG. 9 is a diagram of an example of a dispersed storage network.
- the dispersed storage network includes a DS (dispersed storage) client module 34 (which may be in DS computing devices 12 and/or 16 of FIG. 1 ), a network 24 , and a plurality of DS units 36 - 1 . . . 36 - n (which may be storage units 36 of FIG. 1 and which form at least a portion of DS memory 22 of FIG. 1 ), a DSN managing unit 18 , and a DS integrity verification module (not shown).
- the DS client module 34 includes an outbound DS processing section 81 and an inbound DS processing section 82 . Each of the DS units 36 - 1 . . .
- 36 - n includes a controller 86 , a processing module 84 (e.g. computer processor) including a communications interface for communicating over network 24 (not shown), memory 88 , a DT (distributed task) execution module 90 , and a DS client module 34 .
- the DS client module 34 receives data 92 .
- the data 92 may be of any size and of any content, where, due to the size (e.g., greater than a few Terabytes), the content (e.g., secure data, etc.), and/or concerns over security and loss of data, distributed storage of the data is desired.
- the data 92 may be one or more digital books, a copy of a company's emails, a large-scale Internet search, a video security file, one or more entertainment video files (e.g., television programs, movies, etc.), data files, and/or any other large amount of data (e.g., greater than a few Terabytes).
- the outbound DS processing section 81 receives the data 92 .
- the outbound DS processing section 81 processes the data 92 to produce slice groupings 96 .
- the outbound DS processing section 81 partitions the data 92 into a plurality of data partitions.
- the outbound DS processing section 81 dispersed storage (DS) error encodes the data partition to produce encoded data slices and groups the encoded data slices into a slice grouping 96 .
- DS dispersed storage
- the outbound DS processing section 81 then sends, via the network 24 , the slice groupings 96 to the DS units 36 - 1 . . . 36 - n of the DSN memory 22 of FIG. 1 .
- the outbound DS processing section 81 sends slice group 1 to DS storage unit 36 - 1 .
- the outbound DS processing section 81 sends slice group #n to DS unit #n.
- the DS client module 34 requests retrieval of stored data within the memory of the DS units 36 .
- the task 94 is retrieve data stored in the DSN memory 22 .
- the outbound DS processing section 81 converts the task 94 into a plurality of partial tasks 98 and sends the partial tasks 98 to the respective DS storage units 36 - 1 . . . 36 - n.
- a DS storage unit 36 In response to the partial task 98 of retrieving stored data, a DS storage unit 36 identifies the corresponding encoded data slices 99 and retrieves them. For example, DS unit #1 receives partial task #1 and retrieves, in response thereto, retrieved slices #1. The DS units 36 send their respective retrieved slices 99 to the inbound DS processing section 82 via the network 24 .
- the inbound DS processing section 82 converts the retrieved slices 99 into data 92 .
- the inbound DS processing section 82 de-groups the retrieved slices 99 to produce encoded slices per data partition.
- the inbound DS processing section 82 then DS error decodes the encoded slices per data partition to produce data partitions.
- the inbound DS processing section 82 de-partitions the data partitions to recapture the data 92 .
- the DSN of FIG. 1 is used to perform intelligent slice caching. Explanations of this process are set out below in conjunction with FIGS. 10A and 10B . While described in the context of functionality provided by DS units 36 , this functionality may be implemented utilizing any module and/or unit of a dispersed storage network (DSN) including the DS Processing Unit 16 , the DS Managing Unit 18 and/or the Integrity Processing Unit 20 , shown in FIG. 1 .
- DSN dispersed storage network
- a DS unit with a relatively, smaller high speed memory and a relatively larger low speed memory, moving more frequently accessed objects to the high speed memory can increase performance and reduce latency.
- frequent writes can cause degradation and wear. Therefore, in a DS unit utilizing such a highspeed, but wear-sensitive form of memory, more intelligent decision making may be utilized to optimally “cache” items in the high speed memory so as to reduce wear and keep it within an acceptable boundary.
- the effectiveness of a placement of a slice in the high speed memory of a DS unit can, in one example, be measured in terms of the number of times it is accessed per time frame or period that slice is moved into the high speed memory, and before it is replaced with something else.
- a minimum bar which a slice's access rate must exceed before it can be moved into the high speed memory.
- This bar can be raised or lowered, such that entry to, and eviction from, the high speed memory's cache can be lowered or increased to stay within the limits of the high speed, but wear-sensitive memory device.
- a slice's access patterns may be measured according to: Frequency of access for the slice; and the Length of time the slice last remained in the cache.
- a slice's access frequency exceeds that of the least frequently accessed slice in the cache, and the rate exceeds the minimum bar for moving an item into the cache, then the slice is moved to the high speed memory such that future access requests can be satisfied from that memory.
- this same logic described above can be applied in a DS processing unit 16 , only for the ds processing unit 16 it is applied to restored objects, rather than encoded data slices. Also, when load balancers/requesters know that a DS processing unit is using such a caching logic, it may purposely direct repeated requests for that same object to the same DS processing unit to maximize use of its cache, and likewise a DS processing unit requesting slices from a DS unit can do the same (by reusing the same threshold DS units for reading those slices when the slices are repeatedly requested).
- FIG. 10A is a schematic block diagram of another embodiment of a dispersed storage network that includes a set of storage units 36 - 1 , 36 - 2 . . . 36 - n , the network 24 of FIG. 1 , and the distributed storage (DS) processing unit 16 of FIG. 1 .
- Each storage unit includes a respective computer processor or processing module 84 of FIG. 9 ( 84 - 1 , 84 - 2 . . . 84 - n ), a small fast memory ( 88 - 1 - 1 , 88 - 2 - 1 . . . 88 - n ⁇ 1), and a large slow memory ( 88 - 1 - 2 , 88 - 2 - 2 . .
- the large slow memory has more memory capacity than the small fast memory and the small fast memory has a faster access latency times than the large slow memory.
- Each of the small fast memory and the large slow memory may be implemented utilizing the memory 88 of FIG. 9 .
- the small fast memory is implemented utilizing solid state memory technology and the large slow memory is implemented utilizing magnetic disk drive technology.
- Each storage unit may be implemented utilizing the DS execution unit 36 of FIG. 1 .
- the DSN functions to optimize utilization of storage memory.
- the processing modules 84 - 1 , 84 - 2 . . . 84 - n (as the case may be) determine a minimum slice access rate for slices ( 500 - 1 , 500 - 2 and 500 - n ) to be stored in the respective small fast memory 88 - 1 - 1 , 88 - 2 - 1 . . . 88 - n ⁇ 1.
- the determining may be based on one or more of a historical access rate, an estimated access rate for one or more encoded data slices, a memory wear factor (i.e., maximum number of write per unit of time), and a capacity level of the small fast memory.
- the respective processing module 84 - 1 , 84 - 2 . . . 84 - n determines a respective least access rate of a least accessed encoded data slice stored in the respective small fast memory. For example, the respective processing module 84 - 1 , 84 - 2 . . . 84 - n measures access rates of encoded data slices stored within the small fast memory and identifies a minimum access rate as the least access rate.
- the respective processing module 84 - 1 , 84 - 2 . . . 84 - n determines an estimated access rate for an encoded data slice.
- the determining includes at least one of identifying the slice identifying within a memory of an associated storage unit, measuring an actual access rate, and receiving the estimated access rate.
- the processing module 84 - 1 of the storage unit 1 receives a write slice request that includes an encoded data slice 500 - 1 of a set of encoded data slices for storage 500 - 1 , 500 - 2 . . . 500 - n and an estimated access rate for the encoded data slice 500 - 1 , where the DS processing unit 16 generates the set of encoded data slices, and sends, via the network 24 , the set of encoded data slices to the set of storage units.
- the respective processing module 84 - 1 , 84 - 2 . . . 84 - n determines whether to store (e.g., new to store, maintain storage) respective encoded data slice 500 - 1 , 500 - 2 . . . 500 - n in the respective small fast memory 88 - 1 - 1 , 88 - 2 - 1 . . . 88 - n ⁇ 1 as a cached encoded data slice based on the minimum slice access rate, the least access rate, and the estimated access rate.
- the processing module 84 - 1 indicates to store the encoded data slice 500 - 1 in the small fast memory 88 - 1 - 1 of storage unit 36 - 1 when the estimated access rate is greater than the minimum slice access rate and is greater than the least access rate.
- the respective processing module 84 - 1 , 84 - 2 . . . 84 - n facilitates storage of the respective encoded data slice 500 - 1 , 500 - 2 . . . 500 - n of a small fast memory.
- the facilitating includes one of the processing module 84 storing a received encoded data slice of a small fast memory and transferring the encoded data slice from the large slow memory to the small fast memory.
- FIG. 10B is a flowchart illustrating an example of optimizing utilization of storage memory.
- the method includes a step 600 where a processing module (e.g., of a storage unit) determines a minimum slice access rate for encoded data slices to be stored in a small fast memory. The determining may be based on one or more of historical access rates, a memory wear factor, and a capacity level of the small fast memory.
- the method continues at a step 602 where the processing module determines a least access rate of a least accessed encoded data slice stored in the small fast memory.
- the determining includes one or more of measuring access rates of encoded data slices stored within the small fast memory and identifying a minimum access rate as the least access rate.
- step 604 the processing module determines an estimated access rate for an encoded data slice.
- the determining includes one or more of identifying the encoded data slice (i.e., receiving, identifying within a memory the storage unit), measuring an actual access rate, and receiving the estimated access rate.
- step 606 the processing module determines whether to store the encoded data slice in the small fast memory as a cached encoded data slice based on the minimum slice access rate, the least access rate, and the estimated access rate.
- step 606 results in producing a determination.
- the processing module indicates to store the encoded data slice in the small fast memory when the estimated access rate is greater than the minimum slice access rate and is greater than the least access rate.
- the method continues at the step 608 where the processing module facilitates storage of the encoded data slice in the small fast memory.
- the facilitating includes one of storing the received encoded data slice in the small fast memory and transferring the encoded data slice from a large slow memory to the small fast memory.
- the processing module updates the minimum slice access rate and transfers and encoded data slice stored in small fast memory to the large slow memory when an actual access rate is less than the minimum slice access rate or is less than the least access rate.
- the terms “substantially” and “approximately” provides an industry-accepted tolerance for its corresponding term and/or relativity between items. Such an industry-accepted tolerance ranges from less than one percent to fifty percent and corresponds to, but is not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, and/or thermal noise. Such relativity between items ranges from a difference of a few percent to magnitude differences.
- the term(s) “configured to”, “operably coupled to”, “coupled to”, and/or “coupling” includes direct coupling between items and/or indirect coupling between items via an intervening item (e.g., an item includes, but is not limited to, a component, an element, a circuit, and/or a module) where, for an example of indirect coupling, the intervening item does not modify the information of a signal but may adjust its current level, voltage level, and/or power level.
- inferred coupling i.e., where one element is coupled to another element by inference
- the term “compares favorably”, indicates that a comparison between two or more items, signals, etc., provides a desired relationship. For example, when the desired relationship is that signal A has a greater magnitude than signal B, a favorable comparison may be achieved when the magnitude of signal A is greater than that of signal B or when the magnitude of signal B is less than that of signal A. As may be used herein, the term “compares unfavorably”, indicates that a comparison between two or more items, signals, etc., fails to provide the desired relationship.
- processing module may be a single processing device or a plurality of processing devices.
- a processing device may be a microprocessor, micro-controller, digital signal processor, microcomputer, central processing unit, field programmable gate array, programmable logic device, state machine, logic circuitry, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on hard coding of the circuitry and/or operational instructions.
- the processing module, module, processing circuit, and/or processing unit may be, or further include, memory and/or an integrated memory element, which may be a single memory device, a plurality of memory devices, and/or embedded circuitry of another processing module, module, processing circuit, and/or processing unit.
- a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information.
- processing module, module, processing circuit, and/or processing unit includes more than one processing device, the processing devices may be centrally located (e.g., directly coupled together via a wired and/or wireless bus structure) or may be distributedly located (e.g., cloud computing via indirect coupling via a local area network and/or a wide area network). Further note that if the processing module, module, processing circuit, and/or processing unit implements one or more of its functions via a state machine, analog circuitry, digital circuitry, and/or logic circuitry, the memory and/or memory element storing the corresponding operational instructions may be embedded within, or external to, the circuitry comprising the state machine, analog circuitry, digital circuitry, and/or logic circuitry.
- the memory element may store, and the processing module, module, processing circuit, and/or processing unit executes, hard coded and/or operational instructions corresponding to at least some of the steps and/or functions illustrated in one or more of the Figures.
- Such a memory device or memory element can be included in an article of manufacture.
- a flow diagram may include a “start” and/or “continue” indication.
- the “start” and “continue” indications reflect that the steps presented can optionally be incorporated in or otherwise used in conjunction with other routines.
- start indicates the beginning of the first step presented and may be preceded by other activities not specifically shown.
- continue indicates that the steps presented may be performed multiple times and/or may be succeeded by other activities not specifically shown.
- a flow diagram indicates a particular ordering of steps, other orderings are likewise possible provided that the principles of causality are maintained.
- the one or more embodiments are used herein to illustrate one or more aspects, one or more features, one or more concepts, and/or one or more examples.
- a physical embodiment of an apparatus, an article of manufacture, a machine, and/or of a process may include one or more of the aspects, features, concepts, examples, etc. described with reference to one or more of the embodiments discussed herein.
- the embodiments may incorporate the same or similarly named functions, steps, modules, etc. that may use the same or different reference numbers and, as such, the functions, steps, modules, etc. may be the same or similar functions, steps, modules, etc. or different ones.
- signals to, from, and/or between elements in a figure of any of the figures presented herein may be analog or digital, continuous time or discrete time, and single-ended or differential.
- signals to, from, and/or between elements in a figure of any of the figures presented herein may be analog or digital, continuous time or discrete time, and single-ended or differential.
- a signal path is shown as a single-ended path, it also represents a differential signal path.
- a signal path is shown as a differential path, it also represents a single-ended signal path.
- module is used in the description of one or more of the embodiments.
- a module implements one or more functions via a device such as a processor or other processing device or other hardware that may include or operate in association with a memory that stores operational instructions.
- a module may operate independently and/or in conjunction with software and/or firmware.
- a module may contain one or more sub-modules, each of which may be one or more modules.
- a computer readable memory includes one or more memory elements.
- a memory element may be a separate memory device, multiple memory devices, or a set of memory locations within a memory device.
- Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information.
- the memory device may be in a form a solid state memory, a hard drive memory, cloud memory, thumb drive, server memory, computing device memory, and/or other physical medium for storing digital information.
- a computer readable memory/storage medium is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Human Computer Interaction (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Environmental & Geological Engineering (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Quality & Reliability (AREA)
- Mathematical Physics (AREA)
- Probability & Statistics with Applications (AREA)
- Software Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Algebra (AREA)
- Pure & Applied Mathematics (AREA)
- Storage Device Security (AREA)
- Detection And Correction Of Errors (AREA)
Abstract
Description
- The present U.S. Utility Patent Application claims priority pursuant to 35 U.S.C. §119(e) to U.S. Provisional Application No. 62/272,848 filed 30 Dec. 2015, entitled “OPTIMIZING UTILIZATION OF STORAGE MEMORY IN A DISPERSED STORAGE NETWORK,” which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility Patent Application for all purposes.
- Not Applicable.
- Not Applicable.
- Technical Field of the Invention
- This invention relates generally to computer networks, and more particularly to dispersed or cloud storage.
- Description of Related Art
- Computing devices are known to communicate data, process data, and/or store data. Such computing devices range from wireless smart phones, laptops, tablets, personal computers (PC), work stations, and video game devices, to data centers that support millions of web searches, stock trades, or on-line purchases every day. In general, a computing device includes a central processing unit (CPU), a memory system, user input/output interfaces, peripheral device interfaces, and an interconnecting bus structure.
- As is further known, a computer may effectively extend its CPU by using “cloud computing” to perform one or more computing functions (e.g., a service, an application, an algorithm, an arithmetic logic function, etc.) on behalf of the computer. Further, for large services, applications, and/or functions, cloud computing may be performed by multiple cloud computing resources in a distributed manner to improve the response time for completion of the service, application, and/or function. For example, Hadoop is an open source software framework that supports distributed applications enabling application execution by thousands of computers.
- In addition to cloud computing, a computer may use “cloud storage” as part of its memory system. As is known, cloud storage enables a user, via its computer, to store files, applications, etc. on a remote or Internet storage system. The remote or Internet storage system may include a RAID (redundant array of independent disks) system and/or a dispersed storage system that uses an error correction scheme to encode data for storage.
- In a RAID system, a RAID controller adds parity data to the original data before storing it across an array of disks. The parity data is calculated from the original data such that the failure of a single disk typically will not result in the loss of the original data. While RAID systems can address certain memory device failures, these systems may suffer from effectiveness, efficiency and security issues. For instance, as more disks are added to the array, the probability of a disk failure rises, which may increase maintenance costs. When a disk fails, for example, it needs to be manually replaced before another disk(s) fails and the data stored in the RAID system is lost. To reduce the risk of data loss, data on a RAID device is often copied to one or more other RAID devices. While this may reduce the possibility of data loss, it also raises security issues since multiple copies of data may be available, thereby increasing the chances of unauthorized access. In addition, co-location of some RAID devices may result in a risk of a complete data loss in the event of a natural disaster, fire, power surge/outage, etc.
-
FIG. 1 is a schematic block diagram of an embodiment of a dispersed, or distributed, storage network (DSN) in accordance with the present disclosure; -
FIG. 2 is a schematic block diagram of an embodiment of a computing core in accordance with the present disclosure; -
FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data in accordance with the present disclosure; -
FIG. 4 is a schematic block diagram of a generic example of an error encoding function in accordance with the present disclosure; -
FIG. 5 is a schematic block diagram of a specific example of an error encoding function in accordance with the present disclosure; -
FIG. 6 is a schematic block diagram of an example of slice naming information for an encoded data slice (EDS) in accordance with the present disclosure; -
FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of data in accordance with the present disclosure; -
FIG. 8 is a schematic block diagram of a generic example of an error decoding function in accordance with the present disclosure; -
FIG. 9 is a schematic block diagram of an example of a dispersed storage network in accordance with the present disclosure; -
FIG. 10A is a schematic block diagram of another embodiment of a dispersed storage network (DSN) in accordance with the present invention; and -
FIG. 10B is a flowchart illustrating an example of intelligent slice caching in a dispersed storage network (DSN). -
FIG. 1 is a schematic block diagram of an embodiment of a dispersed, or distributed, storage network (DSN) 10 that includes a plurality of dispersed storage (DS) computing devices or processing units 12-16, aDS managing unit 18, a DSintegrity processing unit 20, and aDSN memory 22. The components of the DSN 10 are coupled to anetwork 24, which may include one or more wireless and/or wire lined communication systems; one or more non-public intranet systems and/or public internet systems; and/or one or more local area networks (LAN) and/or wide area networks (WAN). - The DSN
memory 22 includes a plurality of dispersed storage units 36 (DS units) that may be located at geographically different sites (e.g., one in Chicago, one in Milwaukee, etc.), at a common site, or a combination thereof. For example, if the DSNmemory 22 includes eight dispersedstorage units 36, each storage unit is located at a different site. As another example, if the DSNmemory 22 includes eightstorage units 36, all eight storage units are located at the same site. As yet another example, if the DSNmemory 22 includes eightstorage units 36, a first pair of storage units are at a first common site, a second pair of storage units are at a second common site, a third pair of storage units are at a third common site, and a fourth pair of storage units are at a fourth common site. Note that aDSN memory 22 may include more or less than eightstorage units 36. - DS computing devices 12-16, the managing
unit 18, and theintegrity processing unit 20 include acomputing core 26, and network or communications interfaces 30-33 which can be part of or external to computingcore 26. DS computing devices 12-16 may each be a portable computing device and/or a fixed computing device. A portable computing device may be a social networking device, a gaming device, a cell phone, a smart phone, a digital assistant, a digital music player, a digital video player, a laptop computer, a handheld computer, a tablet, a video game controller, and/or any other portable device that includes a computing core. A fixed computing device may be a computer (PC), a computer server, a cable set-top box, a satellite receiver, a television set, a printer, a fax machine, home entertainment equipment, a video game console, and/or any type of home or office computing equipment. Note that each of the managingunit 18 and theintegrity processing unit 20 may be separate computing devices, may be a common computing device, and/or may be integrated into one or more of the computing devices 12-16 and/or into one or more of the dispersedstorage units 36. - Each
interface network 24 indirectly and/or directly. For example,interface 30 supports a communication link (e.g., wired, wireless, direct, via a LAN, via thenetwork 24, etc.) betweencomputing devices interface 32 supports communication links (e.g., a wired connection, a wireless connection, a LAN connection, and/or any other type of connection to/from the network 24) betweencomputing devices DSN memory 22. As yet another example,interface 33 supports a communication link for each of the managingunit 18 and theintegrity processing unit 20 to thenetwork 24. - In general, and with respect to DS error encoded data storage and retrieval, the DSN 10 supports three primary operations: storage management, data storage and retrieval. More specifically
computing devices client module 34, which enables the computing device to dispersed storage error encode and decode data (e.g., data object 40) as subsequently described with reference to one or more ofFIGS. 3-8 . In this example embodiment,computing device 16 functions as a dispersed storage processing agent forcomputing device 14. In this role,computing device 16 dispersed storage error encodes and decodes data on behalf ofcomputing device 14. With the use of dispersed storage error encoding and decoding, the DSN 10 is tolerant of a significant number of storage unit failures (the number of failures is based on parameters of the dispersed storage error encoding function) without loss of data and without the need for a redundant or backup copies of the data. Further, the DSN 10 stores data for an indefinite period of time without data loss and in a secure manner (e.g., the system is very resistant to unauthorized attempts at accessing or hacking the data). - The second primary function (i.e., distributed data storage and retrieval) begins and ends with a DS computing devices 12-14. For instance, if a second type of
computing device 14 hasdata 40 to store in theDSN memory 22, it sends thedata 40 to theDS computing device 16 via itsinterface 30. Theinterface 30 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.). - In operation, the managing
unit 18 performs DS management services. For example, the managingunit 18 establishes distributed data storage parameters (e.g., vault creation, distributed storage parameters, security parameters, billing information, user profile information, etc.) for computing devices 12-16 individually or as part of a group of user devices. As a specific example, the managingunit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within theDSN memory 22 for a user device, a group of devices, or for public access and establishes per vault dispersed storage (DS) error encoding parameters for a vault. The managingunit 18 facilitates storage of DS error encoding parameters for each vault by updating registry information of theDSN 10, where the registry information may be stored in theDSN memory 22, a computing device 12-16, the managingunit 18, and/or theintegrity processing unit 20. - The DS error encoding parameters (e.g., or dispersed storage error coding parameters) include data segmenting information (e.g., how many segments data (e.g., a file, a group of files, a data block, etc.) is divided into), segment security information (e.g., per segment encryption, compression, integrity checksum, etc.), error coding information (e.g., pillar width, decode threshold, read threshold, write threshold, etc.), slicing information (e.g., the number of encoded data slices that will be created for each data segment); and slice security information (e.g., per encoded data slice encryption, compression, integrity checksum, etc.).
- The managing
unit 18 creates and stores user profile information (e.g., an access control list (ACL)) in local memory and/or within memory of theDSN memory 22. The user profile information includes authentication information, permissions, and/or the security parameters. The security parameters may include encryption/decryption scheme, one or more encryption keys, key generation scheme, and/or data encoding/decoding scheme. - The managing
unit 18 creates billing information for a particular user, a user group, a vault access, public vault access, etc. For instance, the managingunit 18 tracks the number of times a user accesses a non-public vault and/or public vaults, which can be used to generate per-access billing information. In another instance, the managingunit 18 tracks the amount of data stored and/or retrieved by a user device and/or a user group, which can be used to generate per-data-amount billing information. As will be described in more detail in conjunction withFIGS. 10A and 10B , usage can be determined by a managingunit 18 on a byte-hour basis. - As another example, the managing
unit 18 performs network operations, network administration, and/or network maintenance. Network operations includes authenticating user data allocation requests (e.g., read and/or write requests), managing creation of vaults, establishing authentication credentials for user devices, adding/deleting components (e.g., user devices, storage units, and/or computing devices with a DS client module 34) to/from theDSN 10, and/or establishing authentication credentials for thestorage units 36. Network operations can further include monitoring read, write and/or delete communications attempts, which attempts could be in the form of requests. Network administration includes monitoring devices and/or units for failures, maintaining vault information, determining device and/or unit activation status, determining device and/or unit loading, and/or determining any other system level operation that affects the performance level of theDSN 10. Network maintenance includes facilitating replacing, upgrading, repairing, and/or expanding a device and/or unit of theDSN 10. - To support data storage integrity verification within the
DSN 10, the integrity processing unit 20 (and/or other devices in theDSN 10 such as managing unit 18) may assess and perform rebuilding of ‘bad’ or missing encoded data slices. At a high level, theintegrity processing unit 20 performs rebuilding by periodically attempting to retrieve/list encoded data slices, and/or slice names of the encoded data slices, from theDSN memory 22. Retrieved encoded slices are assessed and checked for errors due to data corruption, outdated versioning, etc. If a slice includes an error, it is flagged as a ‘bad’ or ‘corrupt’ slice. Encoded data slices that are not received and/or not listed may be flagged as missing slices. Bad and/or missing slices may be subsequently rebuilt using other retrieved encoded data slices that are deemed to be good slices in order to produce rebuilt slices. A multi-stage decoding process may be employed in certain circumstances to recover data even when the number of valid encoded data slices of a set of encoded data slices is less than a relevant decode threshold number. The rebuilt slices may then be written toDSN memory 22. Note that theintegrity processing unit 20 may be a separate unit as shown, included inDSN memory 22, included in thecomputing device 16, managingunit 18, stored on aDS unit 36, and/or distributed amongmultiple storage units 36. -
FIG. 2 is a schematic block diagram of an embodiment of acomputing core 26 that includes aprocessing module 50, amemory controller 52,main memory 54, a videographics processing unit 55, an input/output (IO)controller 56, a peripheral component interconnect (PCI)interface 58, anIO interface module 60, at least one IOdevice interface module 62, a read only memory (ROM) basic input output system (BIOS) 64, and one or more memory interface modules. The one or more memory interface module(s) includes one or more of a universal serial bus (USB) interface module 66, a host bus adapter (HBA)interface module 68, anetwork interface module 70, aflash interface module 72, a harddrive interface module 74, and a DSN interface module 76. - The DSN interface module 76 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.). The DSN interface module 76 and/or the
network interface module 70 may function as one or more of the interface 30-33 ofFIG. 1 . Note that the IOdevice interface module 62 and/or the memory interface modules 66-76 may be collectively or individually referred to as IO ports. -
FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data. When acomputing device - In the present example, Cauchy Reed-Solomon has been selected as the encoding function (a generic example is shown in
FIG. 4 and a specific example is shown inFIG. 5 ); the data segmenting protocol is to divide the data object into fixed sized data segments; and the per data segment encoding values include: a pillar width of 5, a decode threshold of 3, a read threshold of 4, and a write threshold of 4. In accordance with the data segmenting protocol, thecomputing device - The
computing device FIG. 4 illustrates a generic Cauchy Reed-Solomon encoding function, which includes an encoding matrix (EM), a data matrix (DM), and a coded matrix (CM). The size of the encoding matrix (EM) is dependent on the pillar width number (T) and the decode threshold number (D) of selected per data segment encoding values. To produce the data matrix (DM), the data segment is divided into a plurality of data blocks and the data blocks are arranged into D number of rows with Z data blocks per row. Note that Z is a function of the number of data blocks created from the data segment and the decode threshold number (D). The coded matrix is produced by matrix multiplying the data matrix by the encoding matrix. -
FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encoding with a pillar number (T) of five and decode threshold number of three. In this example, a first data segment is divided into twelve data blocks (D1-D12). The coded matrix includes five rows of coded data blocks, where the first row of X11-X14 corresponds to a first encoded data slice (EDS 1_1), the second row of X21-X24 corresponds to a second encoded data slice (EDS 2_1), the third row of X31-X34 corresponds to a third encoded data slice (EDS 3_1), the fourth row of X41-X44 corresponds to a fourth encoded data slice (EDS 4_1), and the fifth row of X51-X54 corresponds to a fifth encoded data slice (EDS 5_1). Note that the second number of the EDS designation corresponds to the data segment number. In the illustrated example, the value X11=aD1+bD5+cD9, X12=aD2+bD6+cD10, . . . X53=mD3+nD7+oD11, and X54=mD4+nD8+oD12. - Returning to the discussion of
FIG. 3 , the computing device also creates a slice name (SN) for each encoded data slice (EDS) in the set of encoded data slices. A typical format for aslice name 80 is shown inFIG. 6 . As shown, the slice name (SN) 80 includes a pillar number of the encoded data slice (e.g., one of 1-T), a data segment number (e.g., one of 1-Y), a vault identifier (ID), a data object identifier (ID), and may further include revision level information of the encoded data slices. The slice name functions as at least part of a DSN address for the encoded data slice for storage and retrieval from theDSN memory 22. - As a result of encoding, the
computing device -
FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of a data object that was dispersed storage error encoded and stored in the example ofFIG. 4 . In this example, thecomputing device - In order to recover a data segment from a decode threshold number of encoded data slices, the computing device uses a decoding function as shown in
FIG. 8 . As shown, the decoding function is essentially an inverse of the encoding function ofFIG. 4 . The coded matrix includes a decode threshold number of rows (e.g., three in this example) and the decoding matrix in an inversion of the encoding matrix that includes the corresponding rows of the coded matrix. For example, if the coded matrix includesrows rows -
FIG. 9 is a diagram of an example of a dispersed storage network. The dispersed storage network includes a DS (dispersed storage) client module 34 (which may be inDS computing devices 12 and/or 16 ofFIG. 1 ), anetwork 24, and a plurality of DS units 36-1 . . . 36-n (which may bestorage units 36 ofFIG. 1 and which form at least a portion ofDS memory 22 ofFIG. 1 ), aDSN managing unit 18, and a DS integrity verification module (not shown). TheDS client module 34 includes an outboundDS processing section 81 and an inboundDS processing section 82. Each of the DS units 36-1 . . . 36-n includes acontroller 86, a processing module 84 (e.g. computer processor) including a communications interface for communicating over network 24 (not shown),memory 88, a DT (distributed task)execution module 90, and aDS client module 34. - In an example of operation, the
DS client module 34 receivesdata 92. Thedata 92 may be of any size and of any content, where, due to the size (e.g., greater than a few Terabytes), the content (e.g., secure data, etc.), and/or concerns over security and loss of data, distributed storage of the data is desired. For example, thedata 92 may be one or more digital books, a copy of a company's emails, a large-scale Internet search, a video security file, one or more entertainment video files (e.g., television programs, movies, etc.), data files, and/or any other large amount of data (e.g., greater than a few Terabytes). - Within the
DS client module 34, the outboundDS processing section 81 receives thedata 92. The outboundDS processing section 81 processes thedata 92 to produceslice groupings 96. As an example of such processing, the outboundDS processing section 81 partitions thedata 92 into a plurality of data partitions. For each data partition, the outboundDS processing section 81 dispersed storage (DS) error encodes the data partition to produce encoded data slices and groups the encoded data slices into aslice grouping 96. - The outbound
DS processing section 81 then sends, via thenetwork 24, theslice groupings 96 to the DS units 36-1 . . . 36-n of theDSN memory 22 ofFIG. 1 . For example, the outboundDS processing section 81 sendsslice group 1 to DS storage unit 36-1. As another example, the outboundDS processing section 81 sends slice group #n to DS unit #n. - In one example of operation, the
DS client module 34 requests retrieval of stored data within the memory of theDS units 36. In this example, thetask 94 is retrieve data stored in theDSN memory 22. Accordingly, and according to one embodiment, the outboundDS processing section 81 converts thetask 94 into a plurality ofpartial tasks 98 and sends thepartial tasks 98 to the respective DS storage units 36-1 . . . 36-n. - In response to the
partial task 98 of retrieving stored data, aDS storage unit 36 identifies the corresponding encoded data slices 99 and retrieves them. For example,DS unit # 1 receivespartial task # 1 and retrieves, in response thereto, retrievedslices # 1. TheDS units 36 send their respective retrievedslices 99 to the inboundDS processing section 82 via thenetwork 24. - The inbound
DS processing section 82 converts the retrieved slices 99 intodata 92. For example, the inboundDS processing section 82 de-groups the retrieved slices 99 to produce encoded slices per data partition. The inboundDS processing section 82 then DS error decodes the encoded slices per data partition to produce data partitions. The inboundDS processing section 82 de-partitions the data partitions to recapture thedata 92. - In one example of operation, the DSN of
FIG. 1 is used to perform intelligent slice caching. Explanations of this process are set out below in conjunction withFIGS. 10A and 10B . While described in the context of functionality provided byDS units 36, this functionality may be implemented utilizing any module and/or unit of a dispersed storage network (DSN) including theDS Processing Unit 16, theDS Managing Unit 18 and/or theIntegrity Processing Unit 20, shown inFIG. 1 . - In a DS unit, with a relatively, smaller high speed memory and a relatively larger low speed memory, moving more frequently accessed objects to the high speed memory can increase performance and reduce latency. However, for some forms of memory, frequent writes can cause degradation and wear. Therefore, in a DS unit utilizing such a highspeed, but wear-sensitive form of memory, more intelligent decision making may be utilized to optimally “cache” items in the high speed memory so as to reduce wear and keep it within an acceptable boundary. The effectiveness of a placement of a slice in the high speed memory of a DS unit can, in one example, be measured in terms of the number of times it is accessed per time frame or period that slice is moved into the high speed memory, and before it is replaced with something else. One mechanism to achieve these goals is to set a minimum bar which a slice's access rate must exceed before it can be moved into the high speed memory. This bar can be raised or lowered, such that entry to, and eviction from, the high speed memory's cache can be lowered or increased to stay within the limits of the high speed, but wear-sensitive memory device. Once the bar is set, a slice's access patterns may be measured according to: Frequency of access for the slice; and the Length of time the slice last remained in the cache. According to one example, when a slice's access frequency exceeds that of the least frequently accessed slice in the cache, and the rate exceeds the minimum bar for moving an item into the cache, then the slice is moved to the high speed memory such that future access requests can be satisfied from that memory.
- In another example, this same logic described above can be applied in a
DS processing unit 16, only for theds processing unit 16 it is applied to restored objects, rather than encoded data slices. Also, when load balancers/requesters know that a DS processing unit is using such a caching logic, it may purposely direct repeated requests for that same object to the same DS processing unit to maximize use of its cache, and likewise a DS processing unit requesting slices from a DS unit can do the same (by reusing the same threshold DS units for reading those slices when the slices are repeatedly requested). -
FIG. 10A is a schematic block diagram of another embodiment of a dispersed storage network that includes a set of storage units 36-1, 36-2 . . . 36-n, thenetwork 24 ofFIG. 1 , and the distributed storage (DS)processing unit 16 ofFIG. 1 . Each storage unit includes a respective computer processor orprocessing module 84 ofFIG. 9 (84-1, 84-2 . . . 84-n), a small fast memory (88-1-1, 88-2-1 . . . 88-n−1), and a large slow memory (88-1-2, 88-2-2 . . . 88-n−2). According to this example the large slow memory has more memory capacity than the small fast memory and the small fast memory has a faster access latency times than the large slow memory. Each of the small fast memory and the large slow memory may be implemented utilizing thememory 88 ofFIG. 9 . For example, the small fast memory is implemented utilizing solid state memory technology and the large slow memory is implemented utilizing magnetic disk drive technology. Each storage unit may be implemented utilizing theDS execution unit 36 ofFIG. 1 . According to one example, the DSN functions to optimize utilization of storage memory. - In an example of operation of the optimizing of utilization of the storage memory, the processing modules 84-1, 84-2 . . . 84-n (as the case may be) determine a minimum slice access rate for slices (500-1, 500-2 and 500-n) to be stored in the respective small fast memory 88-1-1, 88-2-1 . . . 88-n−1. The determining may be based on one or more of a historical access rate, an estimated access rate for one or more encoded data slices, a memory wear factor (i.e., maximum number of write per unit of time), and a capacity level of the small fast memory. Having determined the minimum slice access rate, the respective processing module 84-1, 84-2 . . . 84-n determines a respective least access rate of a least accessed encoded data slice stored in the respective small fast memory. For example, the respective processing module 84-1, 84-2 . . . 84-n measures access rates of encoded data slices stored within the small fast memory and identifies a minimum access rate as the least access rate.
- Having determined the least access rate, the respective processing module 84-1, 84-2 . . . 84-n determines an estimated access rate for an encoded data slice. The determining includes at least one of identifying the slice identifying within a memory of an associated storage unit, measuring an actual access rate, and receiving the estimated access rate. For example, the processing module 84-1 of the
storage unit 1 receives a write slice request that includes an encoded data slice 500-1 of a set of encoded data slices for storage 500-1, 500-2 . . . 500-n and an estimated access rate for the encoded data slice 500-1, where theDS processing unit 16 generates the set of encoded data slices, and sends, via thenetwork 24, the set of encoded data slices to the set of storage units. - Having determined the estimated access rate for the encoded data slice, the respective processing module 84-1, 84-2 . . . 84-n determines whether to store (e.g., new to store, maintain storage) respective encoded data slice 500-1, 500-2 . . . 500-n in the respective small fast memory 88-1-1, 88-2-1 . . . 88-n−1 as a cached encoded data slice based on the minimum slice access rate, the least access rate, and the estimated access rate. For example, the processing module 84-1 indicates to store the encoded data slice 500-1 in the small fast memory 88-1-1 of storage unit 36-1 when the estimated access rate is greater than the minimum slice access rate and is greater than the least access rate.
- When determining to store a respective encoded data slice in a respective small fast memory 88-1-1, 88-2-1 . . . 88-n−1, the respective processing module 84-1, 84-2 . . . 84-n facilitates storage of the respective encoded data slice 500-1, 500-2 . . . 500-n of a small fast memory. The facilitating includes one of the
processing module 84 storing a received encoded data slice of a small fast memory and transferring the encoded data slice from the large slow memory to the small fast memory. -
FIG. 10B is a flowchart illustrating an example of optimizing utilization of storage memory. The method includes astep 600 where a processing module (e.g., of a storage unit) determines a minimum slice access rate for encoded data slices to be stored in a small fast memory. The determining may be based on one or more of historical access rates, a memory wear factor, and a capacity level of the small fast memory. The method continues at astep 602 where the processing module determines a least access rate of a least accessed encoded data slice stored in the small fast memory. The determining includes one or more of measuring access rates of encoded data slices stored within the small fast memory and identifying a minimum access rate as the least access rate. - The method continues at the
step 604 where the processing module determines an estimated access rate for an encoded data slice. The determining includes one or more of identifying the encoded data slice (i.e., receiving, identifying within a memory the storage unit), measuring an actual access rate, and receiving the estimated access rate. The method continues at thestep 606 where the processing module determines whether to store the encoded data slice in the small fast memory as a cached encoded data slice based on the minimum slice access rate, the least access rate, and the estimated access rate. According to one example, step 606 results in producing a determination. For example, the processing module indicates to store the encoded data slice in the small fast memory when the estimated access rate is greater than the minimum slice access rate and is greater than the least access rate. - When storing the encoded data slice of a small fast memory, the method continues at the
step 608 where the processing module facilitates storage of the encoded data slice in the small fast memory. The facilitating includes one of storing the received encoded data slice in the small fast memory and transferring the encoded data slice from a large slow memory to the small fast memory. Alternatively, or in addition to, the processing module updates the minimum slice access rate and transfers and encoded data slice stored in small fast memory to the large slow memory when an actual access rate is less than the minimum slice access rate or is less than the least access rate. - As may be used herein, the terms “substantially” and “approximately” provides an industry-accepted tolerance for its corresponding term and/or relativity between items. Such an industry-accepted tolerance ranges from less than one percent to fifty percent and corresponds to, but is not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, and/or thermal noise. Such relativity between items ranges from a difference of a few percent to magnitude differences. As may also be used herein, the term(s) “configured to”, “operably coupled to”, “coupled to”, and/or “coupling” includes direct coupling between items and/or indirect coupling between items via an intervening item (e.g., an item includes, but is not limited to, a component, an element, a circuit, and/or a module) where, for an example of indirect coupling, the intervening item does not modify the information of a signal but may adjust its current level, voltage level, and/or power level. As may further be used herein, inferred coupling (i.e., where one element is coupled to another element by inference) includes direct and indirect coupling between two items in the same manner as “coupled to”. As may even further be used herein, the term “configured to”, “operable to”, “coupled to”, or “operably coupled to” indicates that an item includes one or more of power connections, input(s), output(s), etc., to perform, when activated, one or more its corresponding functions and may further include inferred coupling to one or more other items. As may still further be used herein, the term “associated with”, includes direct and/or indirect coupling of separate items and/or one item being embedded within another item.
- As may be used herein, the term “compares favorably”, indicates that a comparison between two or more items, signals, etc., provides a desired relationship. For example, when the desired relationship is that signal A has a greater magnitude than signal B, a favorable comparison may be achieved when the magnitude of signal A is greater than that of signal B or when the magnitude of signal B is less than that of signal A. As may be used herein, the term “compares unfavorably”, indicates that a comparison between two or more items, signals, etc., fails to provide the desired relationship.
- As may also be used herein, the terms “processing module”, “processing circuit”, “processor”, and/or “processing unit” may be a single processing device or a plurality of processing devices. Such a processing device may be a microprocessor, micro-controller, digital signal processor, microcomputer, central processing unit, field programmable gate array, programmable logic device, state machine, logic circuitry, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on hard coding of the circuitry and/or operational instructions. The processing module, module, processing circuit, and/or processing unit may be, or further include, memory and/or an integrated memory element, which may be a single memory device, a plurality of memory devices, and/or embedded circuitry of another processing module, module, processing circuit, and/or processing unit. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. Note that if the processing module, module, processing circuit, and/or processing unit includes more than one processing device, the processing devices may be centrally located (e.g., directly coupled together via a wired and/or wireless bus structure) or may be distributedly located (e.g., cloud computing via indirect coupling via a local area network and/or a wide area network). Further note that if the processing module, module, processing circuit, and/or processing unit implements one or more of its functions via a state machine, analog circuitry, digital circuitry, and/or logic circuitry, the memory and/or memory element storing the corresponding operational instructions may be embedded within, or external to, the circuitry comprising the state machine, analog circuitry, digital circuitry, and/or logic circuitry. Still further note that, the memory element may store, and the processing module, module, processing circuit, and/or processing unit executes, hard coded and/or operational instructions corresponding to at least some of the steps and/or functions illustrated in one or more of the Figures. Such a memory device or memory element can be included in an article of manufacture.
- One or more embodiments have been described above with the aid of method steps illustrating the performance of specified functions and relationships thereof. The boundaries and sequence of these functional building blocks and method steps have been arbitrarily defined herein for convenience of description. Alternate boundaries and sequences can be defined so long as the specified functions and relationships are appropriately performed. Any such alternate boundaries or sequences are thus within the scope and spirit of the claims. Further, the boundaries of these functional building blocks have been arbitrarily defined for convenience of description. Alternate boundaries could be defined as long as the certain significant functions are appropriately performed. Similarly, flow diagram blocks may also have been arbitrarily defined herein to illustrate certain significant functionality.
- To the extent used, the flow diagram block boundaries and sequence could have been defined otherwise and still perform the certain significant functionality. Such alternate definitions of both functional building blocks and flow diagram blocks and sequences are thus within the scope and spirit of the claims. One of average skill in the art will also recognize that the functional building blocks, and other illustrative blocks, modules and components herein, can be implemented as illustrated or by discrete components, application specific integrated circuits, processors executing appropriate software and the like or any combination thereof.
- In addition, a flow diagram may include a “start” and/or “continue” indication. The “start” and “continue” indications reflect that the steps presented can optionally be incorporated in or otherwise used in conjunction with other routines. In this context, “start” indicates the beginning of the first step presented and may be preceded by other activities not specifically shown. Further, the “continue” indication reflects that the steps presented may be performed multiple times and/or may be succeeded by other activities not specifically shown. Further, while a flow diagram indicates a particular ordering of steps, other orderings are likewise possible provided that the principles of causality are maintained.
- The one or more embodiments are used herein to illustrate one or more aspects, one or more features, one or more concepts, and/or one or more examples. A physical embodiment of an apparatus, an article of manufacture, a machine, and/or of a process may include one or more of the aspects, features, concepts, examples, etc. described with reference to one or more of the embodiments discussed herein. Further, from Figure to Figure, the embodiments may incorporate the same or similarly named functions, steps, modules, etc. that may use the same or different reference numbers and, as such, the functions, steps, modules, etc. may be the same or similar functions, steps, modules, etc. or different ones.
- Unless specifically stated to the contra, signals to, from, and/or between elements in a figure of any of the figures presented herein may be analog or digital, continuous time or discrete time, and single-ended or differential. For instance, if a signal path is shown as a single-ended path, it also represents a differential signal path. Similarly, if a signal path is shown as a differential path, it also represents a single-ended signal path. While one or more particular architectures are described herein, other architectures can likewise be implemented that use one or more data buses not expressly shown, direct connectivity between elements, and/or indirect coupling between other elements as recognized by one of average skill in the art.
- The term “module” is used in the description of one or more of the embodiments. A module implements one or more functions via a device such as a processor or other processing device or other hardware that may include or operate in association with a memory that stores operational instructions. A module may operate independently and/or in conjunction with software and/or firmware. As also used herein, a module may contain one or more sub-modules, each of which may be one or more modules.
- As may further be used herein, a computer readable memory includes one or more memory elements. A memory element may be a separate memory device, multiple memory devices, or a set of memory locations within a memory device. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. The memory device may be in a form a solid state memory, a hard drive memory, cloud memory, thumb drive, server memory, computing device memory, and/or other physical medium for storing digital information. A computer readable memory/storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
- While particular combinations of various functions and features of the one or more embodiments have been expressly described herein, other combinations of these features and functions are likewise possible. The present disclosure is not limited by the particular examples disclosed herein and expressly incorporates these other combinations.
Claims (20)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/353,939 US20170192898A1 (en) | 2015-12-30 | 2016-11-17 | Intelligent slice caching |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201562272848P | 2015-12-30 | 2015-12-30 | |
US15/353,939 US20170192898A1 (en) | 2015-12-30 | 2016-11-17 | Intelligent slice caching |
Publications (1)
Publication Number | Publication Date |
---|---|
US20170192898A1 true US20170192898A1 (en) | 2017-07-06 |
Family
ID=59226383
Family Applications (10)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/283,267 Abandoned US20170192688A1 (en) | 2015-12-30 | 2016-09-30 | Lazy deletion of vaults in packed slice storage (pss) and zone slice storage (zss) |
US15/336,410 Active 2038-02-07 US10387382B2 (en) | 2015-12-30 | 2016-10-27 | Estimating a number of entries in a dispersed hierarchical index |
US15/336,300 Abandoned US20170192698A1 (en) | 2015-12-30 | 2016-10-27 | Determining byte-hours usage of a vault or by users |
US15/347,873 Active 2037-05-01 US10318189B2 (en) | 2015-12-30 | 2016-11-10 | Determining respective mappings for logically defined dispersed storage units |
US15/350,677 Active 2037-08-12 US10216434B2 (en) | 2015-12-30 | 2016-11-14 | Detailed memory device statistics with drive write location determination |
US15/353,166 Active US10198199B2 (en) | 2015-12-30 | 2016-11-16 | Applying multiple hash functions to generate multiple masked keys in a secure slice implementation |
US15/352,950 Active US10241695B2 (en) | 2015-12-30 | 2016-11-16 | Optimizing rebuilds when using multiple information dispersal algorithms |
US15/352,710 Active US10241694B2 (en) | 2015-12-30 | 2016-11-16 | Reducing data stored when using multiple information dispersal algorithms |
US15/353,939 Abandoned US20170192898A1 (en) | 2015-12-30 | 2016-11-17 | Intelligent slice caching |
US16/193,064 Active US10613776B2 (en) | 2015-12-30 | 2018-11-16 | Appyling multiple hash functions to generate multiple masked keys in a secure slice implementation |
Family Applications Before (8)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US15/283,267 Abandoned US20170192688A1 (en) | 2015-12-30 | 2016-09-30 | Lazy deletion of vaults in packed slice storage (pss) and zone slice storage (zss) |
US15/336,410 Active 2038-02-07 US10387382B2 (en) | 2015-12-30 | 2016-10-27 | Estimating a number of entries in a dispersed hierarchical index |
US15/336,300 Abandoned US20170192698A1 (en) | 2015-12-30 | 2016-10-27 | Determining byte-hours usage of a vault or by users |
US15/347,873 Active 2037-05-01 US10318189B2 (en) | 2015-12-30 | 2016-11-10 | Determining respective mappings for logically defined dispersed storage units |
US15/350,677 Active 2037-08-12 US10216434B2 (en) | 2015-12-30 | 2016-11-14 | Detailed memory device statistics with drive write location determination |
US15/353,166 Active US10198199B2 (en) | 2015-12-30 | 2016-11-16 | Applying multiple hash functions to generate multiple masked keys in a secure slice implementation |
US15/352,950 Active US10241695B2 (en) | 2015-12-30 | 2016-11-16 | Optimizing rebuilds when using multiple information dispersal algorithms |
US15/352,710 Active US10241694B2 (en) | 2015-12-30 | 2016-11-16 | Reducing data stored when using multiple information dispersal algorithms |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US16/193,064 Active US10613776B2 (en) | 2015-12-30 | 2018-11-16 | Appyling multiple hash functions to generate multiple masked keys in a secure slice implementation |
Country Status (1)
Country | Link |
---|---|
US (10) | US20170192688A1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107592344A (en) * | 2017-08-28 | 2018-01-16 | 腾讯科技(深圳)有限公司 | Data transmission method, device, storage medium and computer equipment |
US20220261155A1 (en) * | 2015-11-30 | 2022-08-18 | Pure Storage, Inc. | Utilizing Memories of Different Operational Speeds in a Vast Storage Network |
Families Citing this family (45)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US11836369B1 (en) | 2015-02-27 | 2023-12-05 | Pure Storage, Inc. | Storing data in an expanded storage pool of a vast storage network |
US10528425B2 (en) * | 2015-02-27 | 2020-01-07 | Pure Storage, Inc. | Transitioning to an optimized data storage approach in a dispersed storage network |
US20170192688A1 (en) * | 2015-12-30 | 2017-07-06 | International Business Machines Corporation | Lazy deletion of vaults in packed slice storage (pss) and zone slice storage (zss) |
US10013309B2 (en) * | 2016-08-17 | 2018-07-03 | International Business Machines Corporation | Missing slice reconstruction in a dispersed storage network |
US10324855B2 (en) * | 2017-06-23 | 2019-06-18 | International Business Machines Corporation | Associating a processing thread and memory section to a memory device |
CN107465762B (en) * | 2017-09-14 | 2020-12-04 | 郑州云海信息技术有限公司 | Testing method and system for distributed storage system |
US10732852B1 (en) * | 2017-10-19 | 2020-08-04 | EMC IP Holding Company LLC | Telemetry service |
CN107948248A (en) * | 2017-11-01 | 2018-04-20 | 平安科技(深圳)有限公司 | Distributed storage method, control server and computer-readable recording medium |
US11756390B2 (en) | 2018-02-20 | 2023-09-12 | Arlo Technologies, Inc. | Notification priority sequencing for video security |
US11558626B2 (en) | 2018-02-20 | 2023-01-17 | Netgear, Inc. | Battery efficient wireless network connection and registration for a low-power device |
US11064208B2 (en) * | 2018-02-20 | 2021-07-13 | Arlo Technologies, Inc. | Transcoding in security camera applications |
US10552082B2 (en) * | 2018-04-03 | 2020-02-04 | International Business Machines Corporation | Optimized data replication in multi-tier storage environment |
US11412041B2 (en) | 2018-06-25 | 2022-08-09 | International Business Machines Corporation | Automatic intervention of global coordinator |
US10915380B2 (en) * | 2018-07-16 | 2021-02-09 | International Business Machines Corporation | Global coordination of in-progress operation risks for multiple distributed storage network memories |
CN108984758A (en) * | 2018-07-18 | 2018-12-11 | 江苏本能科技有限公司 | Car owner's association address analysis method and system based on point identification |
US10911307B2 (en) | 2019-01-29 | 2021-02-02 | Dell Products L.P. | System and method for out of the box solution-level configuration and diagnostic logging and reporting |
US11442642B2 (en) | 2019-01-29 | 2022-09-13 | Dell Products L.P. | Method and system for inline deduplication using erasure coding to minimize read and write operations |
US10979312B2 (en) | 2019-01-29 | 2021-04-13 | Dell Products L.P. | System and method to assign, monitor, and validate solution infrastructure deployment prerequisites in a customer data center |
US20200241781A1 (en) | 2019-01-29 | 2020-07-30 | Dell Products L.P. | Method and system for inline deduplication using erasure coding |
US10972343B2 (en) | 2019-01-29 | 2021-04-06 | Dell Products L.P. | System and method for device configuration update |
US10901641B2 (en) | 2019-01-29 | 2021-01-26 | Dell Products L.P. | Method and system for inline deduplication |
US20200242265A1 (en) * | 2019-01-30 | 2020-07-30 | EMC IP Holding Company LLC | Detecting abnormal data access patterns |
US20200272424A1 (en) * | 2019-02-21 | 2020-08-27 | Research & Business Foundation Sungkyunkwan University | Methods and apparatuses for cacheline conscious extendible hashing |
US11036705B2 (en) * | 2019-02-27 | 2021-06-15 | International Business Machines Corporation | Traversal of dispersed lockless concurrent index nodes |
US11513700B2 (en) * | 2019-03-04 | 2022-11-29 | International Business Machines Corporation | Split-n and composable splits in a dispersed lockless concurrent index |
CN110162659B (en) * | 2019-05-27 | 2020-09-15 | 湖南工程学院 | Fixed-rhythm new music generation method based on pitch network |
US10963345B2 (en) * | 2019-07-31 | 2021-03-30 | Dell Products L.P. | Method and system for a proactive health check and reconstruction of data |
US11372730B2 (en) | 2019-07-31 | 2022-06-28 | Dell Products L.P. | Method and system for offloading a continuous health-check and reconstruction of data in a non-accelerator pool |
US11328071B2 (en) | 2019-07-31 | 2022-05-10 | Dell Products L.P. | Method and system for identifying actor of a fraudulent action during legal hold and litigation |
US11609820B2 (en) | 2019-07-31 | 2023-03-21 | Dell Products L.P. | Method and system for redundant distribution and reconstruction of storage metadata |
US11775193B2 (en) | 2019-08-01 | 2023-10-03 | Dell Products L.P. | System and method for indirect data classification in a storage system operations |
US11334279B2 (en) | 2019-11-14 | 2022-05-17 | Western Digital Technologies, Inc. | Hierarchical blacklisting of storage system components |
US11314431B2 (en) * | 2019-11-14 | 2022-04-26 | Western Digital Technologies, Inc. | Distributed data blocks using storage path cost values |
US11368285B2 (en) | 2019-12-05 | 2022-06-21 | International Business Machines Corporation | Efficient threshold storage of data object |
US11983155B2 (en) * | 2020-01-14 | 2024-05-14 | International Business Machines Corporation | Namespace range creation to distribute workload in a dispersed storage system |
US11740825B2 (en) | 2020-01-14 | 2023-08-29 | International Business Machines Corporation | Object lifecycle management in a dispersed storage system |
US11416357B2 (en) | 2020-03-06 | 2022-08-16 | Dell Products L.P. | Method and system for managing a spare fault domain in a multi-fault domain data cluster |
US11301327B2 (en) | 2020-03-06 | 2022-04-12 | Dell Products L.P. | Method and system for managing a spare persistent storage device and a spare node in a multi-node data cluster |
US11175842B2 (en) | 2020-03-06 | 2021-11-16 | Dell Products L.P. | Method and system for performing data deduplication in a data pipeline |
US11119858B1 (en) | 2020-03-06 | 2021-09-14 | Dell Products L.P. | Method and system for performing a proactive copy operation for a spare persistent storage |
US11281535B2 (en) | 2020-03-06 | 2022-03-22 | Dell Products L.P. | Method and system for performing a checkpoint zone operation for a spare persistent storage |
US11204720B2 (en) | 2020-03-24 | 2021-12-21 | International Business Machines Corporation | Data retention in zone storage |
US11531663B2 (en) * | 2020-04-27 | 2022-12-20 | Microsoft Technology Licensing, Llc | Agent-based data pre-processing and data indexing for efficient data retrieval |
US11418326B2 (en) | 2020-05-21 | 2022-08-16 | Dell Products L.P. | Method and system for performing secure data transactions in a data cluster |
US11809714B2 (en) * | 2021-02-26 | 2023-11-07 | Micron Technology, Inc. | Effective storage allocation for sequentially-written memory devices |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8429346B1 (en) * | 2009-12-28 | 2013-04-23 | Emc Corporation | Automated data relocation among storage tiers based on storage load |
US20140164551A1 (en) * | 2007-10-09 | 2014-06-12 | Cleversafe, Inc. | Encoded data slice caching in a distributed storage network |
US9330009B1 (en) * | 2011-06-14 | 2016-05-03 | Emc Corporation | Managing data storage |
US20160283394A1 (en) * | 2015-03-27 | 2016-09-29 | Sudip Chahal | Caching and tiering for cloud storage |
Family Cites Families (130)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4092732A (en) | 1977-05-31 | 1978-05-30 | International Business Machines Corporation | System for recovering data stored in failed memory unit |
US5485474A (en) | 1988-02-25 | 1996-01-16 | The President And Fellows Of Harvard College | Scheme for information dispersal and reconstruction |
US5454101A (en) | 1992-09-15 | 1995-09-26 | Universal Firmware Industries, Ltd. | Data storage system with set lists which contain elements associated with parents for defining a logical hierarchy and general record pointers identifying specific data sets |
US5987622A (en) | 1993-12-10 | 1999-11-16 | Tm Patents, Lp | Parallel computer system including parallel storage subsystem including facility for correction of data in the event of failure of a storage device in parallel storage subsystem |
US6175571B1 (en) | 1994-07-22 | 2001-01-16 | Network Peripherals, Inc. | Distributed memory switching hub |
US5848230A (en) | 1995-05-25 | 1998-12-08 | Tandem Computers Incorporated | Continuously available computer memory systems |
US5774643A (en) | 1995-10-13 | 1998-06-30 | Digital Equipment Corporation | Enhanced raid write hole protection and recovery |
US5809285A (en) | 1995-12-21 | 1998-09-15 | Compaq Computer Corporation | Computer system having a virtual drive array controller |
US6012159A (en) | 1996-01-17 | 2000-01-04 | Kencast, Inc. | Method and system for error-free data transfer |
US5802364A (en) | 1996-04-15 | 1998-09-01 | Sun Microsystems, Inc. | Metadevice driver rename/exchange technique for a computer system incorporating a plurality of independent device drivers |
US5890156A (en) | 1996-05-02 | 1999-03-30 | Alcatel Usa, Inc. | Distributed redundant database |
US6058454A (en) | 1997-06-09 | 2000-05-02 | International Business Machines Corporation | Method and system for automatically configuring redundant arrays of disk memory devices |
US6088330A (en) | 1997-09-09 | 2000-07-11 | Bruck; Joshua | Reliable array of distributed computing nodes |
US5991414A (en) | 1997-09-12 | 1999-11-23 | International Business Machines Corporation | Method and apparatus for the secure distributed storage and retrieval of information |
US6272658B1 (en) | 1997-10-27 | 2001-08-07 | Kencast, Inc. | Method and system for reliable broadcasting of data files and streams |
JPH11161505A (en) | 1997-12-01 | 1999-06-18 | Matsushita Electric Ind Co Ltd | Media send-out device |
JPH11167443A (en) | 1997-12-02 | 1999-06-22 | Casio Comput Co Ltd | Interface device |
US6374336B1 (en) | 1997-12-24 | 2002-04-16 | Avid Technology, Inc. | Computer system and process for transferring multiple high bandwidth streams of data between multiple storage units and multiple applications in a scalable and reliable manner |
US6415373B1 (en) | 1997-12-24 | 2002-07-02 | Avid Technology, Inc. | Computer system and process for transferring multiple high bandwidth streams of data between multiple storage units and multiple applications in a scalable and reliable manner |
CA2341014A1 (en) | 1998-08-19 | 2000-03-02 | Alexander Roger Deas | A system and method for defining transforms of memory device addresses |
DE19847947A1 (en) * | 1998-10-09 | 2000-04-20 | Francotyp Postalia Gmbh | Data storage device for recording usage of mail franking machine has microprocessor providing automatic classification of usage data before entry in statistical memory |
US6356949B1 (en) | 1999-01-29 | 2002-03-12 | Intermec Ip Corp. | Automatic data collection device that receives data output instruction from data consumer |
US6609223B1 (en) | 1999-04-06 | 2003-08-19 | Kencast, Inc. | Method for packet-level fec encoding, in which on a source packet-by-source packet basis, the error correction contributions of a source packet to a plurality of wildcard packets are computed, and the source packet is transmitted thereafter |
US6571282B1 (en) | 1999-08-31 | 2003-05-27 | Accenture Llp | Block-based communication in a communication services patterns environment |
CN1280820C (en) * | 1999-11-16 | 2006-10-18 | 索尼株式会社 | Recording method and equipment reprdoucing method and equipment |
US6826711B2 (en) | 2000-02-18 | 2004-11-30 | Avamar Technologies, Inc. | System and method for data protection with multidimensional parity |
US6718361B1 (en) | 2000-04-07 | 2004-04-06 | Network Appliance Inc. | Method and apparatus for reliable and scalable distribution of data files in distributed networks |
ATE381191T1 (en) | 2000-10-26 | 2007-12-15 | Prismedia Networks Inc | METHOD AND SYSTEM FOR MANAGING DISTRIBUTED CONTENT AND CORRESPONDING METADATA |
US8176563B2 (en) | 2000-11-13 | 2012-05-08 | DigitalDoors, Inc. | Data security system and method with editor |
US7103915B2 (en) | 2000-11-13 | 2006-09-05 | Digital Doors, Inc. | Data security system and method |
US7140044B2 (en) | 2000-11-13 | 2006-11-21 | Digital Doors, Inc. | Data security system and method for separation of user communities |
US7146644B2 (en) | 2000-11-13 | 2006-12-05 | Digital Doors, Inc. | Data security system and method responsive to electronic attacks |
GB2369206B (en) | 2000-11-18 | 2004-11-03 | Ibm | Method for rebuilding meta-data in a data storage system and a data storage system |
US6785783B2 (en) | 2000-11-30 | 2004-08-31 | International Business Machines Corporation | NUMA system with redundant main memory architecture |
US7080101B1 (en) | 2000-12-01 | 2006-07-18 | Ncr Corp. | Method and apparatus for partitioning data for storage in a database |
US20020080888A1 (en) | 2000-12-22 | 2002-06-27 | Li Shu | Message splitting and spatially diversified message routing for increasing transmission assurance and data security over distributed networks |
US6857059B2 (en) | 2001-01-11 | 2005-02-15 | Yottayotta, Inc. | Storage virtualization system and methods |
US6775792B2 (en) | 2001-01-29 | 2004-08-10 | Snap Appliance, Inc. | Discrete mapping of parity blocks |
US20030037261A1 (en) | 2001-03-26 | 2003-02-20 | Ilumin Corporation | Secured content delivery system and method |
US6879596B1 (en) | 2001-04-11 | 2005-04-12 | Applied Micro Circuits Corporation | System and method for systolic array sorting of information segments |
US7024609B2 (en) | 2001-04-20 | 2006-04-04 | Kencast, Inc. | System for protecting the transmission of live data streams, and upon reception, for reconstructing the live data streams and recording them into files |
GB2377049A (en) | 2001-06-30 | 2002-12-31 | Hewlett Packard Co | Billing for utilisation of a data storage array |
US6944785B2 (en) | 2001-07-23 | 2005-09-13 | Network Appliance, Inc. | High-availability cluster virtual server system |
US7636724B2 (en) | 2001-08-31 | 2009-12-22 | Peerify Technologies LLC | Data storage system and method by shredding and deshredding |
US7024451B2 (en) | 2001-11-05 | 2006-04-04 | Hewlett-Packard Development Company, L.P. | System and method for maintaining consistent independent server-side state among collaborating servers |
US7003688B1 (en) | 2001-11-15 | 2006-02-21 | Xiotech Corporation | System and method for a reserved memory area shared by all redundant storage controllers |
US7171493B2 (en) | 2001-12-19 | 2007-01-30 | The Charles Stark Draper Laboratory | Camouflage of network traffic to resist attack |
US20040086117A1 (en) * | 2002-06-06 | 2004-05-06 | Petersen Mette Vesterager | Methods for improving unpredictability of output of pseudo-random number generators |
EP1547252A4 (en) | 2002-07-29 | 2011-04-20 | Robert Halford | Multi-dimensional data protection and mirroring method for micro level data |
US7051155B2 (en) | 2002-08-05 | 2006-05-23 | Sun Microsystems, Inc. | Method and system for striping data to accommodate integrity metadata |
ATE504446T1 (en) * | 2002-12-02 | 2011-04-15 | Silverbrook Res Pty Ltd | DEAD NOZZLE COMPENSATION |
US20040122917A1 (en) | 2002-12-18 | 2004-06-24 | Menon Jaishankar Moothedath | Distributed storage system for data-sharing among client computers running defferent operating system types |
JP2006526204A (en) | 2003-03-13 | 2006-11-16 | ディーアールエム テクノロジーズ、エルエルシー | Secure streaming container |
US7185144B2 (en) | 2003-11-24 | 2007-02-27 | Network Appliance, Inc. | Semi-static distribution technique |
US7895191B2 (en) * | 2003-04-09 | 2011-02-22 | International Business Machines Corporation | Improving performance of database queries |
GB0308262D0 (en) | 2003-04-10 | 2003-05-14 | Ibm | Recovery from failures within data processing systems |
GB0308264D0 (en) | 2003-04-10 | 2003-05-14 | Ibm | Recovery from failures within data processing systems |
US7415115B2 (en) | 2003-05-14 | 2008-08-19 | Broadcom Corporation | Method and system for disaster recovery of data from a storage device |
EP1668486A2 (en) | 2003-08-14 | 2006-06-14 | Compellent Technologies | Virtual disk drive system and method |
US7899059B2 (en) | 2003-11-12 | 2011-03-01 | Agere Systems Inc. | Media delivery using quality of service differentiation within a media stream |
US8332483B2 (en) | 2003-12-15 | 2012-12-11 | International Business Machines Corporation | Apparatus, system, and method for autonomic control of grid system resources |
US7206899B2 (en) | 2003-12-29 | 2007-04-17 | Intel Corporation | Method, system, and program for managing data transfer and construction |
US7222133B1 (en) | 2004-02-05 | 2007-05-22 | Unisys Corporation | Method for reducing database recovery time |
US8880502B2 (en) * | 2004-03-15 | 2014-11-04 | International Business Machines Corporation | Searching a range in a set of values in a network with distributed storage entities |
US7240236B2 (en) | 2004-03-23 | 2007-07-03 | Archivas, Inc. | Fixed content distributed data storage using permutation ring encoding |
US7231578B2 (en) | 2004-04-02 | 2007-06-12 | Hitachi Global Storage Technologies Netherlands B.V. | Techniques for detecting and correcting errors using multiple interleave erasure pointers |
JP4446839B2 (en) | 2004-08-30 | 2010-04-07 | 株式会社日立製作所 | Storage device and storage management device |
US7680771B2 (en) | 2004-12-20 | 2010-03-16 | International Business Machines Corporation | Apparatus, system, and method for database provisioning |
US7386758B2 (en) | 2005-01-13 | 2008-06-10 | Hitachi, Ltd. | Method and apparatus for reconstructing data in object-based storage arrays |
US7672930B2 (en) | 2005-04-05 | 2010-03-02 | Wal-Mart Stores, Inc. | System and methods for facilitating a linear grid database with data organization by dimension |
US20060242102A1 (en) * | 2005-04-21 | 2006-10-26 | Microsoft Corporation | Relaxation-based approach to automatic physical database tuning |
JP4912772B2 (en) * | 2005-09-22 | 2012-04-11 | 富士通株式会社 | Encryption method, encryption / decryption method, encryption device, encryption / decryption device, transmission / reception system, and communication system |
US7546427B2 (en) | 2005-09-30 | 2009-06-09 | Cleversafe, Inc. | System for rebuilding dispersed data |
US7574570B2 (en) | 2005-09-30 | 2009-08-11 | Cleversafe Inc | Billing system for information dispersal system |
US8171101B2 (en) | 2005-09-30 | 2012-05-01 | Cleversafe, Inc. | Smart access to a dispersed data storage network |
US8285878B2 (en) | 2007-10-09 | 2012-10-09 | Cleversafe, Inc. | Block based access to a dispersed data storage network |
US7904475B2 (en) | 2007-10-09 | 2011-03-08 | Cleversafe, Inc. | Virtualized data storage vaults on a dispersed data storage network |
US8352782B2 (en) * | 2005-09-30 | 2013-01-08 | Cleversafe, Inc. | Range based rebuilder for use with a dispersed data storage network |
US7574579B2 (en) | 2005-09-30 | 2009-08-11 | Cleversafe, Inc. | Metadata management system for an information dispersed storage system |
US7953937B2 (en) | 2005-09-30 | 2011-05-31 | Cleversafe, Inc. | Systems, methods, and apparatus for subdividing data for storage in a dispersed data storage grid |
DE102006006057B4 (en) * | 2006-02-09 | 2007-12-27 | Infineon Technologies Ag | Data encryption apparatus and method for encrypting data |
US20070214285A1 (en) | 2006-03-08 | 2007-09-13 | Omneon Video Networks | Gateway server |
DE102006014353B4 (en) * | 2006-03-28 | 2007-11-22 | Siemens Ag | Method for the reliable determination of data |
JP2008287519A (en) * | 2007-05-17 | 2008-11-27 | Keiko Ogawa | Data encryption, transmission and saving system and removable medium |
US7895242B2 (en) * | 2007-10-31 | 2011-02-22 | Microsoft Corporation | Compressed storage management |
US8423778B2 (en) * | 2007-11-21 | 2013-04-16 | University Of North Texas | Apparatus and method for transmitting secure and/or copyrighted digital video broadcasting data over internet protocol network |
WO2010041442A1 (en) * | 2008-10-10 | 2010-04-15 | パナソニック株式会社 | Information processing device, method, program, and integrated circuit |
US8447740B1 (en) * | 2008-11-14 | 2013-05-21 | Emc Corporation | Stream locality delta compression |
FR2941584B1 (en) * | 2009-01-27 | 2011-04-01 | St Nxp Wireless France | METHOD OF PROCESSING DATA STREAMS RECEIVED BY A WIRELESS COMMUNICATION APPARATUS AND REQUIRING AT LEAST PART OF CRYPTOGRAPHIC PROCESSING AND APPARATUS THEREOF |
US10395054B2 (en) * | 2011-06-06 | 2019-08-27 | Pure Storage, Inc. | Updating distributed storage network software |
US9208025B2 (en) * | 2009-07-30 | 2015-12-08 | Cleversafe, Inc. | Virtual memory mapping in a dispersed storage network |
US10108492B2 (en) * | 2009-07-30 | 2018-10-23 | International Business Machines Corporation | Rebuilding data stored in a dispersed storage network |
US8392479B1 (en) * | 2009-09-14 | 2013-03-05 | Symantec Corporation | Method and apparatus for optimizing storage space allocation for computer data |
US9270298B2 (en) * | 2009-11-24 | 2016-02-23 | International Business Machines Corporation | Selecting storage units to rebuild an encoded data slice |
US8918897B2 (en) * | 2009-11-24 | 2014-12-23 | Cleversafe, Inc. | Dispersed storage network data slice integrity verification |
US8990585B2 (en) * | 2009-12-29 | 2015-03-24 | Cleversafe, Inc. | Time based dispersed storage access |
US20110196900A1 (en) * | 2010-02-09 | 2011-08-11 | Alexandre Drobychev | Storage of Data In A Distributed Storage System |
US9606867B2 (en) * | 2014-06-05 | 2017-03-28 | International Business Machines Corporation | Maintaining data storage in accordance with an access metric |
US8566552B2 (en) * | 2010-03-12 | 2013-10-22 | Cleversafe, Inc. | Dispersed storage network resource allocation |
US8914669B2 (en) * | 2010-04-26 | 2014-12-16 | Cleversafe, Inc. | Secure rebuilding of an encoded data slice in a dispersed storage network |
US8874868B2 (en) * | 2010-05-19 | 2014-10-28 | Cleversafe, Inc. | Memory utilization balancing in a dispersed storage network |
US9571230B2 (en) * | 2010-10-06 | 2017-02-14 | International Business Machines Corporation | Adjusting routing of data within a network path |
US9116831B2 (en) * | 2010-10-06 | 2015-08-25 | Cleversafe, Inc. | Correcting an errant encoded data slice |
US9454431B2 (en) * | 2010-11-29 | 2016-09-27 | International Business Machines Corporation | Memory selection for slice storage in a dispersed storage network |
US9319463B2 (en) * | 2010-12-27 | 2016-04-19 | Cleversafe, Inc. | Reproducing data from obfuscated data retrieved from a dispersed storage network |
US8762479B2 (en) * | 2011-06-06 | 2014-06-24 | Cleversafe, Inc. | Distributing multi-media content to a plurality of potential accessing devices |
WO2012169102A1 (en) * | 2011-06-08 | 2012-12-13 | 日本電気株式会社 | Database performance prediction device and database prediction method |
US10365969B2 (en) * | 2011-11-01 | 2019-07-30 | International Business Machines Corporation | Multiple wireless communication systems stream slices based on geography |
US8880511B2 (en) * | 2011-11-25 | 2014-11-04 | Tibco Software Inc. | Database query optimization and cost estimation |
US8848906B2 (en) * | 2011-11-28 | 2014-09-30 | Cleversafe, Inc. | Encrypting data for storage in a dispersed storage network |
US8898542B2 (en) * | 2011-12-12 | 2014-11-25 | Cleversafe, Inc. | Executing partial tasks in a distributed storage and task network |
US9146810B2 (en) * | 2012-01-31 | 2015-09-29 | Cleversafe, Inc. | Identifying a potentially compromised encoded data slice |
US8935256B2 (en) * | 2012-03-02 | 2015-01-13 | Cleversafe, Inc. | Expanding a hierarchical dispersed storage index |
WO2013147868A1 (en) * | 2012-03-30 | 2013-10-03 | Intel Corporation | Hardware profiling mechanism to enable page level automatic binary translation |
US9503513B2 (en) * | 2012-10-08 | 2016-11-22 | International Business Machines Corporation | Robust transmission of data utilizing encoded data slices |
US9311179B2 (en) * | 2012-10-30 | 2016-04-12 | Cleversafe, Inc. | Threshold decoding of data based on trust levels |
US10075523B2 (en) * | 2013-04-01 | 2018-09-11 | International Business Machines Corporation | Efficient storage of data in a dispersed storage network |
US20140298061A1 (en) * | 2013-04-01 | 2014-10-02 | Cleversafe, Inc. | Power control in a dispersed storage network |
US9424132B2 (en) * | 2013-05-30 | 2016-08-23 | International Business Machines Corporation | Adjusting dispersed storage network traffic due to rebuilding |
US9501360B2 (en) * | 2013-07-01 | 2016-11-22 | International Business Machines Corporation | Rebuilding data while reading data in a dispersed storage network |
US10686880B2 (en) * | 2013-08-29 | 2020-06-16 | Pure Storage, Inc. | Dispersed storage based on range availability and methods for use therewith |
US9552261B2 (en) * | 2014-01-31 | 2017-01-24 | International Business Machines Corporation | Recovering data from microslices in a dispersed storage network |
AU2015227201B2 (en) * | 2014-03-04 | 2020-07-09 | Mobophiles, Inc., Dba Mobolize | Dynamic cache allocation and network management |
US9542239B2 (en) * | 2014-04-30 | 2017-01-10 | International Business Machines Corporation | Resolving write request conflicts in a dispersed storage network |
US10740180B2 (en) * | 2015-01-30 | 2020-08-11 | Pure Storage, Inc. | Storing and retrieving data using proxies |
US9774443B2 (en) * | 2015-03-04 | 2017-09-26 | Apple Inc. | Computing key-schedules of the AES for use in white boxes |
US9971544B1 (en) * | 2015-09-16 | 2018-05-15 | Amazon Technologies, Inc. | Techniques for usage metering and control in data storage systems |
US10423362B2 (en) * | 2015-11-30 | 2019-09-24 | International Business Machines Corporation | Utilizing multiple dispersal algorithms to encode data for storage in a dispersed storage network |
US20170192688A1 (en) * | 2015-12-30 | 2017-07-06 | International Business Machines Corporation | Lazy deletion of vaults in packed slice storage (pss) and zone slice storage (zss) |
US20170222886A1 (en) * | 2016-01-28 | 2017-08-03 | Hewlett Packard Enterprise Development Lp | Metering storage usage |
-
2016
- 2016-09-30 US US15/283,267 patent/US20170192688A1/en not_active Abandoned
- 2016-10-27 US US15/336,410 patent/US10387382B2/en active Active
- 2016-10-27 US US15/336,300 patent/US20170192698A1/en not_active Abandoned
- 2016-11-10 US US15/347,873 patent/US10318189B2/en active Active
- 2016-11-14 US US15/350,677 patent/US10216434B2/en active Active
- 2016-11-16 US US15/353,166 patent/US10198199B2/en active Active
- 2016-11-16 US US15/352,950 patent/US10241695B2/en active Active
- 2016-11-16 US US15/352,710 patent/US10241694B2/en active Active
- 2016-11-17 US US15/353,939 patent/US20170192898A1/en not_active Abandoned
-
2018
- 2018-11-16 US US16/193,064 patent/US10613776B2/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20140164551A1 (en) * | 2007-10-09 | 2014-06-12 | Cleversafe, Inc. | Encoded data slice caching in a distributed storage network |
US8429346B1 (en) * | 2009-12-28 | 2013-04-23 | Emc Corporation | Automated data relocation among storage tiers based on storage load |
US9330009B1 (en) * | 2011-06-14 | 2016-05-03 | Emc Corporation | Managing data storage |
US20160283394A1 (en) * | 2015-03-27 | 2016-09-29 | Sudip Chahal | Caching and tiering for cloud storage |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20220261155A1 (en) * | 2015-11-30 | 2022-08-18 | Pure Storage, Inc. | Utilizing Memories of Different Operational Speeds in a Vast Storage Network |
CN107592344A (en) * | 2017-08-28 | 2018-01-16 | 腾讯科技(深圳)有限公司 | Data transmission method, device, storage medium and computer equipment |
Also Published As
Publication number | Publication date |
---|---|
US20170193023A1 (en) | 2017-07-06 |
US10318189B2 (en) | 2019-06-11 |
US20170192688A1 (en) | 2017-07-06 |
US10387382B2 (en) | 2019-08-20 |
US10241694B2 (en) | 2019-03-26 |
US20170192698A1 (en) | 2017-07-06 |
US20170195420A1 (en) | 2017-07-06 |
US20170192700A1 (en) | 2017-07-06 |
US10613776B2 (en) | 2020-04-07 |
US10241695B2 (en) | 2019-03-26 |
US20170192907A1 (en) | 2017-07-06 |
US20170192699A1 (en) | 2017-07-06 |
US10198199B2 (en) | 2019-02-05 |
US20170192692A1 (en) | 2017-07-06 |
US10216434B2 (en) | 2019-02-26 |
US20190087109A1 (en) | 2019-03-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20170192898A1 (en) | Intelligent slice caching | |
US10255003B2 (en) | Making consistent reads more efficient in IDA+copy system | |
US10977123B2 (en) | Coordination protocol between dispersed storage processing units and rebuild modules | |
US10001950B2 (en) | Maintaining storage thresholds in a distributed storage network | |
US10061648B2 (en) | Efficient method for redundant storage of a set of encoded data slices | |
US10042706B2 (en) | Optimizing secondary storage in a dispersed storage network | |
US10120596B2 (en) | Adaptive extra write issuance within a dispersed storage network (DSN) | |
US10324657B2 (en) | Accounting for data whose rebuilding is deferred | |
US10298684B2 (en) | Adaptive replication of dispersed data to improve data access performance | |
US10929068B2 (en) | Pre-caching data according to a current or predicted requester location | |
US20220394091A1 (en) | Storing a Data Object as Data Regions in a Storage Network | |
US10146645B2 (en) | Multiple memory format storage in a storage network | |
US11550515B1 (en) | Determining a storage location according to data retention policies | |
US10423491B2 (en) | Preventing multiple round trips when writing to target widths | |
US10402270B2 (en) | Deterministically determining affinity for a source name range | |
US20220261155A1 (en) | Utilizing Memories of Different Operational Speeds in a Vast Storage Network | |
US10664360B2 (en) | Identifying additional resources to accelerate rebuildling |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WOZNIAK, ETHAN S.;REEL/FRAME:040354/0756 Effective date: 20161110 |
|
STCV | Information on status: appeal procedure |
Free format text: NOTICE OF APPEAL FILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: AMENDMENT AFTER NOTICE OF APPEAL |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
AS | Assignment |
Owner name: PURE STORAGE, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTERNATIONAL BUSINESS MACHINES CORPORATION;REEL/FRAME:050451/0549 Effective date: 20190906 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |