Patent Application
20160119422
1. Field of the Invention
The present invention relates to the in-memory storage of data in an application server and more particularly to supporting high availability while storing application related data in-memory in an application server.
2. Description of the Related Art
An application server is a software system executing upon a hardware platform that exposes business logic to client applications through various protocols such as the hypertext transfer protocol (HTTP). While a Web server mainly support the transmitting of hypertext markup language (HTML) defined pages to requesting browser clients for display in a browser, an application server provides access to business logic for use by client application programs. In this regard, the application program can use supplied business logic just as it would call a method on an object internally disposed on a supporting client device.
In most cases, an application server exposes its business logic through a component application programming interface (API) and the application server manages its own resources. Therefore, the application server also provides gate-keeping services including security, transaction processing, resource pooling, and messaging. The application server also must provide performance-enhancing services such as an in-memory store. Finally, like a Web server, an application server may also support scalability and fault-tolerance including high availability.
Advanced application servers provides for in-memory storing of data to support lightning fast data access. In-memory storing can be provided globally to all logic resources of the application server, or at the container level so as to support only a subset of the instances of logic resources in the application server. Recent advances in in-memory stores for application servers utilize direct memory access (DMA) techniques. One such technique includes remote DMA. In computing, remote direct memory access (RDMA) is a direct memory access from the memory of one computer into that of another without involving either one's operating system.
Thus, RDMA permits high-throughput, low-latency networking, which is especially useful in massively parallel computer clusters. RDMA supports zero-copy networking by enabling the network adapter to transfer data directly to or from application memory, eliminating the need to copy data between application memory and the data buffers in the operating system. Such transfers require no work to be done by the central processing units (CPUs), key-value stores, or context switches, and transfers continue in parallel with other system operations. When an application performs an RDMA Read or Write request, the application data is delivered directly to the network, reducing latency and enabling fast message transfer.
Distributed key/value pair store systems that exploit one-sided RDMA such as those found in an in-memory store engine of an application server can directly read from and write to the server's memory. This direct memory access is performed by utilizing RDMA between the network adapter of the server and the memory of the server without involving the CPU or CPUs of the server. Consequently, ultra high throughput and ultra low latency results. However, high availability remains an important problem for one-sided RDMA access. Because the server processor is not involved there are no software-level hooks for high availability replication, which leaves the key-value store vulnerable to hardware failures. Further, involving the server processor even minimally can cause dramatic performance degradation, measured in millions of requests per second. Therefore software-based high availability schemes are undesirable when seeking performance through RDMA supported in-memory stores.
Embodiments of the present invention address deficiencies of the art in respect to in-memory stores in an application server and provide a novel and non-obvious method, system and computer program product for RDMA optimized high availability for in-memory storing. In an embodiment of the invention, a method for RDMA optimized high availability for in-memory storing of data is provided. The method includes receiving RDMA key-value store write requests in a network adapter of a primary computing server directed to writing data to an in-memory key-value store of the primary computing server and performing RDMA write operations of the data by the network adapter of the primary computing server responsive to the RDMA key-value store write requests. The method also includes replicating the RDMA key-value store write requests to a network adapter of a secondary computing server, by the network adapter of the primary computing server. Finally, the method includes providing address translation data for the in-memory key-value store of the primary computing server from the network adapter of the primary computing server to the network adapter of the secondary computing server.
In one aspect of the embodiment, in response to a determination that the primary computing server has failed, an RDMA key-value store read request is received from a requesting client in the network adapter of the secondary computing server in respect to data stored in the in-memory key-value store of the primary computing server. Thereafter, because there are no guarantees that the data in the primary and secondary computing servers are written into the same address in both servers, an address for the data stored in the in-memory key-value store of the primary computing server is translated to an address in an in-memory key-value store of the secondary computing server utilizing the address translation data and an RDMA key-value store read operation is performed at the translated address. Finally, the data produced by the RDMA key-value store read operation is returned by the network adapter of the secondary computing server to the requesting client. Optionally, a local address table of the network adapter of the secondary computing server is translated based upon the address translation data all subsequent RDMA key-value store requests for data in the in-memory key-value store of the primary computing server are processed in the network adapter of the secondary computing server utilizing the translated local address table.
In another aspect of the embodiment, an RDMA key-value store update request is received in the network adapter of the primary computing server directed to data stored in the in-memory key-value store of the primary computing server. Thereafter, in response to the RDMA key-value store update request, an RDMA key-value store update operation is performed on the stored data by the network adapter of the primary computing server. As before, the RDMA key-value store update request is replicated to the network adapter of the secondary computing server, by the network adapter of the primary computing server and the addressing for the stored data in the in-memory key-value store of the primary computing server is translated to an address in an in-memory key-value store of the secondary computing server utilizing the address translation data. Finally, the stored data is updated in the in-memory key-value store of the secondary server utilizing the translated addressing.
In another embodiment of the invention, an application server data processing system is configured for RDMA optimized high availability for in-memory storing. The system includes a primary computing server with a corresponding in-memory key-value store and at least one processor and network adapter, and also a secondary computing server with a corresponding in-memory key-value store and at least one processor and a network adapter. The system also includes an RDMA optimized high availability module disposed in each of the network adapters. The module includes program code enabled to receive RDMA key-value store write requests in the network adapter of a primary computing server directed to writing data to the in-memory key-value store of the primary computing server, to perform RDMA write operations of the data by the network adapter of the primary computing server responsive to the RDMA key-value store write requests, to replicate the RDMA key-value store write requests to the network adapter of the secondary computing server, by the network adapter of the primary computing server, and to provide address translation data for the in-memory key-value store of the primary computing server from the network adapter of the primary computing server to the network adapter of the secondary computing server.
Additional aspects of the invention will be set forth in part in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The aspects of the invention will be realized and attained by means of the elements and combinations particularly pointed out in the appended claims. It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed.
The accompanying drawings, which are incorporated in and constitute part of this specification, illustrate embodiments of the invention and together with the description, serve to explain the principles of the invention. The embodiments illustrated herein are presently preferred, it being understood, however, that the invention is not limited to the precise arrangements and instrumentalities shown, wherein:
Embodiments of the invention provide for RDMA optimized high availability for in-memory storing. In accordance with an embodiment of the invention, each RDMA key-value store write request received in a network adapter of a primary computing server to perform an RDMA write operation of data to an in-memory key-value store defined in the memory of the primary server, can be replicated to a network adapter of a secondary computing server. Further, address translation data for the in-memory key-value store of the primary computing server can be provided to the network adapter of the secondary computing server. In this way, during failover from the primary server to the secondary server, access to the data of the in-memory key-value store in the memory of the secondary server can continue as if it were the in-memory key-value store in the memory of the primary server without requiring intervention of the CPU of the primary server.
In further illustration,
Initially, the client 150 can issue an RDMA write request 190A to the primary server 110A to write data to the in-memory key-value store 120A. The optimization logic 140 can direct the network adapter 130A to perform the RDMA write operation for the data and the network adapter 130A can return addressing data 160 to the client 150, including an address of the data in the in-memory key-value store 120 and an address of the secondary server 110B. Further, the optimization logic 140 can replicate the RDMA write request 190A to the network adapter 130B along with address translation data 170 indicating the address in the in-memory key-value store 120A at which the data is stored. The optimization logic 140 in the secondary server 110B can process the replicated RDMA write request 190A and can determine a delta between the address translation data 170 and the address at which the data of the replicated RDMA write request 190A has been stored in the in-memory key-value store 120B.
Thereafter, RDMA update requests replicated by the optimization logic 140 from the network adapter 130A of the primary server 110A to the network adapter 130B of the secondary server 110B can be processed by translating the address of the RDMA update request utilizing the delta before directing an RDMA update for the data in the in-memory key-value store 120B. Of note, the client 150 can store a local hash map that for each key stored therein in respect to data stored in one of the servers 110A, 110B contains a remote pointer (i.e. address) to the data corresponding to the key in the primary server 110A. As such, the client upon failover to the secondary server 120 may access the in-memory key-value store 120B of the secondary server 110B directly using the remote pointers/addresses of the local hash map.
To that end, the client 150 repeatedly can issue to the primary server 110A RDMA read requests for data disposed at respective addresses of the primary server 110A. However, to the extent that the primary server 110A becomes non-responsive, the client 150 utilizing the address of the secondary server 110B can issue a failover RDMA read request 190B to the secondary server with the address of the requested data. The optimization logic 140 in turn can translate the address of the data to a corresponding address in the in-memory key-value store 120B utilizing the delta between addresses in the in-memory key-value store 120A and the in-memory key-value store 120B. Using the translated address the optimization logic 140 can direct the network adapter 130B to perform an RDMA read operation at the translated address and the network adapter 130B can return the retrieved data 180 at the translated address to the client 150. Optionally, a local translation table maintained in the client 150 can be translated in response to a failover with the delta so as to issue subsequent RDMA read requests and update requests to the secondary server 110 with an already translated address.
The process described in connection with
Importantly, an optimization module 300 can be included as part of the network adapter firmware of each of the application servers 210A, 210B. The optimization module 300 can include program code that when executed in the memory of the application servers 210A, 210B is enabled to receive an RDMA write request for data from a client 260. The program code further can be enabled to direct the network adapter 220A to perform an RDMA write operation in the in-memory key-value store 230A resulting in an address at which the data is stored in the in-memory key-value store 230A. The program code yet further can replicate the RDMA write request for the data to the network adapter 220B with the address such that the network adapter 220B can perform an RDMA write operation of the data into the in-memory key-value store 230 resulting in an address at which the data is stored in the in-memory key-value store.
Utilizing the address received from the optimization logic 300 of the network adapter 220A, the optimization logic 300 of the network adapter 220B can determine a delta between the addresses acting as address translation data. Finally, the program code can return not only the address of the data in the in-memory key-value store 230A to the client, but also the program code can return to the client 260 the address of the secondary application server 210B in the event of a failure of the primary application server 210A. In this regard, in response to a failure of the primary application server 210A, the client 260 can issue an RDMA read request to the secondary application server 210B with the address of the sought after data in the in-memory key-value store 230A. Using the delta, the network adapter 220B can translate the address to a valid address in the in-memory key-value store 230B and the network adapter 220B can retrieve the sought after data in the in-memory key-value store 230B.
In even yet further illustration of the operation of the optimization module 300,
Turning now to
In this regard, as shown in
Referring now to
The present invention may be embodied within a system, a method, a computer program product or any combination thereof. 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.
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 invention. 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.
Finally, the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
Having thus described the invention of the present application in detail and by reference to embodiments thereof, it will be apparent that modifications and variations are possible without departing from the scope of the invention defined in the appended claims as follows:
