Generally caching of block device data at a relatively lower latency device provides phenomenal performance for both read and write input/output (“I/O”) operations. As a read cache, data is stored in the cache device until it is replaced with the new data. Until then, the data is read from the cache device for subsequent read I/O operations directed to the same data block. As a write cache, new data is written to the cache device, and the write I/O operation is informed completed. Later based on policy, the dirty data stored in the cache device is persisted to the underlying stable medium. In addition, the cache device can be a solid state device (“SSD”). When compared to a hard disk drive, SSD devices have superior read and write performance. It is therefore desirable to maximize use of the SSD device(s) as the cache device to achieve a greater performance advantage.
In some data storage systems, a plurality of SSD devices can be used as the cache device. As described above, flushing operations can be performed to transfer dirty data from the SSD devices to the underlying data storage medium, for example, when there is cache pressure and/or if one of the SSD devices fails. However, flushing dirty data from the SSD devices to the underlying data storage medium may not be a quick process. Therefore, it is desirable to provide techniques for efficiently performing cache flushing operations.
An example computer-implemented method for performing cache flushing operations in a data storage system can include maintaining a plurality of SSDs as a cache medium for a data storage medium of the data storage system, controlling a region of the SSDs in a write-back cache mode, and monitoring a status of the SSDs to detect a low-performance condition of at least one of the SSDs. In the write-back cache mode, data is mirrored across the SSDs. The method can also include performing normal purge operations on the data stored in the region of the SSDs under a condition that the low-performance condition is not detected, and performing aggressive purge operations on the data stored in the region of the SSDs in response to detecting the low-performance condition. The normal purge operations can include flushing the data stored in the region of the SSDs to the data storage medium. The aggressive purge operations can include sequentially mirroring the data stored in the region of the SSDs to one or more special territories of the data storage medium.
The data storage medium can include SSD storage devices and relatively lower-performance, non-SSD storage devices such as serial advanced technology attachment (“SATA”) drives, Serial Attached Small Computer Systems Interface (“SAS”) drives, etc. The SSD cache medium can be used to cache data stored in the lower-performance, non-SSD storage drives. Because of the higher-performance characteristics of the SSD caching medium, it is possible to increase performance and lower latency by caching data stored in the lower-performance, non-SSD storage drives. In addition, the data stored in the SSD cache medium can include both cached data and metadata (e.g., logical block address (“LBA”) mapping, valid bitmaps, dirty bitmaps, etc.) used to manage the cached data.
Optionally, the low-performance condition can be a failure of one of the SSDs. Alternatively or additionally, the low-performance condition can optionally be a predicted SSD endurance level of one of the SSDs being less than an endurance threshold.
Additionally, the normal purge operations can include maintaining a timer for measuring a purge time period, maintaining a counter for accumulating a number of input/output (“I/O”) operations during the purge time period, and determining a quality of service (“QoS”) based on the number of I/O operations during the purge time period. The purge time period can be a periodic time period such as 60 seconds, for example. If the QoS is greater than or equal to a QoS threshold, the method can include continuing the normal purge operations. Optionally, to continue the normal purge operations, the QoS is greater than or equal to the QoS threshold at all times during the purge time period (e.g., as compared to only at the end of the purge time period). On the other hand, if the QoS is less than the QoS threshold, the method can include pausing the normal purge operations. Optionally, to the pause normal purge operations, the QoS is less than the QoS threshold at any time during the purge time period (e.g., as compared to only at the end of the purge time period).
Alternatively or additionally, the aggressive purge operations can include sequentially allocating the one or more special territories from the data storage medium, sequentially reading the data stored in the region of the SSDs, and sequentially writing the data read from the region of the SSDs to the special territories of the data storage medium. Optionally, the data storage medium to which the data is mirrored is configured to provide data protection. For example, the data storage medium can optionally include a plurality of disks and can be configured as a redundant array of inexpensive disks (“RAID”) array.
Alternatively or additionally, the method can include pausing the normal purge operations while performing the aggressive purge operations. In addition, the method can include resuming the normal purge operations in response to completing the aggressive purge operations. The aggressive purge operations are complete under a condition that all of the data stored in the region of the SSDs is mirrored to the special territories of the data storage medium. Optionally, the method can include controlling the region of the SSDs in a write-through cache mode in response to completing the normal purge operations. Alternatively or additionally, the method can optionally include releasing the special territories of the data storage medium in response to completing the normal purge operations. The normal purge operations are complete under a condition that all of the data stored in the region of the SSDs is flushed to the data storage medium.
It should be understood that the above-described subject matter may also be implemented as a computer-controlled apparatus, a computing system, or an article of manufacture, such as a computer-readable storage medium.
Other systems, methods, features and/or advantages will be or may become apparent to one with skill in the art upon examination of the following drawings and detailed description. It is intended that all such additional systems, methods, features and/or advantages be included within this description and be protected by the accompanying claims.
The components in the drawings are not necessarily to scale relative to each other. Like reference numerals designate corresponding parts throughout the several views.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art. Methods and materials similar or equivalent to those described herein can be used in the practice or testing of the present disclosure. As used in the specification, and in the appended claims, the singular forms “a,” “an,” “the” include plural referents unless the context clearly dictates otherwise. The term “comprising” and variations thereof as used herein is used synonymously with the term “including” and variations thereof and are open, non-limiting terms. The terms “optional” or “optionally” used herein mean that the subsequently described feature, event or circumstance may or may not occur, and that the description includes instances where said feature, event or circumstance occurs and instances where it does not. While implementations will be described for performing cache flushing operations on an SSD cache medium for a data storage system, it will become evident to those skilled in the art that the implementations are not limited thereto.
Turning now to
According to implementations, the nodes within a cluster may be housed in a one rack space unit storing up to four hard disk drives. For instance, the node 2A is a one rack space computing system that includes four hard disk drives 4A-4D (collectively, disks 4). Alternatively, each node may be housed in a three rack space unit storing up to fifteen hard disk drives. For instance, the node 2E includes hard disk drives 4A-4L. Other types of enclosures may also be utilized that occupy more or fewer rack units and that store fewer or more hard disk drives. In this regard, it should be appreciated that the type of storage enclosure and number of hard disk drives utilized is not generally significant to the implementation of the embodiments described herein. Any type of storage enclosure and virtually any number of hard disk devices or other types of mass storage devices may be utilized.
As shown in
Data may be striped across the nodes of each storage cluster. For instance, the cluster 5A may stripe data across the storage nodes 2A, 2B, 2C and 2D. The cluster 5B may similarly stripe data across the storage nodes 2E, 2F and 2G. Striping data across nodes generally ensures that different I/O operations are fielded by different nodes, thereby utilizing all of the nodes simultaneously, and that the same I/O operation is not split between multiple nodes. Striping the data in this manner provides a boost to random I/O performance without decreasing sequential I/O performance.
According to embodiments, each storage server computer 2A-2G includes one or more network ports operatively connected to a network switch 6 using appropriate network cabling. It should be appreciated that, according to embodiments of the invention, Ethernet or Gigabit Ethernet may be utilized. However, it should also be appreciated that other types of suitable physical connections may be utilized to form a network of which each storage server computer 2A-2G is a part. Through the use of the network ports and other appropriate network cabling and equipment, each node within a cluster is communicatively connected to the other nodes within the cluster. Many different types and number of connections may be made between the nodes of each cluster. Furthermore, each of the storage server computers 2A-2G need not be connected to the same switch 6. The storage server computers 2A-2G can be interconnected by any type of network or communication links, such as a LAN, a WAN, a MAN, a fiber ring, a fiber star, wireless, optical, satellite, or any other network technology, topology, protocol, or combination thereof.
Each cluster 5A-5B is also connected to a network switch 6. The network switch 6 is connected to one or more client computers 8A-8N (also referred to herein as “initiators”). It should be appreciated that other types of networking topologies may be utilized to interconnect the clients and the clusters 5A-5B. It should also be appreciated that the initiators 8A-8N may be connected to the same local area network (LAN) as the clusters 5A-5B or may be connected to the clusters 5A-5B via a distributed wide area network, such as the Internet. An appropriate protocol, such as the Internet Small Computer Systems Interface (“iSCSI”) or Fiber Channel protocol may be utilized to enable the initiators 8A-8N to communicate with and utilize the various functions of the storage clusters 5A-5B over a wide area network such as the Internet. An appropriate protocol, such as iSCSI, Fiber Channel, or Serial Attached SCSI (“SAS”), is also used to enable the members of the storage cluster to communicate with each other. These two protocols need not be similar.
Examples of the disks 4 may include hard drives, spinning disks, stationary media, non-volatile memories, or optically scanned media; each, or in combination, employing magnetic, capacitive, optical, semiconductor, electrical, quantum, dynamic, static, or any other data storage technology. The disks 4 may use IDE, ATA, SATA, PATA, SCSI, USB, PCI, Firewire, or any other bus, link, connection, protocol, network, controller, or combination thereof for I/O transfers.
Referring now to
The motherboard 12 may also utilize a system board chipset 22 implementing one or more of the devices described herein. One or more hardware slots 24A-24B may also be provided for expandability, including the addition of a hardware RAID controller to the storage server computer 2. It should also be appreciate that, although not illustrated in
As described briefly above, the motherboard 12 utilizes a system bus to interconnect the various hardware components. The system bus utilized by the storage server computer 2 provides a two-way communication path for all components connected to it. The component that initiates a communication is referred to as a “master” component and the component to which the initial communication is sent is referred to as a “slave” component. A master component therefore issues an initial command to or requests information from a slave component. Each slave component is addressed, and thus communicatively accessible to the master component, using a particular slave address. Both master components and slave components are operable to transmit and receive communications over the system bus. Buses and the associated functionality of master-slave communications are well-known to those skilled in the art, and therefore not discussed in further detail herein.
As discussed briefly above, the system memory in the storage server computer 2 may include including a RAM 20 and a ROM 18. The ROM 18 may store a basic input/output system (“BIOS”) or Extensible Firmware Interface (“EFI”) compatible firmware that includes program code containing the basic routines that help to transfer information between elements within the storage server computer 2. As also described briefly above, the Ethernet controller 16 may be capable of connecting the local storage server computer 2 to the initiators 8A-8N via a network. Connections which may be made by the network adapter may include LAN or WAN connections. LAN and WAN networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet. The CPUs 14A-14B utilized by the storage server computer 2 are standard central processing units that perform the arithmetic and logical operations necessary for the operation of the storage server computer 2. CPUs are well-known in the art, and therefore not described in further detail herein. A graphics adapter may or may not be utilized within the storage server computer 2 that enables the display of video data (i.e., text and/or graphics) on a display unit.
As shown in
The mass storage devices and their associated computer-readable media, provide non-volatile storage for the storage server computer 2. Although the description of computer-readable media contained herein refers to a mass storage device, such as a hard disk or CD-ROM drive, it should be appreciated by those skilled in the art that computer-readable media can be any available media that can be accessed by the local storage server. By way of example, and not limitation, computer-readable media may comprise computer storage media and communication media. Computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EPROM, EEPROM, flash memory or other solid state memory technology, CD-ROM, DVD, or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by the computer.
Referring now to
The RAID layer 302 abstracts the organization of the RAID array 320A and presents a logical block-level interface to higher layers in the storage stack 300. For example, the RAID layer 302 can implement RAID level 5, where data is striped across the plurality of disks (e.g., disks 4A-4D) in the RAID array 320A. In a four disk array, a RAID stripe includes data block D1 stored on disk 1 (e.g., “4A”), data block D2 stored on disk 2 (e.g., “4B”), data block D3 stored on disk 3 (e.g., “4C”) and parity block PA stored on disk 4 (e.g., “4D”), for example. The parity block PA can be computed using XOR logic of data block D1, data block D2 and data block D3 (e.g., PA=D1⊕D2⊕D3). Additionally, the parity blocks in a RAID 5 array are distributed or staggered across the plurality of disks. Although RAID level 5 is discussed above, it should be understood that the RAID layer 302 can implement other RAID levels, such as RAID level 0, 1, 2, 3, 4 or 6.
The DVM layer 306 uses the block-level interface provided by the RAID layer 302 to manage the available storage capacity of the RAID array 320A and service I/O operations initiated by the initiators 8A-8N. The DVM layer 306 can implement a variety of storage management functions, such as volume virtualization, thin provisioning, snapshots, locking, data replication, etc. The DVM layer 306 can be implemented on the storage node 2 in software, hardware or a combination thereof. Volume virtualization provides the facility to create and manage multiple, logical volumes on the RAID array 320A, as well as expand a logical volume across multiple storage nodes within a storage cluster. Thin provisioning provides for the allocation of physical capacity of the RAID array 320A to logical volumes on an as-needed basis. For example, the available physical storage capacity of the RAID array 320A can be divided into a number of unique, equally-sized areas referred to as territories. Optionally, the size of a territory can be one terabyte (TB), a reduced size of 8 megabytes (MB) or any other territory size. Alternatively or additionally, the available physical storage capacity of the RAID array 320A can optionally be further subdivided into units referred to herein as provisions. The provisions can be unique, equally sized areas of the available physical capacity. For example, provisions may be 1 MB in size, a reduced size of 512 kilobytes (KB) or any other provision size. Optionally, a provision can be further subdivided into chunks. For example, the chunk size can be selected as 64 KB, a reduced size of 8 KB or any other chunk size. Snapshots provide functionality for creating and utilizing point-in-time snapshots of the contents of logical storage volumes. The locking functionality allows for synchronizing I/O operations within the storage node 2 or across nodes within the storage cluster. Data replication provides functionality for replication of data within the storage node 2 or across nodes within the storage cluster 2.
The cache layer 304 intercepts read and/or write I/O operations flowing between the RAID layer 302 and the DVM layer 306. The cache layer 304 is configured to read data from and/or write data to an SSD cache medium 330. The cache layer 304 can be implemented on the storage node 2 in software, hardware or a combination thereof. The SSD cache medium 330 can be used in either a write-through cache mode or a write-back cache mode. When the SSD cache medium 330 is controlled according to the write-through cache mode, a new read I/O operation (e.g., directed to a data block) is stored in the SSD cache medium 330 before returning the requested data block to the host (e.g., initiators 8A-8N shown in
Referring now to
The first cache region 402 can be maintained in the write-through cache mode (i.e., as a read cache), such that the first cache region 402 maintains read data blocks, for example. It should be understood that a cache layer (e.g., cache layer 304 shown in
The second cache region 404 can be maintained in the write-back cache mode (i.e., as a write cache), such that the second cache region 404 maintains dirty data blocks (e.g., data blocks not yet flushed to the mass storage devices), for example. This disclosure contemplates that at least a portion of the SSD cache medium (e.g., the SSD cache medium 330 shown in
It is desirable to maximize the use of the available storage capacity of the SSD cache medium 330 due to its superior I/O performance capability as compared to that of the physical storage medium (e.g., the mass storage devices 320 shown in
Each of SSDs ssd1 and ssd2 can have a capacity of 256 GB (i.e., 512 GB total capacity), for example. Optionally, 192 GB of each of SSDs ssd1 and ssd2 (e.g., 384 GB total capacity for the first cache region 402) can be controlled as the read cache, and 64 GB of each of the SSDs ssd1 and ssd2 (e.g., 64 GB total capacity for the second cache region 404) can be controlled as the write cache. Thus, the total capacity of the SSD cache medium 330 can be 448 GB (i.e., 192 GB+192 GB+64 GB), and with 8 KB cache granularity, the SSD cache medium 330 can accommodate 56 million cache lines
Additionally, the physical storage medium (e.g., the mass storage devices 320 shown in FIG. 3) can optionally have a capacity of 64 TB, for example. The physical storage medium can optionally include different types of drives such as SATA drives, SAS drives, SSD drives, etc., including combinations thereof. It should be understood that the different types of drives have different performance characteristics. It should also be understood that the SSDs, as well as the first and second cache regions, and the physical storage medium can have capacities greater or less than described above, which are provided only as examples.
With 8 KB cache line granularity, there are 8 billion
possible data blocks to store in the SSD cache medium 330 (which only has a capacity for 56 million cache lines as described above). In other words, the SSD cache medium 330 does not have a capacity large enough to cache all of the data stored in the physical storage medium. Thus, in order to maximize use of the SSD cache medium, the SSD cache medium can be used to cache data for the relatively-lower performance drives (e.g., the SATA and/or SAS drives) as opposed to the relatively higher-performance SSD drives. Additionally, the SSD cache medium can optionally be paired with the lower-performance drives that store data that is more frequently accessed. For example, the physical storage capacity can be divided into tiers such that highest tiers (e.g., including expensive, high-performance drives such as the SSD drives) store the most-frequently accessed data, the middle tiers (e.g., including less-expensive, medium performance drives such as the SAS drives) store less-frequently accessed data, and the lowest tiers (e.g., including least expensive, low performance drives such as the SATA drives) store infrequently accessed data. Thus, the SSD cache medium can optionally be paired with the SAS drives that store frequently-accessed data, for example, to maximize the benefit of pairing the higher-performance SSD cache medium with lower-performance storage devices.
Referring now to
LBA mapping can provide mapping between logical addresses in the physical storage medium (e.g., the mass storage devices 320 shown in
in the second cache region 404. Accordingly, LBA mapping 406 for the second cache region 404 would require approximately 48 MB (e.g., 6 bytes×8 million cache lines) in the above example.
Additionally, valid bitmaps can contain information about whether the data blocks cached in the SSD cache medium, for example cache lines in the first cache region 402 (e.g., the read cache), are valid. For example, the bits of the valid bitmap can be set to a first value (e.g., 1) when the cache line is valid or stores a current data block and set to a second value (e.g., 0) when the cache line is invalid or does not store a current data block. In this way, it is possible to determine whether particular cache lines can be retrieved from the SSD cache medium. Additionally, dirty bitmaps can contain information about whether the data blocks cached in the SSD cache medium, for example cache lines in the second cache region 404 (e.g., the write cache), have been persisted to the underlying physical storage medium (e.g., the mass storage devices 320 shown in
in the second cache region 404 (e.g., the write cache). Accordingly, the dirty bitmap for the second cache region 404 would require approximately 1 MB
It should be understood that the capacity of the underlying physical storage medium to be paired with the SSD cache medium and the capacity of the SSD cache medium provided above are used only as examples and that other sizes can be used.
As described above, SSD cache medium can include a plurality of SSDs such as SSDs ssd1 and ssd2 as shown in
random I/O operations to completely flush the data to the underlying physical storage medium. Additionally, assuming the underlying physical storage medium is a RAID 5 array with twelve SAS 10k drives, which can perform about 1,000 random write I/O operations per second (“IOPS”), the flushing operations will take approximately 8,388 seconds
or approximately 2 hours and 20 minutes. Although the probability that the remaining, operational or fully-operational (as described below) SSD will fail during the flushing operations may be low, this is still a possibility, especially since both SSDs are typically placed in service around the same installation time, and the subsequent failure will result in data loss. Therefore, it is desirable to take steps to avoid this scenario.
In order to mitigate the data loss scenario described above, there are a number of options. As a first option, more than two SSDs such as three (or more) SSDs can be used. It should be understood that the first option involves the additional cost associated with providing additional SSDs. Similar as described above with regard to
Example techniques for performing cache flushing operations in a data storage system are described below. A plurality of SSDs (e.g., SSDs ssd1 and ssd2 shown in
As described above, when a region of the SSDs is controlled in the write-back cache mode, new write I/O operations are performed in the SSDs and the write I/O operations are reported as completed. At a later time, the “dirty data blocks” are flushed from the SSDs and stored in the data storage medium (e.g., the underlying physical storage of the data storage system). Metadata such as dirty bitmaps, for example, can be maintained to track the dirty data blocks in the SSDs. As described above, bits in the dirty bitmaps can be set to a predetermined value (e.g., 1) to indicate that the corresponding data blocks need to be flushed to the data storage medium. The dirty bitmaps can be referenced during flushing operations to determine which data blocks to store in the data storage medium. After flushing the data blocks from the SSDs to the data storage medium, the corresponding bits in the dirty bitmaps can be reset (e.g., to 0). It should be understood that the flushing operations affect the I/O performance of the data storage system. For example, by pairing the region of the SSDs controlled as the write cache with the data storage medium, it is possible to increase performance and lower latency of the data storage system because I/O operations are executed on the higher-performance SSDs instead of on the lower-performance data storage medium. However, at a later time when the data blocks stored in the region of the SSDs are flushed to the data storage medium, the I/O operations are actually executed on the lower-performance data storage medium. Thus, the I/O operations attributable to the flushing operations will place a load on the data storage system in addition the real-time I/O operations.
The timing of normal flushing operations (or “normal purge operations” as used herein) can be controlled to maintain a specified QoS (or “QoS threshold” as used herein) such as a specified number of I/O operations per unit time, for example. It should be understood that the specified QoS for the data storage system can have any user-defined value. For example, the specified QoS for the data storage system can optionally be 4,000 I/O operations per second (“IOPS”). If the QoS is greater than or equal to the specified QoS (e.g., 4,000 IOPS), then the normal purge operations can be performed. If, however, the QoS is less than the specified QoS (e.g., 4,000 IOPS), then the normal purge operations can be paused, postponed, canceled, discontinued, etc. The normal purge operations can be resumed when the QoS is greater than or equal to the specified QoS (e.g., 4,000 IOPS).
For example, a timer for measuring a purge time period can be maintained. The purge time period can be any user-defined period of time. For example, the purge period of time can optionally be 60 seconds. Optionally, the cache layer 304 shown in
A status of the SSDs can also be monitored, for example, to detect a low-performance condition of at least one of the SSDs (e.g., either one of SSDs ssd1 or ssd2 shown in
The example techniques for performing cache flushing operations in the data storage system can therefore include monitoring a status of the SSDs to detect a low-performance condition of at least one of the SSDs. The normal purge operations (e.g., flushing the data stored in the region of the SSDs to the data storage medium as described above) can be performed under a condition that the low-performance condition is not detected. On the other hand, in response to detecting the low performance condition, aggressive purge operations (described below) can be performed. For example, the aggressive purge operations can include sequentially mirroring the data stored in the region of the SSDs (e.g., the data stored in the region of the fully-operational SSD) to one or more special territories of the data storage medium, which restores redundancy. As used herein, the fully-operational SSD does not have the detected low-performance condition, i.e., the fully-operational SSD has not failed and does not have a predicted endurance level less than the endurance threshold. An example of a fully-operational SSD 502 is shown in
The aggressive purge operations can optionally be performed immediately upon detecting the low-performance condition. For example, the data stored in the region of the fully-operational SSD (e.g., the fully-operational SSD 502 shown in
While mirroring the data from the fully-operational SSD (e.g., the fully-operational SSD 502 shown in
Similarly, while mirroring the data from the fully-operational SSD (e.g., the fully-operational SSD 502 shown in
Alternatively or additionally, the normal purge operations can optionally be paused while performing the aggressive purge operations. The aggressive purge operations are complete under a condition that all of the data stored in the region of the fully-operational SSD has been mirrored to the special territories of the data storage medium. In addition, the normal purge operations can optionally be resumed in response to completing the aggressive purge operations. Further, the metadata stored in the special territories (e.g., the special territories 504 shown in
Optionally, in response to completing the normal purge operations, the region of the fully-operational SSD can be controlled in a write-through cache mode (i.e., as a read cache). The normal purge operations are complete under a condition that all of the data stored in the region of the fully-operational SSD has been persisted to the permanent location in the data storage medium, for example, based on the LBA mapping metadata. In other words, the normal purge operations involve moving the data from the region of the fully-operational SSD, which has been mirrored to the special territories of the data storage medium, to permanent locations in the data storage medium. Alternatively or additionally, the special territories of the data storage medium can optionally be released in response to completing the normal purge operations.
Referring now to
Referring now to
Referring now to
Referring now to
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
This application claims the benefit of U.S. Provisional Patent Application No. 62/157,515, filed on May 6, 2015, entitled “SYSTEMS, DEVICES AND METHODS USING A SOLID STATE DEVICE AS A CACHING MEDIUM WITH A WRITE CACHE FLUSHING ALGORITHM,” the disclosure of which is expressly incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4989131 | Stone | Jan 1991 | A |
5499337 | Gordon | Mar 1996 | A |
5680579 | Young | Oct 1997 | A |
5732240 | Caccavale | Mar 1998 | A |
5757771 | Li | May 1998 | A |
5799324 | McNutt et al. | Aug 1998 | A |
5802561 | Fava et al. | Sep 1998 | A |
5892937 | Caccavale | Apr 1999 | A |
6175900 | Forin et al. | Jan 2001 | B1 |
6490578 | Burkhard | Dec 2002 | B1 |
6523102 | Dye | Feb 2003 | B1 |
6553511 | DeKoning et al. | Apr 2003 | B1 |
6606629 | DeKoning et al. | Aug 2003 | B1 |
6651153 | Orfali | Nov 2003 | B1 |
7177850 | Argenton et al. | Feb 2007 | B2 |
7257684 | Sinha et al. | Aug 2007 | B1 |
7953002 | Opsasnick | May 2011 | B2 |
8219724 | Caruso et al. | Jul 2012 | B1 |
8572736 | Lin | Oct 2013 | B2 |
8631472 | Martin et al. | Jan 2014 | B1 |
8775741 | de la Iglesia | Jul 2014 | B1 |
9256272 | Hasegawa et al. | Feb 2016 | B2 |
9501420 | Susarla et al. | Nov 2016 | B2 |
9632932 | Sutardja | Apr 2017 | B1 |
9798754 | Shilane et al. | Oct 2017 | B1 |
20020091965 | Moshayedi | Jul 2002 | A1 |
20040148471 | Wallin et al. | Jul 2004 | A1 |
20040260883 | Wallin et al. | Dec 2004 | A1 |
20050278486 | Trika et al. | Dec 2005 | A1 |
20070006013 | Moshayedi | Jan 2007 | A1 |
20070260811 | Merry, Jr. | Nov 2007 | A1 |
20090204853 | Diggs | Aug 2009 | A1 |
20090210620 | Jibbe et al. | Aug 2009 | A1 |
20090228646 | Edwards | Sep 2009 | A1 |
20100070703 | Sarkar | Mar 2010 | A1 |
20100082879 | McKean et al. | Apr 2010 | A1 |
20100088459 | Arya et al. | Apr 2010 | A1 |
20100100664 | Shimozono | Apr 2010 | A1 |
20100122200 | Merry, Jr. | May 2010 | A1 |
20100235670 | Keller | Sep 2010 | A1 |
20100250842 | Deshpande et al. | Sep 2010 | A1 |
20100299547 | Saika | Nov 2010 | A1 |
20110029686 | Sethi et al. | Feb 2011 | A1 |
20110087833 | Jones | Apr 2011 | A1 |
20110173378 | Filor | Jul 2011 | A1 |
20110238922 | Hooker et al. | Sep 2011 | A1 |
20120072698 | Unesaki et al. | Mar 2012 | A1 |
20120185647 | Dawkins | Jul 2012 | A1 |
20120221774 | Atkisson | Aug 2012 | A1 |
20130038961 | Song | Feb 2013 | A1 |
20130122856 | Kalmbach | May 2013 | A1 |
20130145223 | Okada et al. | Jun 2013 | A1 |
20130185511 | Sassone et al. | Jul 2013 | A1 |
20130285835 | Kim et al. | Oct 2013 | A1 |
20130318603 | Merza | Nov 2013 | A1 |
20140050002 | Sun | Feb 2014 | A1 |
20140052942 | Satou | Feb 2014 | A1 |
20140089558 | Baderdinni | Mar 2014 | A1 |
20140095547 | Guo et al. | Apr 2014 | A1 |
20140129758 | Okada et al. | May 2014 | A1 |
20140143505 | Sim et al. | May 2014 | A1 |
20140201442 | Rajasekaran | Jul 2014 | A1 |
20140325166 | Iyigun et al. | Oct 2014 | A1 |
20150026403 | Ish et al. | Jan 2015 | A1 |
20150095567 | Noda | Apr 2015 | A1 |
20150206558 | Ni et al. | Jul 2015 | A1 |
20150278127 | Takakura | Oct 2015 | A1 |
20150370715 | Samanta et al. | Dec 2015 | A1 |
20160004459 | Oohira | Jan 2016 | A1 |
20160011782 | Kurotsuchi | Jan 2016 | A1 |
20160170639 | Velayudhan et al. | Jun 2016 | A1 |
20160276015 | Bains et al. | Sep 2016 | A1 |
20170359371 | Merza | Dec 2017 | A1 |
Entry |
---|
Co-pending U.S. Appl. No. 15/145,084, filed May 3, 2016. |
Co-pending U.S. Appl. No. 15/145,099, filed May 3, 2016. |
Co-pending U.S. Appl. No. 15/145,874, filed May 4, 2016. |
Co-pending U.S. Appl. No. 15/145,878, filed May 4, 2016. |
Co-pending U.S. Appl. No. 15/145,883, filed May 4, 2016. |
Number | Date | Country | |
---|---|---|---|
62157515 | May 2015 | US |