The present invention relates generally to software defined storage, and specifically to a method for accessing data stored in a software defined storage grid.
Software-defined storage (SDS) is a computer data storage technology that separates storage hardware from the software that manages the storage infrastructure. By definition, SDS software is separate from the hardware it is managing.
Grid storage is a computer data storage technology that stores data using multiple self-contained interconnected storage nodes (i.e., servers), so that any node can communicate with any other node without the data having to pass through a centralized node.
One advantage of grid storage systems is that its data distribution scheme offers a level of load balancing, fault-tolerance and redundancy across the system. It implies that if one storage node fails or if a pathway between two nodes is interrupted, the network can reroute data access via a different path or to a redundant node. In operation, SDS can implement a grid storage system to span data across multiple servers.
The description above is presented as a general overview of related art in this field and should not be construed as an admission that any of the information it contains constitutes prior art against the present patent application.
There is provided, in accordance with an embodiment of the present invention a method, including configuring multiple servers coupled to a network as a software defined storage (SDS) grid, receiving, by a first given server, an input/output (I/O) request, and upon identifying that a second given server is configured to process the I/O request, forwarding the I/O request to the second given server.
There is also provided, in accordance with an embodiment of the present invention a data facility, including a network, one or more host computers coupled to the network, and multiple servers coupled to the network, and configured as a software defined storage (SDS) grid, each of the servers including multiple storage devices, and a processor configured to receive at a receiving server, from a given host computer, an input/output (I/O) request, and upon identifying that a given server, different from the receiving server is configured to process the I/O request, to forward the I/O request to the given server.
There is further provided, in accordance with an embodiment of the present invention a computer program product, the computer program product including a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code including computer readable program code configured to arrange multiple servers coupled to a network as a software defined storage (SDS) grid, computer readable program code executing on a first given server and configured to receive an input/output (I/O) request, and computer readable program code configured, upon identifying that a second given server is arranged to process the I/O request, to forward the I/O request to the second server.
The disclosure is herein described, by way of example only, with reference to the accompanying drawings, wherein:
When accessing a software defined storage (SDS) grid comprising multiple servers, a host computer typically installs client software in order to be able to access the SDS grid. The client software maps the distribution of data on the SDS grid, and directs input/output (I/O) requests to a given server storing the data. Servers storing data for an SDS grid are also referred to herein as grid nodes. The client software typically includes a grid data map, which is used to direct data between the host and the relevant grid node.
Embodiments of the present invention provide systems and methods for storing grid data maps in the SDS grid, thereby enabling host computers to use standard storage protocols such as iSCSI to access data in the SDS grid. By enabling the use of standard storage protocols, embodiments of the present invention can eliminate any need for host computers to execute specialized kernel driver and/or client software in order to access data in the SDS grid.
As described hereinbelow, multiple servers are configured as an SDS grid, the servers being coupled to a network that also includes one or more host computers. Upon a first given server receiving an input/output (I/O) request from a given host computer and identifying that a second given server is configured to process the I/O request, the first given server can forward the I/O request to the second server for processing. Upon receiving a result of the I/O request from the second given server, the first given server can forward the result to the given host computer.
In a first embodiment, each of the servers can maintain a local copy of a data grid data map. Therefore, by accessing the respective local grid data map, the first given server can identify that the second given server is configured to process the I/O request. For example, the I/O request may comprise a read request for data stored on the second given server, and upon identifying, in the local grid data map, that the second given server stores the requested data, the first given server can forward the read request to the second given server.
In a second embodiment, the first given server can perform a calculation that identifies the second given storage system based on information included in the I/O request. For example, if the I/O request includes a logical block address (LBA), the calculation may comprise an algorithm that uses the LBA as an input parameter, and the result of the calculation can indicate the second given server. In additional embodiments, the first given server can use the local grid data map in conjunction with a calculation in order to identify the second given server.
Therefore, in systems implementing embodiments of the present invention, the given host computer does not need to have access to the grid data map. In operation, data can span across multiple SDS grid nodes, and each of the grid nodes in the SDS grid can function as proxies to all the other grid nodes in the SDS grid. Additionally, by enabling the first given server to identify the second given server upon receiving the I/O request, SDS grids implementing embodiments of the present invention enable any host computer to easily access data in the SDS grid regardless of the hardware and software (i.e., operating system and virtual machine) configuration of the host computer.
Facility 20 comprises a network 22 that couples host computers 24 to an SDS grid 26 that comprises multiple servers 28. While the configuration in
Each server 28 comprises computer 30 and more storage devices 32 that store data 34. Each computer 30 comprises a processor 36 and a memory 38 that stores a cache 40, an interface 42, a grid data map 44, and an application stack 46. As described hereinbelow, processor 36 uses cache 40, interface 42, and grid data map 44 to process I/O requests for data stores in SDS grid 26. In embodiments of the present invention, in addition to processing I/O requests from host computers for data 34, servers 28 in SDS grid 26 can also execute application stack 46. Examples of application stack 46 include, but are not limited to, database servers, web servers and email servers.
Storage devices 32 comprise multiple slow and/or fast access time mass storage devices, herein below assumed to be multiple hard disks.
In some embodiments each of storage devices 32 may comprise a logical storage device. In storage systems implementing the Small Computer System Interface (SCSI) protocol, the logical storage devices may be referred to as logical units, or LUNs. While each LUN can be addressed as a single logical unit, the LUN may comprise a combination of high capacity hard disk drives and/or solid state disk drives.
Interface 42 comprises a software application that is executed by processor 36 and is configured to receive and process I/O requests from host computers 24. Upon receiving an I/O request from a given host computer 24, interface 42 accesses grid data map 44 in order to identify a given server 28 that is configured to process the I/O request. Grid data map 44 comprises multiple entries, each of the entries comprising a data identifier and a server identifier. To identify the given server 28 that is configured to process the I/O request, interface 42 locates a given entry in grid data map 44 whose data identifier matches the data request, and retrieves the respective server identifier in the given entry, wherein the respective server identifier indicates the given server. In some embodiments, a given I/O request may comprise multiple data requests.
For example, if interface 42 in a first given server 28 receives an I/O request comprising a request to read data from a logical block address (LBA), the interface can locate a given entry in grid data map 44 whose data identifier includes the LBA, and retrieve, from the given entry, the server identifier that indicates a second given server 28. Interface 36 forwards a data request for the LBA to the second given server, and upon receiving the requested data from the second given server, the interface forwards the received data (i.e., a result of the data request) to the given host computer.
In
Processors 34 comprise general-purpose central processing units (CPU) or special-purpose embedded processors, which are programmed in software or firmware to carry out the functions described herein. The software may be downloaded to computers 30 in electronic form, over a network, for example, or it may be provided on non-transitory tangible media, such as optical, magnetic or electronic memory media. Alternatively, some or all of the functions of the processors may be carried out by dedicated or programmable digital hardware components, or using a combination of hardware and software elements.
The present invention may be a system, a method, and/or a computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.
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, a random access memory (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 described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
Computer readable program instructions for carrying out operations of the present invention 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. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
Aspects of the present invention 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.
In a receive step 54, processor 36 in a first given server (also referred to herein as a receiving server 28) receives, from a given host computer 24, an I/O request for data managed by SDS grid 26. Examples of I/O requests include, but are not limited to requests to read data from one or more specific locations in storage devices 32 SDS grid 26, or requests to write data to the one or more specific locations in the storage devices in the SDS grid. While the I/O request may comprise data stored in multiple locations in SDS grid 26, for purposes of simplicity, the I/O request described in the flow diagram comprises data stored in a single location.
In an identification step 56, processor 36 identifies a location for the data indicated by the I/O request. As described supra, processor 36 can use grid data map 44 to identify the location. Alternatively, processor 36 can use an algorithm (i.e., a computation) or a combination of grid data map 44 and an algorithm to identify the location in SDS grid 26.
In some embodiments the identified location may comprise a given server 28. In embodiments where SDS grid 26 comprises multiple physical and/or logical groups of servers 28, the identified location may comprise a given group. For purposes of simplicity, the location identified in the flow diagram comprises a single given server 28.
In a comparison step 58, if the identified location is on a second given server 28 (i.e., different from the receiving server), then in a first forwarding step 60, processor 36 forwards the I/O request to the second given server. In a remote processing step 62, the second given server processes the forwarded I/O request, and conveys a result of the processed I/O request to the first given server. In a second forwarding step 64, processor 36 forwards the result of the processed I/O request to the given host computer, and the method continues with step 54.
Returning to step 58, if the location is on the first given server, then processor 36 in the first given server processes the I/O request locally, and the method continues with step 64.
The flowchart(s) 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 invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, 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 combinations of special purpose hardware and computer instructions.
It will be appreciated that the embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and subcombinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art.
Number | Name | Date | Kind |
---|---|---|---|
6973549 | Testardi | Dec 2005 | B1 |
7103638 | Borthakur et al. | Sep 2006 | B1 |
7636801 | Kekre et al. | Dec 2009 | B1 |
8190784 | Raizen | May 2012 | B1 |
8627446 | Eaton et al. | Jan 2014 | B1 |
8826032 | Yahalom et al. | Sep 2014 | B1 |
9058122 | Nesbit et al. | Jun 2015 | B1 |
9294558 | Vincent et al. | Mar 2016 | B1 |
9384227 | Xiao et al. | Jul 2016 | B1 |
9521198 | Agarwala et al. | Dec 2016 | B1 |
9563517 | Natanzon et al. | Feb 2017 | B1 |
20040098537 | Serizawa | May 2004 | A1 |
20040103261 | Honda et al. | May 2004 | A1 |
20040143637 | Koning et al. | Jul 2004 | A1 |
20040193795 | Takeda et al. | Sep 2004 | A1 |
20040210724 | Koning et al. | Oct 2004 | A1 |
20040215792 | Koning et al. | Oct 2004 | A1 |
20040225719 | Kisley et al. | Nov 2004 | A1 |
20050076154 | Chambliss et al. | Apr 2005 | A1 |
20060010341 | Kodama | Jan 2006 | A1 |
20060026069 | Frank | Feb 2006 | A1 |
20060029069 | Frank et al. | Feb 2006 | A1 |
20060101196 | Urmston | May 2006 | A1 |
20060143350 | Miloushev et al. | Jun 2006 | A1 |
20060242380 | Korgaonkar et al. | Oct 2006 | A1 |
20070234116 | Yoshikawa et al. | Oct 2007 | A1 |
20070288494 | Chrin et al. | Dec 2007 | A1 |
20080126525 | Ueoka et al. | May 2008 | A1 |
20080281908 | McCanne et al. | Nov 2008 | A1 |
20090019157 | Suman et al. | Jan 2009 | A1 |
20090059862 | Talagala et al. | Mar 2009 | A1 |
20090132543 | Chatley et al. | May 2009 | A1 |
20090168784 | Nakamura et al. | Jul 2009 | A1 |
20090177860 | Zhu et al. | Jul 2009 | A1 |
20100088335 | Mimatsu | Apr 2010 | A1 |
20100153415 | Muntz | Jun 2010 | A1 |
20100199036 | Siewert | Aug 2010 | A1 |
20110047195 | Le et al. | Feb 2011 | A1 |
20110055477 | Hara et al. | Mar 2011 | A1 |
20110138136 | Shitomi et al. | Jun 2011 | A1 |
20110145448 | Gordon | Jun 2011 | A1 |
20110208979 | Saarinehn et al. | Aug 2011 | A1 |
20110271010 | Kenchammana et al. | Nov 2011 | A1 |
20120011176 | Aizman | Jan 2012 | A1 |
20120030415 | Selfin et al. | Feb 2012 | A1 |
20120072540 | Matsuzawa | Mar 2012 | A1 |
20120278584 | Nagami et al. | Nov 2012 | A1 |
20130046949 | Colgrove et al. | Feb 2013 | A1 |
20130145105 | Sawicki et al. | Jun 2013 | A1 |
20130246580 | Ozawa et al. | Sep 2013 | A1 |
20130290399 | Gordon | Oct 2013 | A1 |
20140040212 | Yochai et al. | Feb 2014 | A1 |
20140082145 | Lacapra | Mar 2014 | A1 |
20140115579 | Kong | Apr 2014 | A1 |
20140156719 | Leggette et al. | Jun 2014 | A1 |
20140173018 | Westphal et al. | Jun 2014 | A1 |
20140201425 | Clark et al. | Jul 2014 | A1 |
20140244937 | Bloomstein et al. | Aug 2014 | A1 |
20140317206 | Lomelino et al. | Oct 2014 | A1 |
20140330921 | Storm et al. | Nov 2014 | A1 |
20140337391 | Starovoitov et al. | Nov 2014 | A1 |
20150071123 | Sabaa | Mar 2015 | A1 |
20150110116 | Gong | Apr 2015 | A1 |
20150263978 | Olson et al. | Sep 2015 | A1 |
20150288680 | Leggette | Oct 2015 | A1 |
20160057224 | Ori | Feb 2016 | A1 |
20160072886 | Lin et al. | Mar 2016 | A1 |
20160072889 | Jung et al. | Mar 2016 | A1 |
20160094461 | Shetty et al. | Mar 2016 | A1 |
20160098225 | Huang | Apr 2016 | A1 |
20160112516 | Liu et al. | Apr 2016 | A1 |
20160132699 | Miller | May 2016 | A1 |
20160139838 | D'Sa | May 2016 | A1 |
Entry |
---|
Alba et al., “Efficient and Agile Storage Management in Software Defined Environments” 12 pages, IBM Journal of Research and Development, vol. 58, No. 2/3, Paper 5, Mar./May 2014. |
Xiang-Lin et al., “Performance Analysis of an iSCSI-based Unified Storage Network” pp. 1-7, Journal of Zhejiang University Science vol. 5, No. 1, Jan. 2004. |
Seshadri et al., “Software Defined Just-in-Time Caching in an Enterprise Storage System” 13 pages, IBM Journal of Research and Development, vol. 58, No. 2/3, Paper 7, Mar./May 2014 |
Number | Date | Country | |
---|---|---|---|
20160173598 A1 | Jun 2016 | US |