International Business Machines Corporation

John Michael Marberg

Frank Bernhard Schmuck

James Christopher Wyllie

Irit Loy

Roger Lee Haskin

Boaz Shumeli

Robert J Curran

Zvi Yosef Yehudai

Julian Satran

Kenneth Nagin

Simona Cohen

Tsipora P Barzilai

Brent Alan Miller

Alain Charles Azagury

Boaz Shmueli

Dafna Sheinwald

Danny Dolev

Uri Shani

Ealan Abraham Henis

James Gregory Ranweiler

Neta Jacob Amit

German Goft

Systems and methods for remotely provisioning software to process data stored in a virtualized storage environment are provided. In one embodiment, the method comprises receiving a request, at a first location, for processing data using a software application, wherein the data is stored in a virtualized storage space at a second location and the software application is invoked in a virtualized computing environment at a third location; using a service at the first location to remotely invoke one or more instances of the software application over the virtualized computing environment at the third location; and using the service at the first location to remotely manage transfer of data stored in the virtualized storage space at the second location to the third location.

Remote provisioning of virtual appliances for access to virtualized storage

Machines, systems and methods for dynamically implementing storlets in a storage data path. The method comprises receiving a request to perform a storage-related function on data stored on a first data storage medium in a data storage system; verifying the request by way of an authentication and authorization mechanism to prevent unauthorized access to data stored on the first data storage medium in the data storage system; and utilizing a storlet to service the request, wherein the storlet is dynamically deployed on a node in the data storage system such that the node has sufficient resources to support the storlet to service the request.

Dynamic storlets in storage system data path

An initiator node adapted to provide quality of service (QoS) for an Internet Small Computer System Interface (iSCSI) environment is provided. The initiator node including an iSCSI initiator comprising a QoS shaper, the QoS shaper for shaping one or more Protocol Data Units (PDUs) according to QoS policies and providing shaped PDUs, and a Transmission Control Protocol (TCP) layer for receiving the shaped PDUs from the iSCSI initiator and comprising a QoS marker for marking the shaped PDUs according to the QoS policies, wherein the PDUs are command PDUs and wherein the shaper shapes the command PDUs before the command PDUs receive command sequence numbers.

Quality of service for iSCSI

A method for providing quality of service (QoS) for an Internet Small Computer System Interface (iSCSI) environment is presented. The method includes the steps of shaping one or more Protocol Data Units (PDUs) in an iSCSI initiator according to QoS policies, and marking in a Transmission Control Protocol (TCP) layer at an initiator node the shaped PDUs according to the QoS policies, and wherein the PDUs are command PDUs, wherein the shaping of the command PDUs occurs before assigning command sequence numbers to said command PDUs.

In a cluster of computing nodes having shared access to one or more volumes of data storage using a parallel file system, a method for managing the data storage includes initiating a data management application in the cluster using a data management application programming interface (DMAPI) of the parallel file system. When a request submitted to the parallel file system is received on one of the nodes to perform an operation on a file in one of the volumes of data storage, a data management access right is obtained from the DMAPI responsive to the request The operation is performed on the file using the access right.

Implementing data management application programming interface access rights in a parallel file system

In a cluster of computing nodes having shared access to one or more volumes of data storage using a parallel file system, a method for managing the data storage includes selecting a first one of the nodes to serve as a session manager node, and selecting a second one of the nodes to serve as a session node for a data management application. A session of the data management application is created on the session node by sending a message from the session node to the session manager node, causing the session manager node to distribute information regarding the session among the nodes in the cluster. Responsive to the information distributed by the session manager node, events are received at the session node from the nodes in the cluster for processing by the data management application.

Data management application programming interface session management for a parallel file system

In a cluster of computing nodes having shared access to one or more file systems in data storage using parallel file system software, a method for managing the data storage includes initiating a session of a data management application on a first one of the nodes, while running a user application on a second one of the nodes. A request is submitted to the parallel file system software by the user application on the second node to mount one of the file systems in the data storage. A mount event message is sent from the second node to the first node responsive to the request, for processing by the data management application on the first node. When the file system is to be unmounted, preunmount and unmount events are sent for processing by the data management application on the first node.

Data management application programming interface handling mount on multiple nodes in a parallel file system

In a cluster of computing nodes having shared access to one or more volumes of data storage using a parallel file system, a method for managing the data storage includes initiating a session of a data management application on a session node selected from among the nodes in the cluster. The session node receives an event message in a session queue for processing by the data management application, responsive to a request submitted to the parallel file system by a source node among the nodes in the cluster to perform a file operation on a file in the data storage. Following a failure at the session node, the session queue is reconstructed so that processing of the event message by the data management application can continue after recovery from the failure, and the request can be fulfilled at the source node.

Data management application programming interface failure recovery in a parallel file system

In a cluster of computing nodes having shared access to one or more volumes of data storage using a parallel file system, a method for managing the data storage includes initiating a session of a data management application on a first one of the nodes, while running a user application on a second one of the nodes. A request is submitted to the parallel file system by the user application on the second node to perform a file operation on a file in one of the volumes of data storage. A data management event message is sent from the second node to the first node responsive to the request, for processing by the data management application on the first node.

Data management application programming interface for a parallel file system

A computer system such as a mobile client system in which provision is made for management of flash memory. Flash memory management is done using variable block length and supports data compression. Blocks are allocated contiguously in each erase unit and each block starts with a header that contains the length of the block. Blocks are tracked using a single-level virtual address map which resides in random access memory (RAM). The mobile computer system may also include a housing, processor, random access memory, display and an input digitizer such as a touchscreen.

Mobile client computer system with flash memory management utilizing a

In a resilient database system which includes a journaled database which is implemented at one or more locations within a distributed data processing system, multiple diverse consistency levels are specified which each detail a level of consistency to be maintained between a primary database and a replica database. A user is then permitted to select a particular level of consistency for each replica database. Thereafter, each update to a record within the primary database is utilized to initiate an update to the corresponding record within each replica database in a manner which is consistent with the selected level of consistency for that replica database. In this manner, a replica database which is fully consistent with the primary database may be provided for seamless switchover in the event of a primary database failure, while a second replica database may be provided to respond to queries by applications which do not require fully consistent data, greatly enhancing the efficiency of access to that database.

Method and system for selectable consistency level maintenance in a

A multi-processor computer system executes a single-thread program having a plurality of callable procedures. The local memory of each processor contains a program stack, the object code of each procedure that executes on that processor, and an agent object. In addition, the local memory contains a c-stub module for each procedure executable on a different processor, and a s-stub module for each local procedure that can be called by a remote procedure. When a procedure P1 executing on processor A calls a procedure P2 which executes in processor B, it issues a local call to P2's c-stub in processor A's local memory. The P2 c-stub then invokes the agent process in processor A, which communicates with a corresponding agent process in processor B. The agent process in processor B causes P2's s-stub in processor B to issue a local call to procedure P2. The return from a procedure follows the same path in reverse. Each processor independently maintains its own version of the program stack, with stack entries referencing the locally executable procedures, local stubs, or local agents. As a result, remote procedure calls are not constrained by the past calling history of a process. A procedure P1 in processor A may call a procedure P2 in processor B, which may in turn call another procedure P3 in processor A. It is therefore possible to convert a conventional single-thread program for operation on a multi-processor system without any significant modification to the source code.

Growing community of inventors

Haifa, Israel

John Michael Marberg