The field of the invention is data processing, or, more specifically, methods, apparatus, and products for dynamically configuring a storage system to facilitate independent scaling of resources.
Modern storage systems can include a variety of resources such as computing resources and storage resources. Such resources typically must be scaled together. For example, additional processing resources must be added in order to add more storage resources and additional storage resources must be added in order to add more processing resources. The inability to scale one type of resource without scaling another type of resources inhibits the ability to create a storage system that is tailored to the specific needs of the storage system users.
Methods, apparatuses, and products for dynamically configuring a storage system to facilitate independent scaling of resources, including: detecting a change to a topology of the storage system consisting of different sets of blades configured within one of a plurality of chassis; and reconfiguring the storage system to change an allocation of resources to one or more authorities responsive to detecting the change to the topology of the storage system.
The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular descriptions of example embodiments of the invention as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts of example embodiments of the invention.
Example methods, apparatus, and products for dynamically configuring a storage system to facilitate independent scaling of resources in accordance with the present disclosure are described with reference to the accompanying drawings, beginning with
The chassis (102, 106, 110, 114) depicted in
Each chassis (102, 106, 110, 114) depicted in
Each chassis (102, 106, 110, 114) depicted in
Although not explicitly depicted in
In the example depicted in
In the example depicted in
For further explanation,
The compute resources (210, 212, 214) depicted in
The flash memory (230, 232, 234) depicted in
The NVRAM (236, 238, 240) depicted in
In the example method depicted in
Readers will appreciate that every piece of data and every piece of metadata stored in the storage system is owned by a particular authority (216, 218). Each authority (216, 218) may cause data that is owned by the authority (216, 218) to be stored within storage that is located within the same blade whose computing resources are supporting the authority (216, 218) or within storage that is located on some other blade. For example, the authority (216) that is executing on the compute resources (210) within a first blade (202) has caused data to be stored within a portion (220) of flash (230) and a portion (242) of NVRAM (236) that is physically located within the first blade (202), The authority (216) that is executing on the compute resources (210) within the first blade (202) has also caused data to be stored within a portion (222) of flash (232) on the second blade (204) in the storage system as well as a portion (226) of flash (234) on the fourth blade (208) in the storage system. Likewise, the authority (218) that is executing on the compute resources (214) within the third blade (202) has caused data to be stored within a portion (244) of NVRANI (236) that is physically located within the first blade (202), within a portion (224) of flash (232) within the second blade (204), within a portion (228) of flash (234) within the fourth blade (208), and within a portion (246) of NVRANI (240) within the fourth blade (208).
Readers will appreciate that many embodiments other than the embodiment depicted in
Readers will appreciate that if there is a change in where a particular segment of data is located (e.g., during a data move or a data reconstruction), the authority for that data segment should be consulted. In order to locate a particular piece of data, a hash value for a data segment may be calculated, an inode number may be applied, a data segment number may be applied, and so on. The output of such an operation can point to a storage resource for the particular piece of data. In some embodiments the operation described above may be carried out in two stages. The first stage maps an entity identifier (ID) such as a segment number, an inode number, or directory number to an authority identifier. This mapping may include a calculation such as a hash or a bit mask. The second stage maps the authority identifier to a particular storage resource, which may be done through an explicit mapping. The operation may be repeatable, so that when the calculation is performed, the result of the calculation reliably points to a particular storage resource. The operation may take the set of reachable storage resources as input, and if the set of reachable storage resources changes, the optimal set changes. In some embodiments, a persisted value represents the current assignment and the calculated value represents the target assignment the cluster will attempt to reconfigure towards.
The compute resources (210, 212, 214) within the blades (202, 204, 206) may be tasked with breaking up data to be written to storage resources in the storage system. When data is to be written to a storage resource, the authority for that data is located as described above. When the segment ID for data is already determined, the request to write the data is forwarded to the blade that is hosting the authority, as determined using the segment ID. The computing resources on such a blade may be utilized to break up the data and transmit the data for writing to a storage resource, at which point the transmitted data may be written as a data stripe in accordance with an erasure coding scheme. In some embodiments, data is requested to be pulled and in other embodiments data is pushed. When compute resources (210, 212, 214) within the blades (202, 204, 206) are tasked with reassembling data read from storage resources in the storage system, the authority for the segment ID containing the data is located as described above.
The compute resources (210, 212, 214) within the blades (202, 204, 206) may also be tasked with reassembling data read from storage resources in the storage system. The compute resources (210, 212, 214) that support the authority that owns the data may request the data from the appropriate storage resource. In some embodiments, the data may be read from flash storage as a data stripe. The compute resources (210, 212, 214) that support the authority that owns the data may be utilized to reassemble the read data, including correcting any errors according to the appropriate erasure coding scheme, and forward the reassembled data to the network. In other embodiments, breaking up and reassembling data, or some portion thereof, may be performed by the storage resources themselves.
The preceding paragraphs discuss the concept of a segment. A segment may represent a logical container of data in accordance with some embodiments. A segment may be embodied, for example, as an address space between medium address space and physical flash locations. Segments may also contain metadata that enables data redundancy to be restored (rewritten to different flash locations or devices) without the involvement of higher level software. In some embodiments, an internal format of a segment contains client data and medium mappings to determine the position of that data. Each data segment may be protected from memory and other failures, for example, by breaking the segment into a number of data and parity shards. The data and parity shards may be distributed by striping the shards across storage resources in accordance with an erasure coding scheme.
For further explanation,
The compute resources in the blade (302) depicted in
In the example depicted in
The blade (302) depicted in
Readers will appreciate that a compute blade may be similar to the blade (302) depicted in
For further explanation,
The example method depicted in
The topology of the storage system (400) may also be characterized by various aspects of the logical configuration of the storage system (400) such as, for example, a configuration setting that defines a RAID level that is utilized for striping data across storage devices in the storage system, a configuration setting that defines which redundancy policy that data contained within a particular write group should adhere to, a configuration setting that identifies the number of snapshots to be retained in the system, or any other configuration that impacts how the storage system (400) will operate. Detecting (402) a change to the topology of the storage system (400) may therefore be carried out, for example, by detecting that a particular configuration setting has changed.
In the example method depicted in
The example method depicted in
For further explanation,
The example method depicted in
In the example method depicted in
For further explanation,
The example method depicted in
In the example method depicted in
In the example method depicted in
Consider an example in which a storage system (400) included ten chassis that each included fifteen blades. In such an example, assume that the write group formation policy specifies that write groups should be formed such that: 1) the failure of an entire chassis will not cause data loss, and 2) the failure of any two blades within a single chassis will not cause data loss. In such an example, any write group whose data would be stored on three or more blades within a single chassis would not adhere to the write group formation policy as the failure of a single chassis (which should not result in data loss) could result in the failure of three of more blades (which can result in data loss). As such, the write group may only be associated (604) with a second set of blades (410) that include no more than two blades in a single chassis in order for the write group to conform to the write group formation policy.
For further explanation,
In the example method depicted in
In the example method depicted in
In the example method depicted in
In the example method depicted in
For further explanation,
In the example method depicted in
In the example method depicted in
In the examples described above, an authority executing on processing resources within a first blade may cause data to be stored on storage resources within a second blade. In such an example, the authority executing on a first blade may cause data to be stored on a second blade by sending a request to store data on the second blade to processing resources on the second blade. Alternatively, and particularly when there are no available processing resources on the second blade (e.g., the second blade is a storage blade), the processing resources on the first blade may have direct access to the storage resources on the second blade via a data communication link, via remote DMA hardware, or in other ways.
For further explanation,
Also stored in RAM (968) is an operating system (954). Operating systems useful in computers configured for dynamically configuring the storage system to facilitate independent scaling of resources according to embodiments described herein include UNIX™, Linux™, Microsoft XP™, AIX™, IBM's i5/OS™, and others as will occur to those of skill in the art. The operating system (954) and dynamic configuration module (926) in the example of
The example computer (952) of
The example computer (952) of
The example computer (952) of
The computer (952) may implement certain instructions stored on RAM (968) for execution by processor (956) for dynamically configuring the storage system to facilitate independent scaling of resources. In some embodiments, dynamically configuring the storage system to facilitate independent scaling of resources may be implemented as part of a larger set of executable instructions. For example, the dynamic configuration module (926) may be part of an overall system management process.
Readers will appreciate although the flow charts depicted in
Example embodiments of the present disclosure are described largely in the context of a methods and apparatus that are useful in dynamically configuring a storage system (400) to facilitate independent scaling of resources. Readers of skill in the art will recognize, however, that the present disclosure also may be embodied in a computer program product disposed upon computer readable storage media for use with any suitable data processing system. Such computer readable storage media may be any storage medium for machine-readable information, including magnetic media, optical media, or other suitable media. Examples of such media include magnetic disks in hard drives or diskettes, compact disks for optical drives, magnetic tape, and others as will occur to those of skill in the art. Persons skilled in the art will immediately recognize that any computer system having suitable processing means will be capable of executing the steps of the method of the invention as embodied in a computer program product. Persons skilled in the art will recognize also that, although some of the example embodiments described in this specification are oriented to software installed and executing on computer hardware, nevertheless, alternative embodiments implemented as firmware or as hardware are well within the scope of the present disclosure.
The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, RAM, a read-only memory (‘ROM’), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (‘SRAM’), a portable compact disc read-only memory (‘CD-ROM’), a digital versatile disk (‘DVD’), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
Computer readable program instructions for carrying out operations of the present disclosure may be assembler instructions, instruction-set-architecture (‘ISA’) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages.
Aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.
It will be understood from the foregoing description that modifications and changes may be made in various embodiments of the present disclosure without departing from its true spirit. The descriptions in this specification are for purposes of illustration only and are not to be construed in a limiting sense. The scope of the present disclosure is limited only by the language of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
5390327 | Lubbers et al. | Feb 1995 | A |
5479653 | Jones | Dec 1995 | A |
5706210 | Kumano et al. | Jan 1998 | A |
5799200 | Brant et al. | Aug 1998 | A |
5933598 | Scales et al. | Aug 1999 | A |
6012032 | Donovan et al. | Jan 2000 | A |
6085333 | DeKoning et al. | Jul 2000 | A |
6275898 | DeKoning | Aug 2001 | B1 |
6643641 | Snyder | Nov 2003 | B1 |
6643748 | Wieland | Nov 2003 | B1 |
6647514 | Umberger et al. | Nov 2003 | B1 |
6725392 | Frey et al. | Apr 2004 | B1 |
6789162 | Talagala et al. | Sep 2004 | B1 |
6985995 | Holland et al. | Jan 2006 | B2 |
7069383 | Yamamoto et al. | Jun 2006 | B2 |
7076606 | Orsley | Jul 2006 | B2 |
7089272 | Garthwaite et al. | Aug 2006 | B1 |
7107389 | Inagaki et al. | Sep 2006 | B2 |
7146521 | Nguyen | Dec 2006 | B1 |
7159150 | Kenchammana-Hosekote | Jan 2007 | B2 |
7162575 | Dalal et al. | Jan 2007 | B2 |
7334124 | Pham et al. | Feb 2008 | B2 |
7334156 | Land et al. | Feb 2008 | B2 |
7437530 | Rajan | Oct 2008 | B1 |
7493424 | Bali et al. | Feb 2009 | B1 |
7558859 | Kasiolas | Jul 2009 | B2 |
7613947 | Coatney | Nov 2009 | B1 |
7669029 | Mishra et al. | Feb 2010 | B1 |
7681104 | Sim-Tang et al. | Mar 2010 | B1 |
7681105 | Sim-Tang et al. | Mar 2010 | B1 |
7689609 | Lango et al. | Mar 2010 | B2 |
7730258 | Smith | Jun 2010 | B1 |
7743191 | Liao | Jun 2010 | B1 |
7743276 | Jacobsen et al. | Jun 2010 | B2 |
7757038 | Kitahara | Jul 2010 | B2 |
7778960 | Chatterjee et al. | Aug 2010 | B1 |
7814272 | Barrall et al. | Oct 2010 | B2 |
7814273 | Barrall | Oct 2010 | B2 |
7818531 | Barrall | Oct 2010 | B2 |
7827351 | Suetsugu et al. | Nov 2010 | B2 |
7827439 | Matthew et al. | Nov 2010 | B2 |
7870105 | Arakawa et al. | Jan 2011 | B2 |
7885938 | Greene et al. | Feb 2011 | B1 |
7886111 | Klemm et al. | Feb 2011 | B2 |
7899780 | Shmuylovich et al. | Mar 2011 | B1 |
7908448 | Chatterjee et al. | Mar 2011 | B1 |
7941697 | Mathew et al. | May 2011 | B2 |
7958303 | Shuster | Jun 2011 | B2 |
7971129 | Watson | Jun 2011 | B2 |
8010485 | Chatterjee et al. | Aug 2011 | B1 |
8010829 | Chatterjee et al. | Aug 2011 | B1 |
8020047 | Courtney | Sep 2011 | B2 |
8042163 | Karr et al. | Oct 2011 | B1 |
8046548 | Chatterjee et al. | Oct 2011 | B1 |
8051361 | Sim-Tang et al. | Nov 2011 | B2 |
8051362 | Li et al. | Nov 2011 | B2 |
8082393 | Galloway et al. | Dec 2011 | B2 |
8086585 | Brashers et al. | Dec 2011 | B1 |
8086634 | Mimatsu | Dec 2011 | B2 |
8086911 | Taylor | Dec 2011 | B1 |
8108502 | Tabbara et al. | Jan 2012 | B2 |
8117388 | Jernigan, IV | Feb 2012 | B2 |
8145838 | Miller et al. | Mar 2012 | B1 |
8145840 | Koul et al. | Mar 2012 | B2 |
8176360 | Frost et al. | May 2012 | B2 |
8244999 | Chatterjee et al. | Aug 2012 | B1 |
8271700 | Annem et al. | Sep 2012 | B1 |
8305811 | Jeon | Nov 2012 | B2 |
8315999 | Chatley et al. | Nov 2012 | B2 |
8327080 | Der | Dec 2012 | B1 |
8387136 | Lee et al. | Feb 2013 | B2 |
8402152 | Duran | Mar 2013 | B2 |
8412880 | Leibowitz et al. | Apr 2013 | B2 |
8437189 | Montierth et al. | May 2013 | B1 |
8465332 | Hogan et al. | Jun 2013 | B2 |
8473778 | Simitci | Jun 2013 | B2 |
8479037 | Chatterjee et al. | Jul 2013 | B1 |
8498967 | Chatterjee et al. | Jul 2013 | B1 |
8522073 | Cohen | Aug 2013 | B2 |
8527544 | Colgrove et al. | Sep 2013 | B1 |
8533527 | Daikokuya et al. | Sep 2013 | B2 |
8566546 | Marshak et al. | Oct 2013 | B1 |
8578442 | Banerjee | Nov 2013 | B1 |
8595455 | Chatterjee et al. | Nov 2013 | B2 |
8613066 | Brezinski et al. | Dec 2013 | B1 |
8620970 | English et al. | Dec 2013 | B2 |
8627136 | Shankar et al. | Jan 2014 | B2 |
8627138 | Clark | Jan 2014 | B1 |
8660131 | Vermunt et al. | Feb 2014 | B2 |
8700875 | Barron et al. | Apr 2014 | B1 |
8713405 | Healey et al. | Apr 2014 | B2 |
8751463 | Chamness | Jun 2014 | B1 |
8762642 | Bates et al. | Jun 2014 | B2 |
8762793 | Grube et al. | Jun 2014 | B2 |
8769622 | Chang et al. | Jul 2014 | B2 |
8775858 | Gower et al. | Jul 2014 | B2 |
8775868 | Colgrove et al. | Jul 2014 | B2 |
8788913 | Xin et al. | Jul 2014 | B1 |
8799746 | Baker et al. | Aug 2014 | B2 |
8800009 | Beda, III et al. | Aug 2014 | B1 |
8812860 | Bray | Aug 2014 | B1 |
8819383 | Jobanputra et al. | Aug 2014 | B1 |
8843700 | Salessi et al. | Sep 2014 | B1 |
8850108 | Hayes | Sep 2014 | B1 |
8850288 | Lazier et al. | Sep 2014 | B1 |
8850546 | Field et al. | Sep 2014 | B1 |
8856593 | Eckhardt et al. | Oct 2014 | B2 |
8862847 | Feng et al. | Oct 2014 | B2 |
8868825 | Hayes | Oct 2014 | B1 |
8874836 | Hayes | Oct 2014 | B1 |
8898346 | Simmons | Nov 2014 | B1 |
8898383 | Yamamoto et al. | Nov 2014 | B2 |
8898388 | Kimmel | Nov 2014 | B1 |
8909854 | Yamagishi et al. | Dec 2014 | B2 |
8918478 | Ozzie et al. | Dec 2014 | B2 |
8931041 | Banerjee | Jan 2015 | B1 |
8949863 | Coatney et al. | Feb 2015 | B1 |
8984602 | Bailey et al. | Mar 2015 | B1 |
8990905 | Bailey et al. | Mar 2015 | B1 |
9021053 | Bernbo et al. | Apr 2015 | B2 |
9025393 | Wu | May 2015 | B2 |
9053808 | Sprouse | Jun 2015 | B2 |
9058155 | Cepulis et al. | Jun 2015 | B2 |
9116819 | Cope et al. | Aug 2015 | B2 |
9117536 | Yoon | Aug 2015 | B2 |
9124569 | Hussain et al. | Sep 2015 | B2 |
9134922 | Rajagopal et al. | Sep 2015 | B2 |
9201733 | Verma | Dec 2015 | B2 |
9209973 | Aikas et al. | Dec 2015 | B2 |
9250687 | Aswadhati | Feb 2016 | B1 |
9250823 | Kamat et al. | Feb 2016 | B1 |
9300660 | Borowiec et al. | Mar 2016 | B1 |
9444822 | Borowiec et al. | Sep 2016 | B1 |
9507532 | Colgrove et al. | Nov 2016 | B1 |
9684531 | Jacobs | Jun 2017 | B2 |
9829066 | Thomas et al. | Nov 2017 | B2 |
20020013802 | Mori et al. | Jan 2002 | A1 |
20030145172 | Galbraith et al. | Jul 2003 | A1 |
20030191783 | Wolczko et al. | Oct 2003 | A1 |
20030225961 | Chow et al. | Dec 2003 | A1 |
20040015581 | Forbes | Jan 2004 | A1 |
20040080985 | Chang et al. | Apr 2004 | A1 |
20040111573 | Garthwaite | Jun 2004 | A1 |
20040153844 | Ghose et al. | Aug 2004 | A1 |
20040193814 | Erickson et al. | Sep 2004 | A1 |
20040260967 | Guha et al. | Dec 2004 | A1 |
20050039183 | Romero | Feb 2005 | A1 |
20050160416 | Jamison | Jul 2005 | A1 |
20050188246 | Emberty et al. | Aug 2005 | A1 |
20050216800 | Bicknell et al. | Sep 2005 | A1 |
20060015771 | Vana Gundy et al. | Jan 2006 | A1 |
20060129817 | Borneman et al. | Jun 2006 | A1 |
20060161726 | Lasser | Jul 2006 | A1 |
20060174157 | Barrall et al. | Aug 2006 | A1 |
20060184760 | Fujibayashi et al. | Aug 2006 | A1 |
20060230245 | Gounares et al. | Oct 2006 | A1 |
20060239075 | Williams et al. | Oct 2006 | A1 |
20070022227 | Miki | Jan 2007 | A1 |
20070028068 | Golding et al. | Feb 2007 | A1 |
20070055702 | Fridella et al. | Mar 2007 | A1 |
20070079068 | Draggon | Apr 2007 | A1 |
20070109856 | Pellicone et al. | May 2007 | A1 |
20070150689 | Pandit et al. | Jun 2007 | A1 |
20070168321 | Saito et al. | Jul 2007 | A1 |
20070214194 | Reuter | Sep 2007 | A1 |
20070214314 | Reuter | Sep 2007 | A1 |
20070220227 | Long | Sep 2007 | A1 |
20070268905 | Baker et al. | Nov 2007 | A1 |
20070294563 | Bose | Dec 2007 | A1 |
20070294564 | Reddin et al. | Dec 2007 | A1 |
20080005587 | Ahlquist | Jan 2008 | A1 |
20080077825 | Bello et al. | Mar 2008 | A1 |
20080155191 | Anderson et al. | Jun 2008 | A1 |
20080162674 | Dahiya | Jul 2008 | A1 |
20080195833 | Park | Aug 2008 | A1 |
20080270678 | Cornwell et al. | Oct 2008 | A1 |
20080282045 | Biswas et al. | Nov 2008 | A1 |
20080295118 | Liao | Nov 2008 | A1 |
20090077340 | Johnson et al. | Mar 2009 | A1 |
20090100115 | Park et al. | Apr 2009 | A1 |
20090198889 | Ito et al. | Aug 2009 | A1 |
20100052625 | Cagno et al. | Mar 2010 | A1 |
20100211723 | Mukaida | Aug 2010 | A1 |
20100246266 | Park et al. | Sep 2010 | A1 |
20100257142 | Murphy et al. | Oct 2010 | A1 |
20100262764 | Liu et al. | Oct 2010 | A1 |
20100268908 | Ouyang et al. | Oct 2010 | A1 |
20100325345 | Ohno et al. | Dec 2010 | A1 |
20100332754 | Lai et al. | Dec 2010 | A1 |
20110022812 | van der Linden | Jan 2011 | A1 |
20110035540 | Fitzgerald et al. | Feb 2011 | A1 |
20110072290 | Davis et al. | Mar 2011 | A1 |
20110125955 | Chen | May 2011 | A1 |
20110131231 | Haas et al. | Jun 2011 | A1 |
20110167221 | Pangal et al. | Jul 2011 | A1 |
20110302369 | Goto et al. | Dec 2011 | A1 |
20120023144 | Rub | Jan 2012 | A1 |
20120054264 | Haugh et al. | Mar 2012 | A1 |
20120079318 | Colgrove et al. | Mar 2012 | A1 |
20120131253 | McKnight et al. | May 2012 | A1 |
20120198152 | Terry et al. | Aug 2012 | A1 |
20120226934 | Rao | Sep 2012 | A1 |
20120303675 | Antani | Nov 2012 | A1 |
20120303919 | Hu et al. | Nov 2012 | A1 |
20120311000 | Post et al. | Dec 2012 | A1 |
20120311557 | Resch | Dec 2012 | A1 |
20130007845 | Chang et al. | Jan 2013 | A1 |
20130031414 | Dhuse et al. | Jan 2013 | A1 |
20130036272 | Nelson | Feb 2013 | A1 |
20130060884 | Bernbo et al. | Mar 2013 | A1 |
20130071087 | Motiwala et al. | Mar 2013 | A1 |
20130073894 | Xavier et al. | Mar 2013 | A1 |
20130124776 | Hallak et al. | May 2013 | A1 |
20130145447 | Maron | Jun 2013 | A1 |
20130151771 | Tsukahara et al. | Jun 2013 | A1 |
20130191555 | Liu | Jul 2013 | A1 |
20130198459 | Joshi et al. | Aug 2013 | A1 |
20130205173 | Yoneda | Aug 2013 | A1 |
20130219164 | Hamid | Aug 2013 | A1 |
20130227201 | Talagala et al. | Aug 2013 | A1 |
20130290607 | Chang et al. | Oct 2013 | A1 |
20130311434 | Jones | Nov 2013 | A1 |
20130318297 | Jibbe et al. | Nov 2013 | A1 |
20130332614 | Brunk et al. | Dec 2013 | A1 |
20140020083 | Fetik | Jan 2014 | A1 |
20140040702 | He et al. | Feb 2014 | A1 |
20140046908 | Patiejunas | Feb 2014 | A1 |
20140047263 | Coatney et al. | Feb 2014 | A1 |
20140068224 | Fan et al. | Mar 2014 | A1 |
20140074850 | Noel et al. | Mar 2014 | A1 |
20140082715 | Grajek et al. | Mar 2014 | A1 |
20140086146 | Kim et al. | Mar 2014 | A1 |
20140090009 | Li et al. | Mar 2014 | A1 |
20140096220 | Da Cruz Pinto et al. | Apr 2014 | A1 |
20140101434 | Senthurpandi et al. | Apr 2014 | A1 |
20140136880 | Shankar et al. | May 2014 | A1 |
20140164774 | Nord et al. | Jun 2014 | A1 |
20140173232 | Reohr et al. | Jun 2014 | A1 |
20140195636 | Karve et al. | Jul 2014 | A1 |
20140201512 | Seethaler et al. | Jul 2014 | A1 |
20140201541 | Paul et al. | Jul 2014 | A1 |
20140208155 | Pan | Jul 2014 | A1 |
20140215590 | Brand | Jul 2014 | A1 |
20140229654 | Goss et al. | Aug 2014 | A1 |
20140230017 | Saib | Aug 2014 | A1 |
20140258526 | Le Sant et al. | Sep 2014 | A1 |
20140282983 | Ju et al. | Sep 2014 | A1 |
20140285917 | Cudak et al. | Sep 2014 | A1 |
20140325262 | Cooper et al. | Oct 2014 | A1 |
20140351627 | Best et al. | Nov 2014 | A1 |
20140373104 | Gaddam et al. | Dec 2014 | A1 |
20140373126 | Hussain et al. | Dec 2014 | A1 |
20140380125 | Calder et al. | Dec 2014 | A1 |
20140380126 | Yekhanin et al. | Dec 2014 | A1 |
20150026387 | Sheredy et al. | Jan 2015 | A1 |
20150074463 | Jacoby et al. | Mar 2015 | A1 |
20150089569 | Sondhi et al. | Mar 2015 | A1 |
20150095515 | Krithivas et al. | Apr 2015 | A1 |
20150113203 | Dancho et al. | Apr 2015 | A1 |
20150121137 | McKnight et al. | Apr 2015 | A1 |
20150013492 | Anderson et al. | May 2015 | A1 |
20150149822 | Coronado et al. | May 2015 | A1 |
20150193169 | Sundaram et al. | Jul 2015 | A1 |
20150280959 | Vincent | Oct 2015 | A1 |
20150355970 | Hayes et al. | Dec 2015 | A1 |
20150362968 | Jurey et al. | Dec 2015 | A1 |
20150378888 | Zhang et al. | Dec 2015 | A1 |
20160098323 | Mutha et al. | Apr 2016 | A1 |
20160350009 | Cerreta et al. | Dec 2016 | A1 |
20160352720 | Hu et al. | Dec 2016 | A1 |
20160352830 | Borowiec et al. | Dec 2016 | A1 |
20160352834 | Borowiec et al. | Dec 2016 | A1 |
Number | Date | Country |
---|---|---|
0725324 | Aug 1996 | EP |
2164006 | Mar 2010 | EP |
WO-02-13033 | Feb 2002 | WO |
WO-2008103569 | Aug 2008 | WO |
WO-2012087648 | Jun 2012 | WO |
WO2013071087 | May 2013 | WO |
WO-2014110137 | Jul 2014 | WO |
WO-2015188014 | Dec 2015 | WO |
WO-2016015008 | Dec 2016 | WO |
WO-2016190938 | Dec 2016 | WO |
WO-2016195759 | Dec 2016 | WO |
WO-2016195958 | Dec 2016 | WO |
WO-2016195961 | Dec 2016 | WO |
Entry |
---|
Kong, Using PCI Express as the Primary System Interconnect in Multiroot Compute, Communications and Embedded Systems, White Paper, IDT.com, 2008 [<URL://https://www.renesas.com/us/en/document/whp/idt-pcie-multi-root-white-paper>] (Year: 2008). |
Paul Sweere, Creating Storage Class Persistent Memory with NVDIMM, Published in Aug. 2013, Flash Memory Summit 2013, <http://ww.flashmemorysummit.com/English/Collaterals/Proceedings/2013/20130814_T2_Sweere.pdf>, 22 pages. |
PCMag. “Storage Array Definition”. Published May 10, 2013. <http://web.archive.org/web/20130510121646/http://www.pcmag.com/encyclopedia/term/52091/storage-array>, 2 pages. |
Google Search of “Storage array Define” on Nov. 4, 2015 for U.S. Appl. No. 14/725,278, Results limited to entries dated before 2012, 1 page. |
Techopedia. “What is a disk Array”. Published Jan. 13, 2012. <http://web.archive.org/web/20120113053358/http://www.techopedia.com/definition/1009/disk-array>, 1 page. |
Webopedia. “What is a disk Array”. Published May 26, 2011. <http://web/archive.org/web/20110526081214/http://www.webopedia.com/TERM/D/disk_array.html>, 2 pages. |
Li et al., Access Control for the Services Oriented Architecture, Proceedings of the 2007 ACM Workshop on Secure Web Services (SWS '07), Nov. 2007, pp. 9-17, ACM New York, NY. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/015006, dated Apr. 29, 2016, 12 pages. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/015008, dated May 4, 2016, 12 pages. |
C. Hota et al., Capability-based Cryptographic Data Access Control in Cloud Computing, Int. J. Advanced Networking and Applications, col. 1, Issue 1, dated Aug. 2011, 10 pages. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/020410, dated Jul. 8, 2016, 17 pages. |
The International Search Report and the Written Opinion recieved from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/032084, dated Jul. 18, 2016, 12 pages. |
Faith, “Dictzip file Format”, GitHub.com (online). [Accessed Jul. 28, 2015], 1 page, URL: https://github.com/fidlej/idzip. |
Wikipedia, “Convergent Encryption”, Wikipedia.org (online), accessed Sep. 8, 2015, 2 pages, URL: en.wikipedia.org/wiki/Convergent_encryption. |
Storer et al., “Secure Data Deduplication”, Proceedings of the 4th ACM International Workshop on Storage Security and Survivability (StorageSS'08), Oct. 2008, 10 pages, ACM New York, NY. USA. DOI: 10.1145/1456469.1456471. |
The International Search Report and the Written Opinion recieved from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/016333, dated Jun. 8, 2016, 12 pages. |
ETSI, Network Function Virtualisation (NFV); Resiliency Requirements, ETSI GS NFCV-REL 001, V1.1.1, http://www.etsi.org/deliver/etsi_gs/NFV-REL/001_099/001/01.01.01_60/gs_NFV-REL001v010101p.pdf (online), dated Jan. 2015, 82 pages. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/032052, dated Aug. 30, 2016, 17 pages. |
Microsoft, “Hybrid for SharePoint Server 2013—Security Reference Architecture”, <http://hybrid.office.com/img/Security_Reference_Architecture.pdf> (online), dated Oct. 2014, 53 pages. |
Microsoft, “Hybrid Identity”, <http://aka.ms/HybridIdentityWp> (online), dated Apr. 2014, 36 pages. |
Microsoft, “Hybrid Identity Management”, <http://download.microsoft.com/download/E/A/E/EAE57CD1-A80B-423C-96BB-142FAAC630B9/Hybrid_Identity_Datasheet.pdf> (online), publised Apr. 2014, 17 pages. |
Jacob Bellamy-McIntyre et al., “OpenID and the Enterprise: A Model-based Analysis of Single Sign-on Authentication”, 2011 15th IEEE International Enterprise Distributed Object Computing Conference (EDOC), DOI: 10.1109/EDOC.2011.26, ISBN: 978-1-4577-0362-1, <https://www.cs.ackland.ac.nz/˜lutteroth/publications/McIntyreLutterothWeber2011-OpenID.pdf> (online), dated Aug. 29, 2011, 10 pages. |
The International Search Report and the Written Opinion received from the International Searching Authority (ISA/EPO) for International Application No. PCT/US2016/035492, dated Aug. 17, 2016, 10 pages. |
Hu et al., Container Marking: Combining Data Placement, Garbage Collection and Wear Levelling for Flash, 19th Annual IEEE International Symposium on Modelling, Analysis, and Simulation of Computer and Telecommunications Systems, Jul. 25-27, 2011, 11 pages, ISBN: 978-0-7695-4430-4, DOI: 10.1109/MASCOTS.2011.50. |
International Search Report and Written Opinion, PCT/US2016/036693, dated Aug. 29, 2016. |
International Search Report and Written Opinion, PCT/US2016/038758, dated Oct. 7, 2016. |
International Search Report and Written Opinion, PCT/US2016/040393, dated Sep. 22, 2016. |
International Search Report and Written Opinion, PCT/US2016/044020, dated Sep. 30, 2016. |
International Search Report and Written Opinion, PCT/US2016/044874, dated Oct. 7, 2016. |
International Search Report and Written Opinion, PCT/US2016/044875, dated Oct. 5, 2016. |
International Search Report and Written Opinion, PCT/US2016/044876, dated Oct. 21, 2016. |
International Search Report and Written Opinion, PCT/US2016/044877, dated Sep. 29, 2016. |
Zhang et al., Application-Aware and Software-Defined SSD Scheme for Tencent Large-Scale Storage System, 2016 IEEE 22nd International Conference on Parallel and Distributed Systems, Dec. 2016, pp. 482-490, Institute of Electrical and Electronics Engineers (IEEE) Computer Society, Digital Object Identifier: 10.1109/ICPADS.2016.0071, USA. |
Bjørling, OpenChannel Solid State Drives NVMe Speciftcation, Revision 1.2, Apr. 2016, 24 pages, LightNVM.io (online), URL: http://lightnvm.io/docs/Open-ChannelSSDInterfaceSpecification12-final.pdf. |
International Search Report and Written Opinion, PCT/US2017/012539, dated Apr. 19, 2017. |
Storer et al., Pergamum: Replacing Tape with Energy Efficient, Reliable, Disk-Based Archival Storage, Fast '08: 6th USENIX Conference on File and Storage Technologies, Feb. 2008 pp. 1-16, San Jose, CA. |
Hwang et al., RAID-x: A New Distributed Disk Array for I/O-Centric Cluster Computing, Proceedings of the 9th IEEE International Symposium on High Performance Distributed Computing (HPDC '00), Aug. 2000, pp. 279-286, IEEE, USA. |
International Search Report and Written Opinion, PCT/US2015/018169, dated May 15, 2015. |
International Search Report and Written Opinion, PCT/US2015/034302, dated Sep. 11, 2015. |
International Search Report, PCT/US2015/034291, dated Sep. 30, 2015. |
International Search Report, PCT/US2015/044370, dated Dec. 15, 2015. |
International Search Report, PCT/US2015/014604, dated Jul. 2, 2015. |
Number | Date | Country | |
---|---|---|---|
20170337002 A1 | Nov 2017 | US |