Hewlett Packard Enterprise Development LP

Sap Se

Jonathan Stewart

Siamak Nazari

Jin Wang

Mark Doherty

Srinivasa D Murthy

Roopesh Kumar Tamma

Benoit Hudzia

Richard Dalzell

Jordan Snodgrass

Paul Kinnaird

Peter Hynes

Pierre Labat

Jonathan Sinclair

Timothy Silversides

Jean-Noel Gonzalez De Linares

Methods and systems for collision handling during an asynchronous replication are provided. A system includes a cache memory system comprising a number of cache memory pages. A collision detector detects when a host is attempting to overwrite a cache memory page that has not been completely replicated. A revision page tagger copies the cache memory page to a free page and tags the copied page as protected.

Collision handling during an asynchronous replication

Example implementations relate to managing concurrently received configuration requests in a computing network that includes a set of configurable network entities. IN an example, a plurality of configuration requests are received concurrently and a separate database transaction is opened in a configuration database for each received configuration request. A plurality of configuration deltas are identified, each of the plurality of configuration deltas representing a change in a configuration of a network entity of the computing network requested by one of the plurality of received configuration requests. An existing configuration of the network entity is obtained from the configuration database and the existing configuration of the network entity is modified using the identified configuration deltas to generate a provisioning request for the network entity. The provisioning request is issued to the network entity to implement the changes in the configuration of the network entity requested by the received configuration requests, and following successful completion of the provisioning request by the network entity, the database transaction for each received configuration request is committed.

Managing concurrently received configuration requests in a computing network

Examples include transaction management for a multi-node cluster. Some examples include generating a request log entry at an owner node that identifies a duplicate data location, tagging the duplicate data location with a requested tag, and issuing a zero-copy request that identifies the duplicate data location. In some such examples, a service node may generate a service log entry based on the zero-copy request that identifies the duplicate data location, process the zero-copy request, and tag the duplicate data location with a serviced tag. A determination may be made as to whether at least one of the owner node and the service node have failed and based on the determination that at least one has failed, the failed node may be recovered via at least one of the requested tag and the serviced tag of the duplicate data location.

Transaction management for multi-node clusters

A system that includes a storage volume comprising a plurality of regions. The system also includes a plurality of nodes to receive transactions related to the storage volume from one or more client computers and execute the transactions. Each node is designated as an owner of one region of the plurality of regions. Each one of the plurality of nodes includes a ticket dispenser for dispensing tickets that ensure that the transactions that are actively being executed have exclusive access to a storage object identified in the transaction.

Storage system transactions

Implementations of the present disclosure are directed to enabling data transfer between data producers and data consumers. Implementations include generating a data structure, the data structure including a lockless spin buffer (LLSB), the LLSB including two or more lockless components, each of the two or more lockless components including a plurality of elements to be written to and read from, providing one or more write pointers to enable one or more data producers to write to each of the two or more lockless components, and providing one or more read pointers to enable one or more data consumers to read from each of the two or more lockless components, the one or more data producers being able to write to the LLSB concurrently with the one or more data consumers being able to read from the LLSB.

Lockless spin buffer

Growing community of inventors

Belfast, United Kingdom

Jonathan Stewart