US20060294300A1 - Atomic cache transactions in a distributed storage system - Google Patents
Atomic cache transactions in a distributed storage system Download PDFInfo
- Publication number
- US20060294300A1 US20060294300A1 US11/159,019 US15901905A US2006294300A1 US 20060294300 A1 US20060294300 A1 US 20060294300A1 US 15901905 A US15901905 A US 15901905A US 2006294300 A1 US2006294300 A1 US 2006294300A1
- Authority
- US
- United States
- Prior art keywords
- data
- stripe
- transaction
- defining
- cache
- 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
-
- 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/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/561—Adding application-functional data or data for application control, e.g. adding metadata
-
- 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
- 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
-
- 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/0656—Data buffering 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
- 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]
-
- 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/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/564—Enhancement of application control based on intercepted application data
-
- 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/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/565—Conversion or adaptation of application format or content
- H04L67/5651—Reducing the amount or size of exchanged application data
-
- 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/16—Error detection or correction of the data by redundancy in hardware
- G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
- G06F11/2053—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant
- G06F11/2089—Redundant storage control functionality
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2211/00—Indexing scheme relating to details of data-processing equipment not covered by groups G06F3/00 - G06F13/00
- G06F2211/10—Indexing scheme relating to G06F11/10
- G06F2211/1002—Indexing scheme relating to G06F11/1076
- G06F2211/1009—Cache, i.e. caches used in RAID system with parity
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2211/00—Indexing scheme relating to details of data-processing equipment not covered by groups G06F3/00 - G06F13/00
- G06F2211/10—Indexing scheme relating to G06F11/10
- G06F2211/1002—Indexing scheme relating to G06F11/1076
- G06F2211/104—Metadata, i.e. metadata associated with RAID systems with parity
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Human Computer Interaction (AREA)
- Quality & Reliability (AREA)
- Library & Information Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Memory System Of A Hierarchy Structure (AREA)
Abstract
An atomic write data structure is provided comprising a stripe buffer list descriptor defining state information of a stripe buffer list entry associating a virtual stripe of data storage space with cache data. An associated method is provided comprising constructing metadata associating a virtual stripe of data storage space with cache data; modifying the metadata to reflect state changes related to a pending data transaction between the data storage space and the cache; writing the modified metadata to an atomic write descriptor; and recalling the atomic write descriptor for transacting a selected atomic block size in an event of an interruption while executing the data transaction.
Description
- The claimed invention relates generally to the field of data storage and more particularly, but not by way of limitation, to an apparatus and method for atomic data transactions with a nonvolatile cache memory.
- Computer networking began proliferating when the data transfer rates of industry standard architectures could not keep pace with the data access rate of the 80386 processor made by Intel Corporation. Local area networks (LANs) evolved to storage area networks (SANs) by consolidating the data storage capacity in the network. Users have realized significant benefits by the consolidation of equipment and the associated data handled by the equipment in SANs, such as the capability of handling an order of magnitude more storage than would otherwise be possible with direct attached storage, and doing so at manageable costs.
- More recently the movement has been toward a network-centric approach to controlling the data storage subsystems. That is, in the same way that the storage was consolidated, so too are the systems that control the functionality of the storage being offloaded from the servers and into the network itself. Host-based software, for example, can delegate maintenance and management tasks to intelligent switches or to a specialized network storage services platform. Appliance-based solutions eliminate the need for the software running in the hosts, and operate within computers placed as a node in the enterprise. Intelligent data storage subsystems self-deterministically allocate, manage, and protect its respective data storage capacity and present that capacity as a virtual storage space to the network to accommodate global storage requirements. This virtual storage space is able to be provisioned into multiple storage volumes. A distributed computing environment uses these intelligent storage devices for global provisioning as well as for global sparing in the event of failures. In any event, the intelligent network solutions can centralize such things as storage allocation routines, backup routines, and fault tolerance schemes independently of the hosts.
- As file transactions are executed in such a network-centric system, storage controllers must direct the data to/from the appropriate locations on the physical storage media. This leads to complex caching and mapping constructs to make certain the right data is communicated to the right place. The structure of metadata can significantly impact storage system performance and reliability, particularly across different components in the storage system. One existing implementation employs a scatter-gather list. However, what is needed is more sophisticated mapping schemes associating the logical storage volume to the physical striped blocks of data stored in the data storage medium, and atomic write metadata utilizing the benefits of such improved mapping schemes. It is to this solution that embodiments of the present invention are directed.
- Embodiments of the present invention are generally directed to an atomic write descriptor associated with stripe buffer list metadata.
- In some embodiments an atomic write data structure is provided comprising a stripe buffer list descriptor defining state information of a stripe buffer list entry associating a virtual stripe of data storage space with cache data.
- In some embodiments a method is provided comprising constructing metadata associating a virtual stripe of data storage space with cache data; modifying the metadata to reflect state changes related to a pending data transaction between a host or media update request and the cache; writing the modified metadata to an atomic write descriptor; and recalling the atomic write descriptor for transacting a selected atomic block size in an event of an interruption while executing the data transaction.
- In some embodiments a distributed storage system is provided comprising a bulk data storage space in communication with a cache, and means for atomically transacting data between the storage space and the cache.
- These and various other features and advantages which characterize the claimed invention will become apparent upon reading the following detailed description and upon reviewing the associated drawings.
-
FIG. 1 is a diagrammatic representation of a computer system in which embodiments of the present invention are useful. -
FIG. 2 is a simplified diagrammatic representation of the computer system ofFIG. 1 . -
FIG. 3 is an exploded isometric view of an intelligent data storage subsystem constructed in accordance with embodiments of the present invention. -
FIG. 4 is a functional block diagram of the intelligent data storage subsystem ofFIG. 3 . -
FIG. 5 is a functional block diagram of the intelligent storage processor circuit board of the intelligent data storage subsystem ofFIG. 3 . -
FIG. 6 is a functional block diagram of the intelligent storage processor of the intelligent data storage subsystem ofFIG. 3 . -
FIG. 7 is a diagrammatic representation of a stripe buffer list table relating virtual stripes of storage space to cache data in accordance with embodiments of the present invention. -
FIG. 8 is a diagrammatic representation of metadata structures associated with the stripe buffer list ofFIG. 7 . -
FIG. 9 is a more detailed diagrammatic representation of metadata structures associated with the stripe buffer list in accordance with embodiments of the present invention. -
FIG. 10 is a flowchart of steps for practicing a method of general atomic writing of transactions between the host or media update request and the cache in accordance with embodiments of the present invention. -
FIG. 11 is a diagrammatic representation of an atomic write descriptor metadata structure constructed in accordance with embodiments of the present invention. -
FIGS. 12A-12C is a flowchart of steps for atomically updating pending transactions characterized by a miss sequence, a previously dirty sequence, or a RAID parity update sequence with the atomic write descriptor in accordance with embodiments of the present invention. -
FIG. 1 is an illustrative computer system 100 in which embodiments of the present invention are useful. One ormore hosts 102 are networked to one or more network-attachedservers 104 via a local area network (LAN) and/or wide area network (WAN) 106. Preferably, the LAN/WAN 106 uses Internet protocol (IP) networking infrastructure for communicating over the World Wide Web. Thehosts 102 access applications resident in theservers 104 that routinely need data stored on one or more of a number of intelligentdata storage subsystems 108. Accordingly, SANs 110 connect theservers 104 to the intelligentdata storage subsystems 108 for access to the stored data. Theintelligent data subsystems 108 provide blocks ofdata storage capacity 109 for storing the data over various selected communication protocols such as serial ATA and fibre-channel, with enterprise or desktop class storage medium within it. -
FIG. 2 is a simplified diagrammatic view of the computer system 100 ofFIG. 1 . Thehosts 102 interact with each other as well as with a pair of the intelligent storage subsystems 108 (denoted A and B, respectively) via the network orfabric 110. Each intelligentdata storage subsystem 108 includes dual redundant controllers 112 (denoted A1, A2 and B1, B2) preferably operating on thedata storage capacity 109 as a set of data storage devices characterized as a redundant array of independent drives (RAID). Thecontrollers 112 anddata storage capacity 109 preferably utilize a fault tolerant arrangement so that thevarious controllers 112 utilize parallel, redundant links and at least some of the user data stored by the system 100 is stored in redundant format within at least one set of thedata storage capacities 109. - It is further contemplated that the
A host computer 102 and the A intelligentdata storage subsystem 108 can be physically located at a first site, theB host computer 102 and B intelligentdata storage subsystem 108 can be physically located at a second site, and theC host computer 102 can be yet at a third site, although such is merely illustrative and not limiting. All entities on the distributed computer system are connected over some type of computer network. -
FIG. 3 illustrates an intelligentdata storage subsystem 108 constructed in accordance with embodiments of the present invention. Ashelf 114 defines cavities for receivingly engaging thecontrollers 112 in electrical connection with a midplane 116. The shelf is supported, in turn, within a cabinet (not shown). A pair of multiple disc assemblies (MDAs) 118 are receivingly engageable with theshelf 114 on the same side of the midplane 116. Connected to the opposing side of the midplane 116 aredual batteries 122 providing an emergency power supply, dual alternatingcurrent power supplies 124, anddual interface modules 126. Preferably, the dual components are configured for operating either of theMDAs 118 or both simultaneously, thereby providing backup protection in the event of a component failure. -
FIG. 4 is a diagrammatic view of an intelligentdata storage subsystem 108 constructed in accordance with embodiments of the present invention. Thecontrollers 112 operate in conjunction with redundant intelligent storage processors (ISP) 130 to provide managed reliability of the data integrity. Theintelligent storage processors 130 can be resident in thecontroller 112, in the MDA 118, or elsewhere within the intelligentdata storage subsystem 108. Aspects of the managed reliability include invoking reliable data storage formats such as RAID strategies. Managed reliability can also include scheduling of diagnostic and correction routines based on a monitored usage of the system. Data recovery operations are executed for copying and reconstructing data. These and other aspects of the managed reliability aspects contemplated herein are disclosed in patent application 10/817,617 entitled Managed Reliability Storage System and Method which is assigned to the present assignee and incorporated herein by reference. Other aspects of the managed reliability include responsiveness to predictive failure indications in relation to predetermined rules, as disclosed for example in patent application 11/040,410 entitled Deterministic Preventive Recovery From a Predicted Failure in a Distributed Storage System which is assigned to the present assignee and incorporated herein by reference. -
FIG. 5 is a diagrammatic illustration of an intelligent storageprocessor circuit board 132 in which resides the pair of redundantintelligent storage processors 130. Theintelligent storage processor 130 interfaces thedata storage capacity 109 to theSAN fabric 110. Eachintelligent storage processor 130 can manage assorted storage services such as routing, volume management, and data migration and replication. Theintelligent storage processors 130 divide theboard 132 into twoISP subsystems bus 138. TheISP subsystem 134 includes theISP 130 denoted “B” which is connected to thefabric 110 and thestorage capacity 109 bylinks ISP subsystem 134 also includes apolicy processor 144 executing a real-time operating system. TheISP 130 andpolicy processor 144 communicate overbus 146, and both communicate withmemory 148. -
FIG. 6 is a diagrammatic view of anillustrative ISP subsystem 134 constructed in accordance with embodiments of the present invention. TheISP 130 includes a number of function controller cores (FCC) (150-160) in communication withlist managers list manager ISP 130 action. Likewise, responses from alist manager CPS 166. The arrangement ofFIG. 6 and associated discussion are illustrative and not limiting of the contemplated embodiments of the present invention. - The
policy processor 144 can be programmed to execute desired operations via theISP 130. For example, thepolicy processor 144 can communicate with thelist managers CPS 166. Responses to thepolicy processor 144 can serve as interrupts signaling the reading ofmemory 148 registers. - The
policy processor 144 can be programmed by a storage controller vendor to provide value-added functionality, such as but not limited to the managed reliability and recovery schemes discussed above. That is, thepolicy processor 144 can execute custom logic to perform sophisticated operations via theISP 130. Thepolicy processor 144 can send messages to any list manager and receive responses back from any list manager, all via theCPS 166. A message response issued by theISP 130 can result, for example, in a PCI write to thepolicy processor 144. In this manner, thepolicy processor 144 can also accessmemory 148 and trigger actions within theISP 144 usingCPS 166 messages and the list managers. - Accordingly, a storage controller vendor can create custom storage service applications for execution on the
policy processor 144. The storage service applications can access the functionality of theISP 130, such as throughISP 130 register access and DMA over a PCI bus, and such as by opening and accessing memory windows via individual PCI read or write operations with the attendant overhead. Some implementations may also support a faster access than individual PCI access. In some embodiments, for example, thepolicy processor 144 can be implemented with a PowerPC processor that accesses theISP 130 functionality through cache writes across the PCI bus, although other processors and access methods may be employed. - In some embodiments the
ISP 130 is coupled through a host fibre channel interface to a host (e.g., an application server), and through one or more storage device FC interfaces to thedata storage capacity 109. TheISP 302 communicates storage transactions (e.g. SCSI exchanges) between the host and thestorage capacity 109. It should be understood that other network connectivity may also exist between the host and thestorage capacity 109. - For example, a data storage transaction (e.g. a SCSI write request) can be received over the host fibre channel interface. The host fibre channel interface processes the pending transaction from the request frame. The request data includes a fibre channel Origin eXchange IDentifier (OXID), which identifies a given fibre channel exchange. An exchange represents a sequence of one or more non-concurrent related requests and responses passing between a pair of fibre channel ports, encapsulating a conversation, such as a SCSI task. Exchanges may be bidirectional and may be short or long lived. The OXID is extracted from the request frame and used to process the request data.
- A counterpart to the OXID is the Responder eXchange IDentifier (RXID), which identifies the context to be used when responding to the request. For example, a data frame from one of the storage devices through the storage device interface is processed by the
ISP 130. The RXID is extracted from the data frame and used to locate the context needed to route the response data. - Collectively, OXIDs and RXIDs are referred to as exchange identifiers, although other exchange identifiers may also be employed. In some embodiments, the exchange identifier is used to locate a context for a given transaction. The context provides continuity among individual frames in a single transaction. For example, when a transaction is initiated for a SCSI write command, a context is established for the transaction. In addition, the receiving controller allocates or locates metadata, described below, for the associated stripe and populates the appropriate portion of the metadata using available data buffers from buffer memory. For subsequent stages in the transaction, the storage system can retrieve the context from memory using the exchange identifier and continue processing the exchange using the context data. When the exchange is complete, the metadata structures and data buffers for the transaction may be maintained for some time to act as a write-back cache-as long as the cached data remains valid, the
ISP 130 can service a read request from its cache, rather than retrieving the data from physical storage. The validity of cached data is managed using known caching techniques. - Data striping allocates portions of multiple data storage discs within the
storage capacity 109, so that multiple stripes can be accessed simultaneously. For example, rather than reading a large file from a single disc, it is much faster to chop the file up into pieces, store each of the pieces in different stripes on different discs, and then use all the discs to read back the file in parallel. For example,FIG. 5 shows theISP 130 coupled tostriped discs ISP 130 has written contiguous data instripes 180 across three discs, 170, 172, and 174. Specifically, thefirst stripe 180 ondisk 170 is completely written, thefirst stripe 180 ondisk 172 is completely written, and thefirst stripe 180 ondisk 174 is partially written. When the data is read from the disk array 178, the data can be read from thediscs - The
data stripe 180 is the basic building block used to virtualize a range of blocks representative of a given set of virtual block addresses (VBAs) or parity for some collection of data stripes. The VBAs are mapped to logical block addresses (LBAs), which specify stripe locations on the physical storage media. Storage requests and responses are communicated relative to VBAs, and a media-side component of theISP 130 maps the VBAs to and from LBAs during physical media access. A VBA can also include an offset into a given stripe, so as to allow for partial population of the stripe. - The underlying metadata structure is a stripe buffer list (SBL). The
ISPs 130 store the SBLs, such as inmemory 168, and implement the SBL configuration for describing data in the storage system cache that is associated with a particular data stripe. In some embodiments the SBLs are allocated to distinct pools (e.g. a primary pool and a secondary pool) to support mirroring. The various stripe buffer lists are structured as an array, so a context structure can specify an index (SBL index) of the appropriate SBL. Accordingly, each SBL references a plurality of data buffers in which data read from or destined to a particular stripe is cached. Furthermore, each SBL is aligned with a virtual disk stripe, such that the starting VBA of the SBL is evenly divisible by the disk stripe size and the maximum amount of buffer space referenced by the SBL corresponds to the disk stripe size. In some embodiments, each data buffer is sized to 2112 bytes and is capable of holding 4 sectors of file data, although other sizes are also contemplated. - The context structure can also specify a mirror flag that indicates to which pool of data buffers and metadata the data transaction is designated. For example, if the mirror flag indicates ‘0,’ then the
ISP 130 caches the data using an SBL from its primary pool having the SBL index given by the context. If the mirror flag indicates ‘1,’ then an SBL from its secondary pool is used. As such, the SBL index, and the mirror flag are used to access the appropriate SBL and other associated metadata. - The context structure can also specify the starting sector offset within the disk stripe associated with the data transaction. The offset, therefore, also specifies an offset into the SBL. In this manner, the
ISP 130 is able to determine where in the SBL to begin processing (e.g., writing data to certain data buffers referenced by the SBL or reading data from certain data buffers referenced by the SBL). - Other metadata structures, discussed in more detail below, include a stripe buffer list descriptor (SBLD), a stripe buffer list present bits (SPB), and a stripe buffer list dirty bits (SDB), govern how the data buffers are associated with the storage media and how the data buffers are handled by the caching mechanisms. An SBLD table includes entries that associate individual SBLs with ranges of VBAs (i.e., with a virtual disk stripe) on a given logical unit. A given SBLD table entry is referenced by the same SBL index used to identify the appropriate SBL for a given data transaction. In some embodiments there are two SBLD tables stored in memory, one for each pool.
- An exemplary format for an eight-byte SBLD table entry is shown below: Byte Location Description Address Bit Locations
TABLE 1 SBLD table entry format Byte Location Description Address Bit Locations 0 VBA High (stripe-aligned) [31:16] 2 VBA Low (stripe-aligned) [15:0] 4 Logical Unit ID 6 State - The state field in the exemplary SBLD table entry is defined as:
TABLE 2 State field format for SBLD table entry Bit Locations Descriptions [Polarity] 0x4000 DIF Invalid for Some Blocks [1] 0x3000 Data Column for Parity 0x0800 Parity Data [1] 0x0400 Flush Before Copy [1] 0x0200 In Use [1] 0x01FF Dirty Block Count - For each SBL entry, there is also a corresponding entry in an associated SPB table, which is indexable by the SBL index. Each SPB table entry consists of a selected number of bits for indicating whether the sector data for a corresponding 10 VBA is valid or about to be valid. For the present example, the particular bit in a given field can be referenced using a right shift of the value 0x8000 based on the
lower order 4 bits of the VBA for the given sector. A bit mask for a range with a given starting VBA and a length L within a given field is computed as:
MASK=(0xFFFF<<(16-L))>>(VBA & 15) - The particular field for a given VBA is computed as:
INDEX=(VBA>>4) & 15 - For each SBL entry, there is also a corresponding entry in an associated SDB table, which is likewise indexable by the SBL index. Each SDB table entry consists of a selected number of bits for indicating whether the sector data for a corresponding VBA is dirty (i.e. write back cached) and, therefore, likely needs to be flushed out of the cache in the buffer memory. For the present example, the particular bit in a given field is referenced using a right shift of the value 0x8000 based on the
lower order 4 bits of the VBA for the given sector. A bit mask for a range with a given starting VBA and a length L within a given field is computed as:
MASK=(0xFFFF<<(16-L))>>(VBA & 15) - The particular field for a given VBA is computed as:
INDEX=(VBA>>4) & 15 - The context data is communicated from the
ISP 130 through theCPS 166 to an address generator, which computes the appropriate address for the appropriate SBL, based on the SBL index and pool. In some embodiments, the context is communicated to the address generated in a message packet that includes, without limitation, the SBL index, an SBL offset (which identifies the offset into the SBL from which the first valid buffer index is read), a sector offset (which indicates the starting sector within the first valid data buffer), and a sector count (which represents the number of sectors to be transferred from theISP 130 to the buffer memory). For example, with 32 sectors per data buffer, the SBL offset corresponds to VBA[10:5] and the starting sector index corresponds to VBA[4:0]. With 4 sectors per data buffer, the SBL offset corresponds to VBA[7:2] and the starting sector index corresponds to VBA[1:0]. - Responsive to receipt of the context, the address generator decodes the message packet and accesses the identified SBL, according to the SBL offset, to obtain the specified data buffer index. Then, using the data buffer index and the sector offset, the address generator then computes a data buffer memory address. The sector offset and the number of sectors in a buffer are used to determine the remaining number of sectors in the data buffer. The transfer size associated with the data buffer memory address is the lesser of the remaining data buffer space and the total transfer size (stored in the message packet). The data buffer address and the transfer size are written to an address, such as FIFO, of a data buffer manager.
-
FIG. 7 illustrates an exemplary SBL table 190 having a plurality ofSBL 191 entries constructed in accordance with embodiments of the present invention. The SBL table 190 stores anSBL structure buffer memory 168. - As described above, each
SBL structure SBL 191 to use and where to start within theSBL 191. The data needed to construct the message is located using the exchange ID extracted from the frame header. The data in the frame is moved to memory. In a similar fashion, when the storage controller transmits data (whether to a host or to a storage device), the transmitting controller extracts the context from the request data provided by thepolicy processor 144. -
FIG. 8 illustrates an exemplary alignment of metadata structures discussed above with virtual disk stripes. In the embodiments ofFIG. 8 four striped storage discs are managed in accordance with the metadata structures. The SBL table 190 includes the plurality ofSBLs 191, any of which may be valid or invalid at any given time. EachSBL 191 is aligned with a given virtual stripe on a storage medium and includes one or more buffer indices referencing data buffers in the buffer memory. An SBLD table 198 includes an entry for eachSBL 191 and specifies the VBA range and other characteristics associated with eachSBL 191, as further discussed below. The maximum amount of data addressed by each SBL's 191 respective data buffer corresponds to the virtual disk stripe size. - An SPB table 200 and an SDB table 202 allow for cache management of the data buffers. The SPB table 200 includes a bit for each sector of each
SBL 191 to indicate whether the cached data for a given sector is or is about to be valid (i.e., has current data for the corresponding sector). It also indicates that the buffer index is valid. In a subsequent transaction requesting a read operation to the same sector, if the SPB table 200 indicates that the data is valid, then the request can be serviced from the buffer memory instead of requiring a round trip to the storage medium. The SDB table 202 includes a bit for each sector of theSBL 191 to indicate whether the cached data for a given sector is dirty (i.e., needs to be written from the data buffer). For example, if the storage controller loses power in the middle of an exchange, the SDB table 202 can be used to indicate that the data in the cache needs to be flushed to the appropriate target. Therefore, when the storage controller reboots, data integrity is maintained in the presence of a catastrophic event. - The SPB table 200 and SDB table 202 combined represent the logic shown below. The “present and dirty, but CRC invalid” state represents a condition where the data in the data buffers contain modified data (e.g. the CRCs do not match what is expected). In such a case, the CRC needs to be recomputed and updated.
TABLE 3 Present Bits and Dirty Bits Logic Present Dirty Description 0 0 Unused 0 1 Valid and dirty, but CRC invalid 1 0 Valid but not dirty 1 1 Valid and dirty -
FIG. 9 is a more detailed diagrammatical representation ofSBLD structure 210 entries in the SBLD table 198 in accordance with illustrative embodiments of the present invention. TheSBLD structure 210 contains the range within the virtual memory corresponding to the respective drive stripe, in terms of the endingVBA address 212 and the startingVBA address 214. TheSBLD structure 210 also contains a logical device unit identification (LUID) 216, as well asstate information 218. - The
state information 218 contains a data integrity field (DIF) 220 that can be appended to the end of the user data for each sector as the data is being read from a host (e.g. SCSI target write). An invalid DIF is the exception to the general rule that the associated metadata is in a normal write back state, and forms part of a valid crash recovery record. Thestate information 218 can further containparity placement 222 andpresence 224 data, a flush beforecopy flag 226, an inuse flag 228, and adirty block count 230. -
FIG. 10 is a simplified flowchart of steps in amethod 240 for atomically writing data transactions in accordance with illustrative embodiments of the present invention. In response to a transaction request, the method inblock 242 fetches the existing metadata associated with the transaction. This existing metadata state is sometimes referred to herein as the “from” state of the metadata, or in other words, found at an SBLfrom index in the SBL table 190. Inblock 244 changes to the metadata resulting from the transaction are calculated, and the changes are stored inblock 246 in the form of an atomic write descriptor (AWD). - The method continues in
block 248 where the transaction is executed idempotently. Indecision block 250 it is determined whether the transaction has been interrupted. If the determination ofblock 250 is no, then the method ends. If the determination ofblock 250 is yes, however, then the AWD is recalled inblock 254 and used to atomically complete the transaction. -
FIG. 8 is a diagrammatic illustration of anAWD structure 260 constructed in accordance with embodiments of the present invention. TheAWD 260 contains thestate information 218 for the metadata as it is intended to be following a successful execution of the data transaction. This future state of the metadata is sometimes referred to herein as the “real” state, and thereby indexed as the SBLDreal state 262. TheAWD 260 can also contain ablocks indicator 264 defining a number of blocks in the pending data transaction, an offsetindicator 266 defining a starting offset into the array of data blocks defined by an SBL, an SBLreal index 268 to afirst SBL 191 entry associated with the state of the respective stripe after the data transaction, an SBLfrom index 270 to asecond SBL 191 entry associated with the state of the respective stripe before the data transaction, and acondition indicator 272 defining a characteristic type of pending data transaction, such as whether the transaction is a miss sequence (“Miss”), a previous dirty sequence (“Dirty”), and a random array of independent drives update parity sequence (“RMW”). - The Miss case is the simplest and basically amounts to calculating new dirty counts for the SBLDs and setting the dirty bits in the SDBs. There are no previous dirty buffers to deal with and no SBLfroms to clean up. The SBreal for this case are found in the SBLreal index 268.
- The Dirty case contemplates the SBLfrom because there was some previous dirty data within the range of blocks for the transaction. The SBLDs and SDBs for these SBLs will not be updated at any time during the atomic writing script. This is because the SBLfroms are used exclusively to hold the buffers with the new dirty data to be written. They will be returned to the free pool by the partner after the script completes. It is, however, necessary to clear the present bits in the associated SPBs that were set as part of allocation. Note that the partner may use the same SBLfrom for multiple simultaneous atomic writing operations on the same data stripe because the set of buffers must be, as a consequence of the algorithm, exclusive to the particular operation.
- When there is previous dirty data, the essential part of the atomic writing method is to replace the old set of buffers with an entire new set of buffers. Because of this, the operation is preferably done on complete buffers. In order to achieve this condition the partner will need to take out an extended lock to block access to any sectors in the first and last buffers that are outside the range of blocks for the write (for which new data is being supplied by the host). Furthermore, these outside sectors must be copied if dirty, or marked as not present if currently marked present, or simply copied if present, whether or not they are dirty. To simplify the logic, any outside sectors that are present can be copied. Of course, there may not be any outside sectors if the transfer is properly aligned to buffer boundaries.
- The RMW case is similar to the Miss case except that one or two SBLs are involved for maintaining row and possibly diagonal parity data.
-
FIGS. 12A-12C illustrate a more detailed flowchart of themethod 240 for atomically writing in accordance with embodiments of the present invention, including the derivation of theAWD 260 in relation to the type of pending transaction. Themethod 240 initially processes sequential decision blocks 280, 282 where it is determined whether the pending transaction affects RAID data and whether the data subject to the pending transaction has been previously cached, respectively. If the determination ofblock 280 is yes, or if the determinations ofblocks block 284 the SBLDreal state 218 fields are fetched and new dirty counts are calculated for the SBLDreal inblock 286. If, contrarily, the determination ofblock 280 is no and the determination ofblock 282 is yes, then the SBLDreal state 218 is fetched as above, and additionally the SDBreal fields are fetched inblock 288, the previous dirty count is computed inblock 290, and the new dirty counts are calculated for the SBLDreal inblock 286. - For the branch denoted “A1” (block 720=yes),
new parity data 224 is set inblock 292,new column parity 222 is set inblock 294, and theAWD 260 is then created inblock 296. For the branch denoted “A2” (block 280=no and block 282 =no), theAWD 260 can be created directly. Finally, for the branch denoted “A3” (branch 280 =no andbranch 282=yes), the SBLreal buffers are freed inblock 298, the SPB for SBLfrom is cleared inblock 300, and then theAWD 260 is created inblock 296. It will be noted that the operations performed inblocks block 296 because the freed SBLreal buffers wind up as dirty if the process is interrupted before the AWD is written. - The condition (Miss, Dirty, or RMW) is set in
block 302, and theAWD 260 is written to memory inblock 304. The pending transaction is then executed idempotently inblock 306.Decision block 308 determines whether the execution is interrupted. If the determination ofblock 308 is no, control then branches to block 310 (FIG. 12C ) where the condition is set to idle and the atomic writing procedure ends. If, however, the execution is not completed and it is determined the execution has been interrupted inblock 308, then theAWD 260 is recalled from memory inblock 314. If inblock 316 it is determined that the condition is RMW, then the SBLparity state is updated inblock 318 and the SDB for SPLparity are set inblock 320 from information provided by theAWD 260. Contrarily, if the condition is not RMW, then the SBLreal state is updated inblock 322 and the SDB for SBLreal is set inblock 324 from information provided by theAWD 260. - If it is determined in
block 326 that the condition is not Dirty, then control branches to block 310 where the condition is changed to idle and the atomic writing method is ended. Contrarily, if the condition is Dirty, then the buffer indices of SBLfrom are copied to SBLreal and the condition is then set to idle inblock 310, the atomic writing method being ultimately ended. - Summarizing, an AWD (such as 260) structure is provided comprising an SBLD (such as 199) defining state information (such as 218) of an SBL (such as 191) entry associating a virtual stripe of data storage space with cache data.
- In some embodiments the AWD comprises a block indicator (such as 264) defining a number of blocks in a pending data transaction between the storage space and the cache. In some embodiments the AWD comprises an offset indicator (such as 266) defining a starting address of the number of blocks in the data buffer. In some embodiments the AWD comprises a first index (such as 268) to a first SBL entry associated with a state of the respective stripe after the data transaction. AWD comprises a second index (such as 270) to a second SBL entry associated with a state of the respective stripe before the data transaction. In some embodiments the AWD comprises a condition indicator (such as 272) defining a characteristic type of pending data transaction, such as a miss sequence, a previous dirty sequence, and a random array of independent drives update parity sequence. The condition indicator must be written last. The single store operation makes the entire sequence “atomic.”
- In some embodiments a method for atomic writing is provided, comprising constructing metadata associating a virtual stripe of data storage space with cache data (such as 242); modifying the metadata to reflect state changes related to a pending data transaction between the data storage space and the cache (such as 244); writing the modified metadata to an atomic write descriptor (such as 246); and recalling the atomic write descriptor for transacting a selected atomic block size in an event of an interruption while executing the data transaction (such as 254).
- The method writing step can be characterized by writing the block indicator defining the number of data blocks in the transaction, writing the offset indicator defining a starting address of the number of data blocks in the data buffer, defining a condition indicator relating to a characteristic type of data transaction, updating state information of parity data in a redundant array of independent drives, updating state information of dirty data previously existing in the cache, updating a bit map relating locations of dirty data within the data buffer sectors, and updating a bit map relating locations of present data within the data buffer sectors. The constructing step can be characterized by defining a SBL aligning the virtual stripes of the data storage space to the cache data, and wherein the writing step comprises defining a first index to a first stripe buffer list entry associated with a state of the respective stripe after the data transaction, and defining a second index to a second stripe buffer list entry associated with a state of the respective stripe before the data transaction.
- In some embodiments a distributed storage system is provided comprising a bulk data storage space in communication with a cache, and means for atomically transacting data between the storage space and the cache. The means for atomically transacting can be characterized by storing an atomic write descriptor relating virtual stripes of the storage space to cache data. The means for atomically transacting can be characterized by the atomic write descriptor indexing stored information defining states of the storage space both before and after a pending data transaction.
- It is to be understood that even though numerous characteristics and advantages of various embodiments of the present invention have been set forth in the foregoing description, together with details of the structure and function of various embodiments of the invention, this detailed description is illustrative only, and changes may be made in detail, especially in matters of structure and arrangements of parts within the principles of the present invention to the full extent indicated by the broad general meaning of the terms in which the appended claims are expressed. For example, the particular elements may vary depending on the number and size of data storage devices making up an MDA, without departing from the spirit and scope of the present invention.
- In addition, although the embodiments described herein are directed to a data storage system, it will be appreciated by those skilled in the art that the claimed subject matter is not so limited and various other processing systems can utilize the embodiments of the present invention without departing from the spirit and scope of the claimed invention.
Claims (20)
1. An atomic write data structure comprising a stripe buffer list descriptor defining state information of a stripe buffer list entry associating a virtual stripe of data storage space with cache data.
2. The data structure of claim 1 comprising a block indicator defining a number of blocks in a pending data transaction between the storage space and the cache.
3. The data structure of claim 2 comprising an offset indicator defining a starting address of the number of blocks in the data buffer.
4. The data structure of claim 3 comprising a first index to a first stripe buffer list entry associated with a state of the respective stripe after the data transaction.
5. The data structure of claim 4 comprising a second index to a second stripe buffer list entry associated with a state of the respective stripe before the data transaction.
6. The data structure of claim 5 comprising a condition indicator defining a characteristic type of pending data transaction.
7. The data structure of claim 6 wherein the condition indicator defines a characteristic type of data transaction from a set consisting of a miss sequence, a previous dirty sequence, and a random array of independent drives update parity sequence.
8. A method comprising:
constructing metadata associating a virtual stripe of data storage space with cache data;
modifying the metadata to reflect state changes related to a pending data transaction between the data storage space and the cache;
writing the modified metadata to an atomic write descriptor; and
recalling the atomic write descriptor for transacting a selected atomic block size in an event of an interruption while executing the data transaction.
9. The method of claim 8 wherein the writing step is characterized by writing a block indicator defining the number of data blocks in the transaction.
10. The method of claim 8 wherein the writing step is characterized by writing an offset indicator defining a starting address of the number of data blocks in the data buffer.
11. The method of claim 8 wherein the constructing step comprises defining a stripe buffer list aligning the virtual stripes of the data storage space to the cache data, and wherein the writing step comprises defining a first index to a first stripe buffer list entry associated with a state of the respective stripe after the data transaction.
12. The method of claim 11 wherein the writing step comprises defining a second index to a second stripe buffer list entry associated with a state of the respective stripe before the data transaction.
13. The method of claim 12 wherein the writing step comprises defining a condition indicator relating to a characteristic type of data transaction.
14. The method of claim 12 wherein the writing step is characterized by updating state information of parity data in a redundant array of independent drives.
15. The method of claim 12 wherein the writing step is characterized by updating state information of dirty data previously existing in the cache.
16. The method of claim 12 wherein the writing step is characterized by updating a bit map relating locations of dirty data within the data buffer sectors.
17. The method of claim 12 wherein the writing step is characterized by updating a bit map relating locations of present data within the data buffer sectors.
18. A method of executing data transactions in a distributed storage system comprising defining data structures associating cache data with a stripe of a virtual data storage capacity.
19. The method of claim 18 wherein the defining step comprises storing a condition indicator that deterministically branches a sequence of execution steps in relation to a characteristic type of pending data transaction.
20. The method of claim 18 wherein the sequence of execution steps is completed idempotently if an interruption condition occurs during execution and the condition is not idle, and wherein the condition is cleared after completion of the execution.
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/159,019 US20060294300A1 (en) | 2005-06-22 | 2005-06-22 | Atomic cache transactions in a distributed storage system |
JP2006171536A JP2007004798A (en) | 2005-06-22 | 2006-06-21 | Atomic cache transaction in distributed storage system |
US12/140,155 US9049242B2 (en) | 2005-06-22 | 2008-06-16 | Atomic cache transactions in a distributed storage system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/159,019 US20060294300A1 (en) | 2005-06-22 | 2005-06-22 | Atomic cache transactions in a distributed storage system |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/140,155 Continuation US9049242B2 (en) | 2005-06-22 | 2008-06-16 | Atomic cache transactions in a distributed storage system |
Publications (1)
Publication Number | Publication Date |
---|---|
US20060294300A1 true US20060294300A1 (en) | 2006-12-28 |
Family
ID=37568957
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/159,019 Abandoned US20060294300A1 (en) | 2005-06-22 | 2005-06-22 | Atomic cache transactions in a distributed storage system |
US12/140,155 Expired - Fee Related US9049242B2 (en) | 2005-06-22 | 2008-06-16 | Atomic cache transactions in a distributed storage system |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/140,155 Expired - Fee Related US9049242B2 (en) | 2005-06-22 | 2008-06-16 | Atomic cache transactions in a distributed storage system |
Country Status (2)
Country | Link |
---|---|
US (2) | US20060294300A1 (en) |
JP (1) | JP2007004798A (en) |
Cited By (33)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070294474A1 (en) * | 2006-06-20 | 2007-12-20 | Microsoft Corporation | Efficiently synchronizing with separated disk caches |
US20080313197A1 (en) * | 2007-06-15 | 2008-12-18 | Microsoft Coporation | Data structure for supporting a single access operation |
US20090196622A1 (en) * | 2007-07-09 | 2009-08-06 | Samsung Electronics Co., Ltd. | Reconnection method in peripheral interface using visible light communication |
US20090198899A1 (en) * | 2008-01-31 | 2009-08-06 | Bea Systems, Inc. | System and method for transactional cache |
US20100250833A1 (en) * | 2009-03-30 | 2010-09-30 | Trika Sanjeev N | Techniques to perform power fail-safe caching without atomic metadata |
US7830873B1 (en) * | 2007-01-09 | 2010-11-09 | Marvell Israel (M.I.S.L.) Ltd. | Implementation of distributed traffic rate limiters |
EP2342644A2 (en) * | 2008-09-26 | 2011-07-13 | Micron Technology, Inc. | Data streaming for solid-state bulk storage devices |
WO2012016089A3 (en) * | 2010-07-28 | 2012-05-31 | Fusion-Io, Inc. | Apparatus, system, and method for conditional and atomic storage operations |
US8725934B2 (en) | 2011-12-22 | 2014-05-13 | Fusion-Io, Inc. | Methods and appratuses for atomic storage operations |
US8984216B2 (en) | 2010-09-09 | 2015-03-17 | Fusion-Io, Llc | Apparatus, system, and method for managing lifetime of a storage device |
US9015425B2 (en) | 2009-09-09 | 2015-04-21 | Intelligent Intellectual Property Holdings 2, LLC. | Apparatus, systems, and methods for nameless writes |
US20150261610A1 (en) * | 2013-05-28 | 2015-09-17 | Amazon Technologies, Inc. | Self-describing data blocks of a minimum atomic write size for a data store |
US9218278B2 (en) | 2010-12-13 | 2015-12-22 | SanDisk Technologies, Inc. | Auto-commit memory |
US9223514B2 (en) | 2009-09-09 | 2015-12-29 | SanDisk Technologies, Inc. | Erase suspend/resume for memory |
US9251086B2 (en) | 2012-01-24 | 2016-02-02 | SanDisk Technologies, Inc. | Apparatus, system, and method for managing a cache |
US20160070740A1 (en) * | 2014-09-10 | 2016-03-10 | Amazon Technologies, Inc. | Stateless datastore-independent transactions |
US9305610B2 (en) | 2009-09-09 | 2016-04-05 | SanDisk Technologies, Inc. | Apparatus, system, and method for power reduction management in a storage device |
US9767017B2 (en) | 2010-12-13 | 2017-09-19 | Sandisk Technologies Llc | Memory device with volatile and non-volatile media |
CN107564558A (en) * | 2016-06-30 | 2018-01-09 | 希捷科技有限公司 | Realize scattered atom I/O write-ins |
CN108153489A (en) * | 2017-12-19 | 2018-06-12 | 联芸科技(杭州)有限公司 | The virtual data cache management system and method for a kind of nand flash memory controller |
CN108228483A (en) * | 2016-12-15 | 2018-06-29 | 北京忆恒创源科技有限公司 | The method and apparatus for handling atom write order |
US10133662B2 (en) | 2012-06-29 | 2018-11-20 | Sandisk Technologies Llc | Systems, methods, and interfaces for managing persistent data of atomic storage operations |
US10282132B2 (en) * | 2016-04-25 | 2019-05-07 | Samsung Electronics Co., Ltd. | Methods and systems for processing PRP/SGL entries |
US10291739B2 (en) * | 2015-11-19 | 2019-05-14 | Dell Products L.P. | Systems and methods for tracking of cache sector status |
US10296220B2 (en) | 2011-12-22 | 2019-05-21 | Sandisk Technologies Llc | Systems, methods, and interfaces for vector input/output operations |
US10817421B2 (en) | 2010-12-13 | 2020-10-27 | Sandisk Technologies Llc | Persistent data structures |
US10817502B2 (en) | 2010-12-13 | 2020-10-27 | Sandisk Technologies Llc | Persistent memory management |
US20210232421A1 (en) * | 2020-01-27 | 2021-07-29 | International Business Machines Corporation | Implementing erasure coding with persistent memory |
US11288200B2 (en) * | 2018-03-06 | 2022-03-29 | Blackberry Limited | Method and system for task-based cache isolation |
US11573909B2 (en) | 2006-12-06 | 2023-02-07 | Unification Technologies Llc | Apparatus, system, and method for managing commands of solid-state storage using bank interleave |
US11681698B2 (en) | 2021-05-10 | 2023-06-20 | Argo AI, LLC | Systems and methods for atomic publication of distributed writes to a distributed data warehouse |
US11755621B2 (en) | 2021-05-10 | 2023-09-12 | Argo AI, LLC | Systems and methods for atomic publication of distributed writes to a distributed data warehouse |
US11853324B2 (en) * | 2021-05-10 | 2023-12-26 | Argo AI, LLC | Systems and methods for atomic publication of distributed writes to a distributed data warehouse |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8732396B2 (en) * | 2009-06-08 | 2014-05-20 | Lsi Corporation | Method and apparatus for protecting the integrity of cached data in a direct-attached storage (DAS) system |
US9218279B2 (en) | 2013-03-15 | 2015-12-22 | Western Digital Technologies, Inc. | Atomic write command support in a solid state drive |
WO2017151211A1 (en) * | 2016-02-29 | 2017-09-08 | Microsemi Storage Solutions (U.S.), Inc. | Method and system for handling random access write requests for a shingled magnetic recording hard disk drive |
US10564865B2 (en) | 2016-03-22 | 2020-02-18 | Seagate Technology Llc | Lockless parity management in a distributed data storage system |
US10430279B1 (en) * | 2017-02-27 | 2019-10-01 | Tintri By Ddn, Inc. | Dynamic raid expansion |
EP3553664B1 (en) | 2017-11-03 | 2022-07-27 | Huawei Technologies Co., Ltd. | Method and apparatus for calculating available capacity of storage system |
US10915267B2 (en) * | 2017-12-06 | 2021-02-09 | Intel Corporation | Atomic cross-media writes on a storage device |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5884098A (en) * | 1996-04-18 | 1999-03-16 | Emc Corporation | RAID controller system utilizing front end and back end caching systems including communication path connecting two caching systems and synchronizing allocation of blocks in caching systems |
Family Cites Families (52)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US667849A (en) * | 1899-11-08 | 1901-02-12 | Alfred B Morse | Quill-retaining device. |
JPH01140342A (en) | 1987-11-27 | 1989-06-01 | Nec Corp | Virtual computer system |
US5163131A (en) * | 1989-09-08 | 1992-11-10 | Auspex Systems, Inc. | Parallel i/o network file server architecture |
US5276860A (en) * | 1989-12-19 | 1994-01-04 | Epoch Systems, Inc. | Digital data processor with improved backup storage |
US5379417A (en) * | 1991-11-25 | 1995-01-03 | Tandem Computers Incorporated | System and method for ensuring write data integrity in a redundant array data storage system |
EP0632912B1 (en) * | 1992-03-25 | 2001-01-31 | Sun Microsystems, Inc. | Real time processing system |
US5752250A (en) * | 1994-12-02 | 1998-05-12 | Fujitsu Limited | Instance updating method and apparatus therefor |
US5632027A (en) * | 1995-09-14 | 1997-05-20 | International Business Machines Corporation | Method and system for mass storage device configuration management |
US5761678A (en) | 1996-06-26 | 1998-06-02 | International Business Machines Corporation | Creation of clone storage area with identification of base storage area and deferred cloning of metadata |
US6243773B1 (en) * | 1997-05-13 | 2001-06-05 | Micron Electronics, Inc. | Configuration management system for hot adding and hot replacing devices |
US6058455A (en) * | 1997-07-02 | 2000-05-02 | International Business Corporation | RAID system having a selectable unattended mode of operation with conditional and hierarchical automatic re-configuration |
US5961625A (en) * | 1997-07-31 | 1999-10-05 | Advanced Micro Devices, Inc. | Bus bridge state monitoring in a bus bridge verification system |
US6567889B1 (en) * | 1997-12-19 | 2003-05-20 | Lsi Logic Corporation | Apparatus and method to provide virtual solid state disk in cache memory in a storage controller |
GB2343020A (en) | 1998-10-19 | 2000-04-26 | Ibm | Handling transaction failures in a transaction processing system |
US6195695B1 (en) * | 1998-10-27 | 2001-02-27 | International Business Machines Corporation | Data processing system and method for recovering from system crashes |
JP2000163344A (en) * | 1998-11-27 | 2000-06-16 | Nec Corp | Data base recovery system for network management system |
US6438606B1 (en) * | 1998-12-23 | 2002-08-20 | Cisco Technology, Inc. | Router image support device |
DE59900545D1 (en) * | 1999-04-10 | 2002-01-24 | Basis Gmbh Edv Vertriebs Ges | Data carrier with a recoverable basic data basic state and method for its production |
US6769022B1 (en) * | 1999-07-09 | 2004-07-27 | Lsi Logic Corporation | Methods and apparatus for managing heterogeneous storage devices |
US6584499B1 (en) * | 1999-07-09 | 2003-06-24 | Lsi Logic Corporation | Methods and apparatus for performing mass operations on a plurality of managed devices on a network |
US6629111B1 (en) * | 1999-10-13 | 2003-09-30 | Cisco Technology, Inc. | Memory allocation system |
US6338126B1 (en) * | 1999-12-06 | 2002-01-08 | Legato Systems, Inc. | Crash recovery without complete remirror |
US6477612B1 (en) * | 2000-02-08 | 2002-11-05 | Microsoft Corporation | Providing access to physical memory allocated to a process by selectively mapping pages of the physical memory with virtual memory allocated to the process |
US6427198B1 (en) * | 2000-02-15 | 2002-07-30 | International Business Machines Corporation | Method, system, and program for determining system configuration |
US6625754B1 (en) * | 2000-03-16 | 2003-09-23 | International Business Machines Corporation | Automatic recovery of a corrupted boot image in a data processing system |
US6691250B1 (en) * | 2000-06-29 | 2004-02-10 | Cisco Technology, Inc. | Fault handling process for enabling recovery, diagnosis, and self-testing of computer systems |
US6687849B1 (en) | 2000-06-30 | 2004-02-03 | Cisco Technology, Inc. | Method and apparatus for implementing fault-tolerant processing without duplicating working process |
US6643672B1 (en) * | 2000-07-31 | 2003-11-04 | Hewlett-Packard Development Company, Lp. | Method and apparatus for asynchronous file writes in a distributed file system |
US6701421B1 (en) * | 2000-08-17 | 2004-03-02 | International Business Machines Corporation | Application-level memory affinity control |
US6697971B1 (en) * | 2000-10-24 | 2004-02-24 | Hewlett-Packard Development Company, L.P. | System and method for detecting attempts to access data residing outside of allocated memory |
US6779110B1 (en) | 2000-11-09 | 2004-08-17 | International Business Machines Corporation | Network station suitable for identifying and prioritizing boot information for locating an operating system kernel on a remote server |
US6857059B2 (en) * | 2001-01-11 | 2005-02-15 | Yottayotta, Inc. | Storage virtualization system and methods |
US7177866B2 (en) * | 2001-03-16 | 2007-02-13 | Gravic, Inc. | Asynchronous coordinated commit replication and dual write with replication transmission and locking of target database on updates only |
US6684293B1 (en) * | 2001-03-27 | 2004-01-27 | Novell, Inc. | Methods and computer readable media for preserving unique critical information during data imaging |
US6915397B2 (en) * | 2001-06-01 | 2005-07-05 | Hewlett-Packard Development Company, L.P. | System and method for generating point in time storage copy |
US6671777B1 (en) * | 2001-06-15 | 2003-12-30 | Lsi Logic Corporation | Data storage system and method for managing critical data in an N-way mirrored storage device using first and second sequence numbers |
US6779130B2 (en) * | 2001-09-13 | 2004-08-17 | International Business Machines Corporation | Method and system for root filesystem replication |
US6715055B1 (en) * | 2001-10-15 | 2004-03-30 | Advanced Micro Devices, Inc. | Apparatus and method for allocating buffer space |
US6895467B2 (en) * | 2001-10-22 | 2005-05-17 | Hewlett-Packard Development Company, L.P. | System and method for atomizing storage |
US6931487B2 (en) * | 2001-10-22 | 2005-08-16 | Hewlett-Packard Development Company L.P. | High performance multi-controller processing |
US20030110233A1 (en) * | 2001-12-10 | 2003-06-12 | Vmic | Reflective memory system and method capable of dynamically sizing data packets |
US7426554B2 (en) * | 2002-03-06 | 2008-09-16 | Sun Microsystems, Inc. | System and method for determining availability of an arbitrary network configuration |
US6732717B2 (en) * | 2002-04-17 | 2004-05-11 | Delphi Technologies, Inc. | Fuel rail permeant collection system |
US7216258B2 (en) * | 2002-05-17 | 2007-05-08 | Xiotech Corporation | Method and apparatus for recovering from a non-fatal fault during background operations |
US7380113B2 (en) * | 2002-05-17 | 2008-05-27 | Xiotech Corporation | Method for updating memory resident firmware as a background operation |
US6732171B2 (en) | 2002-05-31 | 2004-05-04 | Lefthand Networks, Inc. | Distributed network storage system with virtualization |
US7158998B2 (en) * | 2002-07-31 | 2007-01-02 | Cingular Wireless Ii, Llc | Efficient synchronous and asynchronous database replication |
US20040024807A1 (en) * | 2002-07-31 | 2004-02-05 | Microsoft Corporation | Asynchronous updates of weakly consistent distributed state information |
JP3944449B2 (en) * | 2002-12-19 | 2007-07-11 | 株式会社日立製作所 | Computer system, magnetic disk device, and disk cache control method |
JP2004213470A (en) * | 2003-01-07 | 2004-07-29 | Nec Corp | Disk array device, and data writing method for disk array device |
US7260681B2 (en) * | 2005-06-02 | 2007-08-21 | Seagate Technology Llc | Stripe buffer list |
US7984258B2 (en) * | 2005-06-03 | 2011-07-19 | Seagate Technology Llc | Distributed storage system with global sparing |
-
2005
- 2005-06-22 US US11/159,019 patent/US20060294300A1/en not_active Abandoned
-
2006
- 2006-06-21 JP JP2006171536A patent/JP2007004798A/en active Pending
-
2008
- 2008-06-16 US US12/140,155 patent/US9049242B2/en not_active Expired - Fee Related
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5884098A (en) * | 1996-04-18 | 1999-03-16 | Emc Corporation | RAID controller system utilizing front end and back end caching systems including communication path connecting two caching systems and synchronizing allocation of blocks in caching systems |
Cited By (66)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110029737A1 (en) * | 2006-06-20 | 2011-02-03 | Microsoft Corporation | Efficiently synchronizing with separated disk caches |
US7558913B2 (en) * | 2006-06-20 | 2009-07-07 | Microsoft Corporation | Atomic commit of cache transfer with staging area |
US20090235021A1 (en) * | 2006-06-20 | 2009-09-17 | Microsoft Corporation | Efficiently synchronizing with separated disk caches |
US8489810B2 (en) | 2006-06-20 | 2013-07-16 | Microsoft Corporation | Cache data transfer to a staging area of a storage device and atomic commit operation |
US7840754B2 (en) * | 2006-06-20 | 2010-11-23 | Microsoft Corporation | Efficiently synchronizing with separated disk caches |
US8065480B2 (en) | 2006-06-20 | 2011-11-22 | Microsoft Corporation | Efficiently synchronizing with separated disk caches |
US8180959B2 (en) | 2006-06-20 | 2012-05-15 | Microsoft Corporation | Efficiently synchronizing with separated disk caches |
US20070294474A1 (en) * | 2006-06-20 | 2007-12-20 | Microsoft Corporation | Efficiently synchronizing with separated disk caches |
US11573909B2 (en) | 2006-12-06 | 2023-02-07 | Unification Technologies Llc | Apparatus, system, and method for managing commands of solid-state storage using bank interleave |
US11640359B2 (en) | 2006-12-06 | 2023-05-02 | Unification Technologies Llc | Systems and methods for identifying storage resources that are not in use |
US11847066B2 (en) | 2006-12-06 | 2023-12-19 | Unification Technologies Llc | Apparatus, system, and method for managing commands of solid-state storage using bank interleave |
US11960412B2 (en) | 2006-12-06 | 2024-04-16 | Unification Technologies Llc | Systems and methods for identifying storage resources that are not in use |
US7830873B1 (en) * | 2007-01-09 | 2010-11-09 | Marvell Israel (M.I.S.L.) Ltd. | Implementation of distributed traffic rate limiters |
US8078648B2 (en) | 2007-06-15 | 2011-12-13 | Microsoft Corporation | Data structure for supporting a single access operation |
US20080313197A1 (en) * | 2007-06-15 | 2008-12-18 | Microsoft Coporation | Data structure for supporting a single access operation |
KR101368166B1 (en) | 2007-07-09 | 2014-03-03 | 삼성전자주식회사 | Re-connection method in peripheral interface using visible light communication |
US8005366B2 (en) * | 2007-07-09 | 2011-08-23 | Samsung Electronics Co., Ltd. | Reconnection method in peripheral interface using visible light communication |
US20090196622A1 (en) * | 2007-07-09 | 2009-08-06 | Samsung Electronics Co., Ltd. | Reconnection method in peripheral interface using visible light communication |
US8019945B2 (en) | 2008-01-31 | 2011-09-13 | Oracle International Corporation | System and method for transactional cache |
US20090198899A1 (en) * | 2008-01-31 | 2009-08-06 | Bea Systems, Inc. | System and method for transactional cache |
US8700855B2 (en) | 2008-01-31 | 2014-04-15 | Oracle International Corporation | System and method for supporting a tiered cache |
EP2342644A4 (en) * | 2008-09-26 | 2012-10-24 | Micron Technology Inc | Data streaming for solid-state bulk storage devices |
KR101359772B1 (en) * | 2008-09-26 | 2014-02-06 | 마이크론 테크놀로지, 인크. | Data streaming for solid-state bulk storage devices |
EP2342644A2 (en) * | 2008-09-26 | 2011-07-13 | Micron Technology, Inc. | Data streaming for solid-state bulk storage devices |
US8700858B2 (en) * | 2009-03-30 | 2014-04-15 | Intel Corporation | Techniques to perform power fail-safe caching without atomic metadata |
US20100250833A1 (en) * | 2009-03-30 | 2010-09-30 | Trika Sanjeev N | Techniques to perform power fail-safe caching without atomic metadata |
US20120290774A1 (en) * | 2009-03-30 | 2012-11-15 | Trika Sanjeev N | Techniques to perform power fail-safe caching without atomic metadata |
TWI465906B (en) * | 2009-03-30 | 2014-12-21 | Intel Corp | Techniques to perform power fail-safe caching without atomic metadata |
US8195891B2 (en) * | 2009-03-30 | 2012-06-05 | Intel Corporation | Techniques to perform power fail-safe caching without atomic metadata |
US10289556B2 (en) | 2009-03-30 | 2019-05-14 | Intel Corporation | Techniques to perform power fail-safe caching without atomic metadata |
US9501402B2 (en) | 2009-03-30 | 2016-11-22 | Intel Corporation | Techniques to perform power fail-safe caching without atomic metadata |
US9251062B2 (en) | 2009-09-09 | 2016-02-02 | Intelligent Intellectual Property Holdings 2 Llc | Apparatus, system, and method for conditional and atomic storage operations |
US9223514B2 (en) | 2009-09-09 | 2015-12-29 | SanDisk Technologies, Inc. | Erase suspend/resume for memory |
US9305610B2 (en) | 2009-09-09 | 2016-04-05 | SanDisk Technologies, Inc. | Apparatus, system, and method for power reduction management in a storage device |
US9015425B2 (en) | 2009-09-09 | 2015-04-21 | Intelligent Intellectual Property Holdings 2, LLC. | Apparatus, systems, and methods for nameless writes |
US10013354B2 (en) | 2010-07-28 | 2018-07-03 | Sandisk Technologies Llc | Apparatus, system, and method for atomic storage operations |
WO2012016089A3 (en) * | 2010-07-28 | 2012-05-31 | Fusion-Io, Inc. | Apparatus, system, and method for conditional and atomic storage operations |
US9910777B2 (en) | 2010-07-28 | 2018-03-06 | Sandisk Technologies Llc | Enhanced integrity through atomic writes in cache |
US8984216B2 (en) | 2010-09-09 | 2015-03-17 | Fusion-Io, Llc | Apparatus, system, and method for managing lifetime of a storage device |
US9218278B2 (en) | 2010-12-13 | 2015-12-22 | SanDisk Technologies, Inc. | Auto-commit memory |
US9767017B2 (en) | 2010-12-13 | 2017-09-19 | Sandisk Technologies Llc | Memory device with volatile and non-volatile media |
US9772938B2 (en) | 2010-12-13 | 2017-09-26 | Sandisk Technologies Llc | Auto-commit memory metadata and resetting the metadata by writing to special address in free space of page storing the metadata |
US10817502B2 (en) | 2010-12-13 | 2020-10-27 | Sandisk Technologies Llc | Persistent memory management |
US10817421B2 (en) | 2010-12-13 | 2020-10-27 | Sandisk Technologies Llc | Persistent data structures |
US8725934B2 (en) | 2011-12-22 | 2014-05-13 | Fusion-Io, Inc. | Methods and appratuses for atomic storage operations |
US10296220B2 (en) | 2011-12-22 | 2019-05-21 | Sandisk Technologies Llc | Systems, methods, and interfaces for vector input/output operations |
US9251086B2 (en) | 2012-01-24 | 2016-02-02 | SanDisk Technologies, Inc. | Apparatus, system, and method for managing a cache |
US10133662B2 (en) | 2012-06-29 | 2018-11-20 | Sandisk Technologies Llc | Systems, methods, and interfaces for managing persistent data of atomic storage operations |
US20170031749A1 (en) * | 2013-05-28 | 2017-02-02 | Amazon Technologies, Inc. | Self-describing data blocks stored with atomic write |
US20150261610A1 (en) * | 2013-05-28 | 2015-09-17 | Amazon Technologies, Inc. | Self-describing data blocks of a minimum atomic write size for a data store |
US9465693B2 (en) * | 2013-05-28 | 2016-10-11 | Amazon Technologies, Inc. | Self-describing data blocks of a minimum atomic write size for a data store |
US9817710B2 (en) * | 2013-05-28 | 2017-11-14 | Amazon Technologies, Inc. | Self-describing data blocks stored with atomic write |
US10296606B2 (en) | 2014-09-10 | 2019-05-21 | Amazon Technologies, Inc. | Stateless datastore—independent transactions |
US20160070740A1 (en) * | 2014-09-10 | 2016-03-10 | Amazon Technologies, Inc. | Stateless datastore-independent transactions |
US9519674B2 (en) * | 2014-09-10 | 2016-12-13 | Amazon Technologies, Inc. | Stateless datastore-independent transactions |
US10291739B2 (en) * | 2015-11-19 | 2019-05-14 | Dell Products L.P. | Systems and methods for tracking of cache sector status |
US10282132B2 (en) * | 2016-04-25 | 2019-05-07 | Samsung Electronics Co., Ltd. | Methods and systems for processing PRP/SGL entries |
CN107564558A (en) * | 2016-06-30 | 2018-01-09 | 希捷科技有限公司 | Realize scattered atom I/O write-ins |
CN108228483A (en) * | 2016-12-15 | 2018-06-29 | 北京忆恒创源科技有限公司 | The method and apparatus for handling atom write order |
CN108153489A (en) * | 2017-12-19 | 2018-06-12 | 联芸科技(杭州)有限公司 | The virtual data cache management system and method for a kind of nand flash memory controller |
US11288200B2 (en) * | 2018-03-06 | 2022-03-29 | Blackberry Limited | Method and system for task-based cache isolation |
US20210232421A1 (en) * | 2020-01-27 | 2021-07-29 | International Business Machines Corporation | Implementing erasure coding with persistent memory |
US11928497B2 (en) * | 2020-01-27 | 2024-03-12 | International Business Machines Corporation | Implementing erasure coding with persistent memory |
US11755621B2 (en) | 2021-05-10 | 2023-09-12 | Argo AI, LLC | Systems and methods for atomic publication of distributed writes to a distributed data warehouse |
US11853324B2 (en) * | 2021-05-10 | 2023-12-26 | Argo AI, LLC | Systems and methods for atomic publication of distributed writes to a distributed data warehouse |
US11681698B2 (en) | 2021-05-10 | 2023-06-20 | Argo AI, LLC | Systems and methods for atomic publication of distributed writes to a distributed data warehouse |
Also Published As
Publication number | Publication date |
---|---|
JP2007004798A (en) | 2007-01-11 |
US20080250199A1 (en) | 2008-10-09 |
US9049242B2 (en) | 2015-06-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US9049242B2 (en) | Atomic cache transactions in a distributed storage system | |
US7260681B2 (en) | Stripe buffer list | |
US20190278719A1 (en) | Primary Data Storage System with Data Tiering | |
US9009427B2 (en) | Mirroring mechanisms for storage area networks and network based virtualization | |
US8028146B2 (en) | Management of temporary and permanent areas in nonvolatile memories of a storage system | |
KR101055918B1 (en) | Preservation of Cache Data Following Failover | |
US20070094464A1 (en) | Mirror consistency checking techniques for storage area networks and network based virtualization | |
US20070094466A1 (en) | Techniques for improving mirroring operations implemented in storage area networks and network based virtualization | |
JP7135162B2 (en) | Information processing system, storage system and data transfer method | |
US7472231B1 (en) | Storage area network data cache | |
US20090259817A1 (en) | Mirror Consistency Checking Techniques For Storage Area Networks And Network Based Virtualization | |
US20090259816A1 (en) | Techniques for Improving Mirroring Operations Implemented In Storage Area Networks and Network Based Virtualization | |
US8745326B2 (en) | Request priority seek manager | |
TWI439094B (en) | Method, apparatus, and system for supporting storage environment | |
US7761649B2 (en) | Storage system with synchronized processing elements | |
US7761650B2 (en) | Processing wrong side I/O commands | |
WO2021017782A1 (en) | Method for accessing distributed storage system, client, and computer program product | |
KR20100131949A (en) | Method and apparatus for protecting the integrity of cached data in a direct-attached storage (das) system | |
US10620868B1 (en) | Storage system and data transfer method | |
US7882271B2 (en) | Processor partnering in a storage system | |
CN113342258B (en) | Method and apparatus for data access management of an all-flash memory array server | |
EP3889778B1 (en) | Distributed storage system and computer program product | |
JP5487482B2 (en) | Processor partnering in storage systems | |
US20230297241A1 (en) | Storage system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: SEAGATE TECHNOLOGY LLC, COLORADO Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:LUBBERS, CLARK EDWARD;REEL/FRAME:016721/0899 Effective date: 20050622 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |