Patents by Inventor Suhas Prakash
Suhas Prakash has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10999397Abstract: Described herein is a system and method for performing a clustered coherent cloud read cache without coherency messaging. At a cloud reader agent having a read cache, a request for a particular portion of data is received from a client. The request includes an identifier of the node making the request, a current time on the node making the request, a last stubbed time of the particular portion of data, and/or an identifier of the particular portion of data. When the particular portion of data is stored in the read cache of the cloud reader agent, the cloud reader agent can determine whether the cached particular portion of data is valid based, at least in part, upon the received identifier of the node making the request, the received last stubbed time of the particular portion of data, and/or, a stored time associated with the cached particular portion of data.Type: GrantFiled: July 23, 2019Date of Patent: May 4, 2021Assignee: Microsoft Technology Licensing, LLCInventors: Richard Paul Testardi, Cameron Michael Hall, Suhas Prakash, Ernie Pistor
-
Publication number: 20210029213Abstract: Described herein is a system and method for performing a clustered coherent cloud read cache without coherency messaging. At a cloud reader agent having a read cache, a request for a particular portion of data is received from a client. The request includes an identifier of the node making the request, a current time on the node making the request, a last stubbed time of the particular portion of data, and/or an identifier of the particular portion of data. When the particular portion of data is stored in the read cache of the cloud reader agent, the cloud reader agent can determine whether the cached particular portion of data is valid based, at least in part, upon the received identifier of the node making the request, the received last stubbed time of the particular portion of data, and/or, a stored time associated with the cached particular portion of data.Type: ApplicationFiled: July 23, 2019Publication date: January 28, 2021Applicant: Microsoft Technology Licensing, LLCInventors: Richard Paul TESTARDI, Cameron Michael HALL, Suhas PRAKASH, Ernie PISTOR
-
Patent number: 10394660Abstract: A snap restore technique efficiently restores snapshots of storage containers served by a storage input/output (I/O) stack executing on one or more nodes of a cluster. A Small Computer Systems Interface administration layer interacts with a volume layer of the storage I/O stack to manage and implement a snap restore procedure to restore one or more snapshots of a storage container. The storage container may be a logical unit (LUN) embodied as parent volume (active volume) and the snapshot may be represented as an independent volume embodied as read-only copy of the active volume. The snap restore procedure may be configured to allow restoration to a single snapshot of a LUN or restoration of a plurality of LUNs organized as a consistency group from a group of snapshots.Type: GrantFiled: July 31, 2015Date of Patent: August 27, 2019Assignee: NetApp, Inc.Inventors: David Brittain Bolen, Suhas Prakash, Anshul Pundir, Ling Zheng
-
Patent number: 9754323Abstract: Methods, systems, and computer-readable media for providing a rule based exchange simulator are presented. A plurality of rules may be received at an exchange simulator that define how orders should be processed at the exchange simulator. The received rules may be stored, for instance, at a rules engine. For example, rules may comprise a fill rule, a cancel rule, a reject rule, a no acknowledgment rule, and a market data rule. An order that comprises a stock exchange order may be received at the exchange simulator. For example, an order may comprise a buy or sell order for a particular instrument, such as a stock, and may comprise a particular quantity. Based on the one or more rules stored in the rules engine, the received order may be fully filled, partially filled, or not filled.Type: GrantFiled: July 16, 2013Date of Patent: September 5, 2017Assignee: Bank of America CorporationInventors: Rehman Ahmed Khan, Srinivasa Rao Aravala, Suhas Prakash Shahapurkar
-
Patent number: 9740566Abstract: A technique efficiently creates a snapshot for a logical unit (LUN) served by a storage input/output (I/O) stack executing on a node of a cluster that organizes data as extents referenced by keys. In addition, the technique efficiently creates one or more snapshots for a group of LUNs organized as a consistency group (CG) and served by storage I/O stacks executing on a plurality of nodes of the cluster. To that end, the technique involves a plurality of indivisible operations (i.e., transactions) of a snapshot creation workflow administered by a Storage Area Network (SAN) administration layer (SAL) of the storage I/O stack in response to a snapshot create request issued by a host.Type: GrantFiled: September 29, 2015Date of Patent: August 22, 2017Assignee: NetApp, Inc.Inventors: Ling Zheng, Long Yang, Kayuri H. Patel, Suhas Prakash, Jeffrey S. Kimmel, Anshul Pundir, Arun Rokade
-
Publication number: 20170031774Abstract: A snap restore technique efficiently restores snapshots of storage containers served by a storage input/output (I/O) stack executing on one or more nodes of a cluster. A Small Computer Systems Interface administration layer interacts with a volume layer of the storage I/O stack to manage and implement a snap restore procedure to restore one or more snapshots of a storage container. The storage container may be a logical unit (LUN) embodied as parent volume (active volume) and the snapshot may be represented as an independent volume embodied as read-only copy of the active volume. The snap restore procedure may be configured to allow restoration to a single snapshot of a LUN or restoration of a plurality of LUNs organized as a consistency group from a group of snapshots.Type: ApplicationFiled: July 31, 2015Publication date: February 2, 2017Inventors: David Brittain Bolen, Suhas Prakash, Anshul Pundir, Ling Zheng
-
Publication number: 20170031769Abstract: A technique efficiently creates a snapshot for a logical unit (LUN) served by a storage input/output (I/O) stack executing on a node of a cluster that organizes data as extents referenced by keys. In addition, the technique efficiently creates one or more snapshots for a group of LUNs organized as a consistency group (CG) and served by storage I/O stacks executing on a plurality of nodes of the cluster. To that end, the technique involves a plurality of indivisible operations (i.e., transactions) of a snapshot creation workflow administered by a Storage Area Network (SAN) administration layer (SAL) of the storage I/O stack in response to a snapshot create request issued by a host.Type: ApplicationFiled: September 29, 2015Publication date: February 2, 2017Inventors: Ling Zheng, Long Yang, Kayuri H. Patel, Suhas Prakash, Jeffrey S. Kimmel, Anshul Pundir, Arun Rokade
-
Publication number: 20150025873Abstract: Methods, systems, and computer-readable media for providing a rule based exchange simulator are presented. A plurality of rules may be received at an exchange simulator that define how orders should be processed at the exchange simulator. The received rules may be stored, for instance, at a rules engine. For example, rules may comprise a fill rule, a cancel rule, a reject rule, a no acknowledgment rule, and a market data rule. An order that comprises a stock exchange order may be received at the exchange simulator. For example, an order may comprise a buy or sell order for a particular instrument, such as a stock, and may comprise a particular quantity. Based on the one or more rules stored in the rules engine, the received order may be fully filled, partially filled, or not filled.Type: ApplicationFiled: July 16, 2013Publication date: January 22, 2015Inventors: Rehman Ahmed Khan, Srinivasa Rao Aravala, Suhas Prakash Shahapurkar