International Business Machines Corporation

Symantec Operating Corporation

Brocade Communications Systems, Inc.

Symantec Corporation

Globalfoundries Inc.

Veritas Technologies LLC

Veritas Operating Corporation

Symantec Operation Corporation

Subhojit Roy

Rahul M Fiske

Sarvesh S Patel

Carl Evan Jones

Kushal S Patel

Sandeep R Patil

Joseph S Hyde, Ii

Niranjan Sanjiv Pendharkar

Abhishek Jain

Akshat Mithal

Sasikanth Eda

Gaurav Chhaunker

Pankaj S Bavishi

Komal Shailendra Shah

Pankaj Deshpande

Mukul Kumar

Shrirang Shrikant Bhagwat

Pankaj Omprakash Khandelwal

Bharti Soni

Sapan J Maniyar

Kalyan Chakravarthy Gunda

Janmejay S Kulkarni

Shweta V Kulkarni

Naveen Maveli

Ankur Srivastava

Navin Kabra

Shrikant V Karve

Ashish Chaurasia

Anuj Chandra

Carlos Alonso

Manish Bansode

Tej Parkash

Ronald S Karr

Andrew Dale Walls

Riyazahamad Moulasab Shiraguppi

William James Scales

Anand A Kekre

Krishnasuri Narayanam

Deepak R Ghuge

Sachin Chandrakant Punadikar

Richard L Hammons

Venkeepuram R Satish

Manojkiran Eda

Prasad Limaye

Richard A Walter

Himanshu Ashwani

Rajat Toshniwal

Vikash Kumar

Prem Anand Ramanathan

Cirillo Lino Costantino

Ramani Ranjan Routray

Yang Song

Frank Krick

John Thomas Olson

Angshuman Bezbaruah

Pradipta Kumar Banerjee

Shailesh Marathe

Raghu Krishnamurthy

Anbazhagan Mani

Phani Kumar V U Ayyagari

Neeran Mohan Karnik

Lawrence Carter Blount

Dennis Hideo Makishima

Daniel Y Chung

Daniel Ji Yong Park Chung

Amitava Guha

Smita J Raut

Shahe Hagop Krakirian

L Vincent M Isip

Ashwin M Joshi

John Joseph Glen

Arun M Rokade

Shishir S Asgaonkar

Subhamay Barui

Tanmay Jayant Mujumdar

Michael Yiu-Wing Pong

Subbaro Arumilli

Stephen D Elstad

Puja Leekha

Abhishek Jaiswal

Rahul Rahul

Kanishka Keshav

Lokesh Arora

Ashish K Saxena

Pooja Sarda

Prasad K Dharap

A computer-implemented method, according to one approach, includes: sending a notification to a host regarding a first logical unit number (LUN) in response to receiving an indication that a first node will be taken offline. The first LUN that the notification is sent to has a preferred communication path that extends through the first node. Communication paths extending through the first node are blocked and communication paths extending through a second node are promoted. Moreover, in response to determining that existing I/O operations previously assigned to the first node have been completed, the first node is taken offline. I/O operations are thereby sent to the first LUN through the second node while the first node is offline.

Seamlessly implementing planned outages across network nodes

A computer-implemented method according to one embodiment includes causing a plurality of I/O queues to be created between an initiator and a storage target device. The created I/O queues are reserved for I/O requests for which adjustments of current priorities of extents of data associated with the I/O requests are to be performed. The method further includes determining identifying information of an I/O request sent from the initiator to the storage target device and determining whether the I/O request was sent from the initiator to the storage target device using one of the created I/O queues. In response to a determination that the I/O request was sent using a first of the created I/O queues having one of the adjustments associated therewith, a tiering manager of the storage target device is instructed to perform the adjustment on the current priority of the extent of data associated with the I/O request.

Data movement intimation using input/output (I/O) queue management

Described are techniques including a computer-implemented method that comprises defining a respective priority classification for each of a plurality of sockets used for communicating between an initiator computational system and a target computational system. The method further comprises automatically assigning a respective priority classification to each of a plurality of Input/Output (IO) requests based on a type of data associated with each IO request. The method further comprises sending the plurality of IO requests to respective sockets of the plurality of sockets with a matching priority classification.

Data traffic prioritization based on content

Described are techniques including a method comprising detecting a deallocated Input/Output (I/O) queue associated with a first entity in a Non-Volatile Memory Express (NVMe) storage system. The method further comprises broadcasting an Asynchronous Event Request (AER) message indicating I/O queue availability based on the deallocated I/O queue. The method further comprises allocating, in response to the AER message, a new I/O queue to a second entity in the NVMe storage system.

Input/output queue hinting for resource utilization

A computer-implemented method and a computer system for improving cached workload management. A host, which is in a system comprising the host and a storage system, obtains information about classes of applications accessing the storage system. The host determines input/output queues dedicated to respective ones of the classes. The storage system creates, in the storage system, cache partitions dedicated to the respective ones of the classes, based on information about classes. The host creates the input/output queues and sets bit flags for respective ones of the input/output queues. The host pumps inputs/outputs coming from the respective ones of the classes to the respective ones of the input/output queues. The storage system directs the input/output queues to respective ones of the cache partitions.

Cached workload management for a multi-tenant host

Disclosed are techniques for programmatically mapping workloads for storage in different classes of a networked computer data storage environment, using a set of rules or data storage hints and properties of the workloads themselves. With the set of data storage hints, metadata sets are assigned to files of the incoming workloads to the networked computer data storage environment based on the properties of the workloads. Then, a target storage class is determined for each file of the workload from the plurality of storage classes present in the networked computer data storage environment. The workload files are then mapped to a logical bucket that is associated with the plurality of storage classes through a shared namespace, with the assigned metadata set for a file cueing the filesystem modules as to which storage class within the logical bucket to direct the various files of the workload to.

Programmatically mapping workloads to networked object storage

In one embodiment, a method includes determining at least one characteristic of a plurality of ports on an individual basis. The plurality of ports are hosted by a target system and configured to send and receive data. The method also includes creating port groupings, each port grouping including one or more of the plurality of ports. Ports are grouped together in a single port grouping based on at least one shared characteristic of individual ports in the single port grouping. In addition, the method includes receiving, from an initiator port, a target discovery request at a target port of the plurality of ports. Also, the method includes determining which particular port grouping the target port belongs to. Moreover, the method includes sending information about all ports in the particular port grouping to the initiator port in response to receiving the target discovery request from the initiator port.

Storage target discovery in a multi-speed and multi-protocol ethernet environment

Described herein are techniques for managing replication in a data storage environment. The techniques including selectively compressing and selectively encrypting, by a production site, a set of files for replication from the production site to a remote site. Files can be selectively compressed based on a compression ratio satisfying a compression threshold, and files can be selectively encrypted based on a file content satisfying an encryption criteria. The techniques can further include updating, by the production site, metadata associated with selectively compressed files and updating metadata associated with selectively encrypted files. The techniques can further include replicating the set of files for replication from the production site to the remote site, the set of files for replication including the selectively compressed and the selectively encrypted files.

Selective compression and encryption for data replication

An approach for reducing disturbed errors in a flash memory device is disclosed. The approach includes collecting information associated with one or more; determining one or more frequently accessed data blocks from the one or more blocks based on the collected information; determining one or more neighboring blocks from the one or more blocks based on the collected information; determining if the one or more neighboring blocks exceeds a disturbance threshold; and in responsive to the one or more neighboring blocks has exceeded the disturbance threshold, re-align the one or more blocks.

Detect multifold disturbance and minimize read-disturb errors in NAND flash

Computer implemented methods for selective data deduplication in a multitenant environment are disclosed. Data deduplication of blocks written to a storage area associated with a tenant and redundant copies of the blocks written to other storage areas of other tenants is permitted or prevented based on tagging the first storage area associated with the tenant with a particular type of parameter. Responsive to detecting a write operation directed to the storage area tagged with a parameter indicating that deduplication is not permitted, a block to be written to the storage area is modified prior to hashing the block. Responsive to detecting a write operation directed to the storage area tagged with a parameter indicating that deduplication is permitted, a block to be written to the storage area is prevented from being modified prior to hashing the block.

Selective data deduplication in a multitenant environment

A computer-implemented method according to one embodiment includes identifying that a direct communications connection exists between a first device and a second device; and optimizing information transmitted between the first device and the second device over the direct communications connection.

Optimizing information transmitted over a direct communications connection

A method, computer system, and a computer program product for calculating bandwidth requirements is provided. The present invention may include receiving a recovery point objective (RPO). The present invention may also include simulating, using a virtual disk, a set of inter-site data transfers between a first data storage controller and a second data storage controller, wherein the second data storage controller is modelled by the virtual disk. The present invention may then include collecting a set of data correlating to a set of bandwidth factors, based on the simulated set of inter-site data transfers. The present invention may further include calculating, using the virtual disk, a bandwidth required for data replication for disaster recovery, based, at least in part, on the set of bandwidth factors and the RPO.

Calculating bandwidth requirements for a specified recovery point objective

A computer-implemented method according to one embodiment includes analyzing an image stored on a device. In response to determining that a storage consumption of the device is greater than a first predetermined threshold, content of the image that is both non-focused and that is not of interest is selectively compressed. In response to determining that the storage consumption subsequent to selectively compressing content of the image that is both non-focused and that is not of interest, is greater than a second predetermined threshold, content of the image that is both focused and that is not of interest is selectively compressed. In response to determining that the storage consumption subsequent to selectively compressing content of the image that is both focused and that is not of interest, is greater than the second predetermined threshold, content of the image that is both focused and that is of interest is selectively compressed.

Selective image compression of an image stored on a device based on user preferences

Disclosed is a computer implemented method to manage queue overlap in storage systems, the method comprising, identifying, by a storage system, a plurality of queues including a first queue and a second queue. The storage system includes a plurality of cores, including a first core and a second core, and wherein the first queue is associated with a first host and the second queue is associated with a second host. The method also comprises, determining the first queue and the second queue are being processed by the first core. The method further comprises, monitoring the workload of each cores and identifying a load imbalance, wherein the loam imbalance a difference between a first workload associated with the first core, and a second workload associated with the second core. The method also comprises, notifying the second host that the load imbalance is present.

Queue management in solid state memory

Growing community of inventors

Pune, India

Subhojit Roy