Netapp, Inc.

Kiran Nenmeli Srinivasan

Garth Richard Goodson

Prashanth Radhakrishnan

Kishore Kasi Udayashankar

Swetha Krishnan

Sai Susarla

Kaladhar Voruganti

Shankar Pasupathy

Randy Thelen

Dnyaneshwar Nagorao Pawar

Alok Sharma

Timothy Clayton Bisson

Rajesh Khandelwal

Kartik Rathnakar

Randal Thelen

Mukul Sharma

Tijin George

Atul Ramesh Pandit

Gokul Soundararajan

Shravan Gaonkar

Lakshmi Narayanan Bairavasundaram

Vipul Mathur

Sharankumar Yelheri

Venkateswarlu Tella

Sumeeth Channaveerappa Kyathanahalli

Jeffrey David Prem

Sudhindra Tirupati Nagaraj

Suli Yang

Venkateswarlu Telia

Jingxin Feng

Scott Dawkins

Techniques are provided for on-demand creation and/or utilization of containers and/or serverless threads for hosting data connector components. The data connector components can be used to perform integrity checking, anomaly detection, and file system metadata analysis associated with objects stored within an object store. The data connector components may be configured to execute machine learning functionality to perform operations and tasks. The data connector components can perform full scans or incremental scans. The data connector components may be stateless, and thus may be offlined, upgraded, onlined, and/or have tasks transferred between data connector components. Results of operations performed by the data connector components upon base objects may be stored within sibling objects.

Containerization and serverless thread implementation for processing objects

A system and method for global data de-duplication in a cloud storage environment utilizing a plurality of data centers is provided. Each cloud storage gateway appliance divides a data stream into a plurality of data objects and generates a content-based hash value as a key for each data object. An IMMUTABLE PUT operation is utilized to store the data object at the associated key within the cloud.

Technique for global deduplication across datacenters with minimal coordination

One or more techniques and/or computing devices are provided for inline deduplication. For example, a checksum hash table and/or a block number hash table may be maintained within memory (e.g., a storage controller may maintain the hash tables in-core). The checksum hash table may be utilized for inline deduplication to identify potential donor blocks that may comprise the same data as an incoming storage operation. Data within an in-core buffer cache is eligible as potential donor blocks so that inline deduplication may be performed using data from the in-core buffer cache, which may mitigate disk access to underlying storage for which the in-core buffer cache is used for caching. The block number hash table may be used for updating or removing entries from the hash tables, such as for blocks that are no longer eligible as potential donor blocks (e.g., deleted blocks, blocks evicted from the in-core buffer cache, etc.).

Inline deduplication

Methods and systems for an object based storage are provided. As an example, a method for generating a metadata object for an archive data container having a plurality of data containers is disclosed. The method includes generating a first metadata signature for the archive data container using an archive data container identifier, a number of data containers within the archive data container, and placement information of each data container within the archive data container; assigning a plurality of blocks for storing data for the plurality of data containers at an object based storage to an intermediate logical object; updating a payload signature with placement information of the plurality of blocks within the intermediate logical object; and placing the first metadata signature and the updated payload signature within the metadata object, wherein the metadata object is used to retrieve location information for a specific data container within the archive data container.

Methods and systems for restoring a data container archived at an object-based storage

Fault isolation capabilities made available by user space can be provided for a embedded network storage system without sacrificing efficiency. By giving user space processes direct access to specific devices (e.g., network interface cards and storage adapters), processes in a user space can initiate Input/Output requests without issuing system calls (and entering kernel mode). The multiple user spaces processes can initiate requests serviced by a user space device driver by sharing a read-only address space that maps the entire physical memory one-to-one. In addition, a user space process can initiate communication with another user space process by use of transmit and receive queues similar to transmit and receiver queues used by hardware devices. And, a mechanism of ensuring that virtual addresses that work in one address space reference the same physical page in another address space is used.

System and method for achieving high performance data flow among user space processes in storage systems

The disclosed technique uses virtual machines in solving a problem of persistent state for storage protocols. The technique provides for seamless, persistent, storage protocol session state management on a server, for higher availability. A first virtual server is operated in an active role in a host system to serve a client, by using a stateful protocol between the first virtual server and the client. A second, substantially identical virtual server is maintained in a passive role. In response to a predetermined event, the second virtual server takes over for the first virtual server, while preserving state for a pending client request sent to the first virtual server in the stateful protocol. The method can further include causing the second virtual server to respond to the request before a timeout which is specific to the stateful protocol can occur.

Seamless takeover of a stateful protocol session in a virtual machine environment

A method, non-transitory computer readable medium, and device that prefetchs includes identifying a candidate data block from one of one or more immediate successor data blocks. The identified candidate data block has a historical access probability value from an initial accessed data block which is higher than a historical access probability value for each of the other immediate successor data blocks and is above a prefetch threshold value. The identifying is repeated until a next identified candidate data block has the historical access probability value below the prefetch threshold value. In the repeating, the identifying next immediate successor data blocks is from the previously identified candidate data block and the historical access probability value for each of the next immediate successor data blocks is determined from the originally accessed data block. The identified candidate data block with the historical access probability value above the prefetch threshold value is fetched.

Methods for combining access history and sequentiality for intelligent prefetching and devices thereof

A novel technique for improving throughput in a multi-core system in which data is processed according to a producer-consumer relationship by eliminating latencies caused by compulsory cache misses. The producer and consumer entities run as multiple slices of execution. Each such slice has an associated execution context that comprises of the code and data that particular slice would access. The execution contexts of the producer and consumer slices are small enough to fit in the processor caches simultaneously. When a producer entity scheduled on a first core completed production of data elements as constrained by the size of cache memories, a consumer entity is scheduled on that same core to consume the produced data elements. Meanwhile, a second slice of the producer entity is moved to another core and a second slice of a consumer entity is scheduled to consume elements produced by the second slice of the producer.

Effective scheduling of producer-consumer processes in a multi-processor system

Systems and methods which provide for improved prefetching schemes for caching data in a storage network are described. In one embodiment, a dynamically adaptive prefetching mechanism based on block access history information and prior effectiveness of prefetching is provided. Embodiments may take into account prefetch efficiency; a dynamic value indicating the usefulness of past prefetches, prefetch wastage, in conjunction with prefetch resources available at any point in time, to determine the number of blocks to read-ahead during a prefetch. Such embodiments provide improvements over file-based prefetching and previous block schemes, as they provide a finer grain of control over both prefetch block selection, and the number of blocks to prefetch based on block (or block range) access history.

Systems and methods for adaptive prefetching

Growing community of inventors

Sunnyvale, CA, United States of America

Kiran Nenmeli Srinivasan