International Business Machines Corporation

Guy Laden

Michael Edward Factor

Paula Kim Ta-Shma

Gregory Chockler

Benjamin Michael Parees

Shmuel Ben-Yehuda

Yoav Tock

Ymir Vigfusson

Shachar Fienblit

Roie Melamed

Eran Gampel

Renato John Recio

Aviad Zlotnick

Yacov Manevich

Vita Bortnikov

Idan Zach

Dean Har'el Lorenz

Marc Cochran

Benjamin Mandler

Shlomit Sarah Pinter

Gal Sagi

Liran Schour

Bruno Wassermann

Eli Luboshitz

Ýmir Vigfússon

Claude Basso

A computer-implemented method for distributing packets for asymmetrical traffic by a network interface card (NIC). The computer-implemented method includes obtaining information of an incoming packet incoming from a source endpoint behind a stateful service and accessing a destination endpoint using a network address translation (NAT) service, hashing the information to calculate queue identification for the packet to direct the packet to the queue associated therewith, executing a NAT on an outgoing packet associated with the incoming packet to allow for retrieval of the queue identification from a header of the outgoing packet, sending the outgoing packet to the destination endpoint, which is responsive with a return packet, stamping the queue identification to the return packet upon the return packet being transmitted back from the destination endpoint and the queue identification being retrieved and instantiating an RSS override operation to redirect the return packet to the queue on the response.

Symmetric receive-side scaling (RSS) for asymmetric flows

A system, method, and computer program product for implementing network state processing is provided. The method includes detecting operational states for ports of a server Internet protocol (IP) data plane component of an integrated switching device. Each operational state is analyzed and matching and action rules associated with the operational states are generated with respect to data packets arriving at the ports. Data describing each operational state is stored within a port cache structure of a port. An incoming data packet is detected at a first port and the matching and action rules are distributed between port engines of the ports. The matching and action rules are executed with respect to the incoming data packet and the incoming data packet is transmitted to a destination port. Operational functionality of the integrated switching device is enabled with respect to execution of the incoming data packet at the destination port.

Integrated network switch operation

Embodiments of the present systems and methods may provide the capability to monitor and detect failure of nodes in a data center environment by using a software defined failure detector that can be adjusted to varying conditions and data center topology. In an embodiment, a computer-implemented method for monitoring and detecting failure of electronic systems may comprise, in a system comprising a plurality of networked computer systems, defining at least one failure detection agent to monitor operation of other failure detection agents running on at least some of the electronic systems, and defining, at the controller, and transmitting, from the controller, topology information defining a topology of the failure detection agents to the failure detection agents, wherein the topology information includes information defining which failure detection agents each failure detection agent is to monitor.

Software defined failure detection of many nodes

Embodiments of the present invention provide a means for managing portable Internet Protocol (IP) addresses and virtual machine persistent storage. The invention includes defining a set of available portable IP addresses. When a request for a portable IP address is received from a first virtual machine (VM), a first portable IP address is assigned to the first VM. The assignment of the first portable IP address to the first VM extends for a predetermined amount of time and requires a lease renewal to extend the assignment.

Management of clustered and replicated systems in dynamic computing environments

When a request is received to perform a data operation requiring an interaction with any one of multiple data replicas stored on one or more data storage devices and managed by a quorum-based data management protocol in which completion of a data update is reported to an initiator of the data update when acceptance of the data update is reported by a majority of the data replicas, the data operation is routed to be performed using one of a predefined minority of the data replicas if the data operation requires less than strong consistency, is a read-only data operation, and meets a predefined criterion of being computationally time-intensive or computationally resource-intensive, or routed to be performed using a predefined majority of the data replicas if the data operation requires strong consistency or requires a data write operation or does not meet the predefined criterion.

Managing data operations in a quorum-based data replication system

A computerized method for dynamic consistency management of server side cache management units in a distributed cache, comprising: updating a server side cache management unit by a client; assigning each of a plurality of server side cache management units to one of a plurality of propagation topology groups according to an analysis of a plurality of cache usage measurements thereof, each of said propagation topology groups is associated with a different write request propagation scheme; and managing client update notifications of members of each of said propagation topology groups according to the respective said different write request propagation scheme which is associated therewith.

Utility-based invalidation propagation scheme selection for distributed cache consistency

Cache optimization. Cache access rates for tenants sharing the same cache are monitored to determine an expected cache usage. Factors related to cache efficiency or performance dictate occupancy constraints. A request to increase cache space allocated to a first tenant is received. If there is a second cache tenant for which reducing its cache size by the requested amount will not violate the occupancy constraints for the second cache tenant, its cache is decreased by the requested amount and allocated to satisfy the request. Otherwise, the first cache size is increased by allocating the amount of data storage space to the first cache tenant without deallocating the same amount of data storage space allocated to another cache tenant from among the plurality of cache tenants.

Allocation enforcement in a multi-tenant cache mechanism

Systems and methods for cache optimization are provided. The method comprises monitoring cache access rate for a plurality of cache tenants sharing same cache mechanism having an amount of data storage space, wherein a first cache tenant having a first cache size is allocated a first cache space within the data storage space, and wherein a second cache tenant having a second cache size is allocated a second cache space within the data storage space. The method further comprises determining cache profiles for at least the first cache tenant and the second cache tenant according to data collected during the monitoring; analyzing the cache profiles for the plurality of cache tenants to determine an expected cache usage model for the cache mechanism; and analyzing the cache usage model and factors related to cache efficiency or performance for the one or more cache tenants to dictate one or more occupancy constraints.

A system for communicating information among a plurality of nodes of a network. The system comprises a plurality of disseminating modules installed in a plurality of nodes of a network which hosts a plurality of replicas of data having a plurality of objects, each the disseminating module has access to a dataset defining a plurality of write request dissemination topologies. Each disseminating module is defined to receive a write request from a client, to select dynamically one of the write request dissemination topologies according to at least one parameter of the client, and to disseminate the write request according to the selected write request dissemination topology.

Adaptive and dynamic replication management in cloud computing

Systems and methods for cache optimization, the method comprising monitoring cache access rate for one or more cache tenants in a computing environment, wherein a first cache tenant is allocated a first cache having a first cache size which may be adjusted; determining a cache profile for at least the first cache over one or more time intervals according to data collected during the monitoring, analyzing the cache profile for the first cache to determine an expected cache usage model for the first cache; and analyzing the cache usage model and factors related to cache efficiency for the one or more cache tenants to dictate one or more constraints that define boundaries for the first cache size.

Cache optimization via predictive cache size modification

A method for managing data, the method includes: providing a write-back cache unit coupled to at least one storage unit; receiving a request to write a new data version to a certain cache data allocation unit; determining, in response to a data storage policy, whether to overwrite a cached data version being cached in the certain cache data allocation unit or to perform a destage of the cached data version to a first storage unit before writing the new data version to the certain cache allocation unit; receiving a request to read a data version that corresponds to a certain point in time and scanning a first data structure representative of write operations and a second data structure representative of revert operations to determine a location of the requested data version.

System, method and computer program product for managing data using a write-back cache unit

A method, system and computer program product for storing transient state information, the method includes: defining a first logical storage space within at least one storage device in response to at least one characteristic of a processing system logical memory space utilized for storing current transient state information of the processing system; repetitively storing current transient state information at a logical location within the first logical storage space that corresponds to a logical location of the current transient state information within the processing system logical memory space and storing, within a second logical storage space, previous transient state information.

System, method and computer program product for storing transient state information

A method for storing an information block that includes determining to store a current version of an information block stored in a memory unit. The checking if a current version of the information is already stored in a storage unit. The current version of the information block is sent from the memory unit to the storage unit if the answer is negative. Generating storage unit location information indicative of a location, at the storage unit, of the current version of the information block if the answer is positive.

System, method and computer program product for storing an information block

A method and computer readable product for managing data, the method includes: providing a first data structure representative of insert or update operations to entries identified by keys and providing a second data structure representative of branch creation operations wherein the second data structure stores branch identifiers and branch timing information; receiving a request to lookup a version of data at a read timestamp; scanning the first and the second data structures to locate that version of data; and receiving a request to create a branch that starts by a version of data at a requested timestamp and updating the second data structure accordingly.

Growing community of inventors

Jaffa, Israel

Guy Laden