Patents by Inventor Aditya TELIDEVARA

Aditya TELIDEVARA 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: 10701154
    Abstract: Sharding a data unit across storage locations (e.g., data centers, clusters, accounts, and so forth). For each location, the multi-link traffic constraints in data channeling with the storage location are identified. For instance, for a given data channel leading to and/or from a storage location, there may be multiple links. Each link may have its own constraints (e.g., in throughput and/or storage). Policy may consider the sharding of files in a manner that honors the constraints. The policy may also be set so that all portions of the shards may be timely accessed in parallel. When sharding, the policy is applied in order to identify initial placement of the computing data unit across the multiple storage locations. Furthermore, the policy may be consulted to determine which storage location to access the shard from and/or which channel to use to access the shard from a given location.
    Type: Grant
    Filed: May 22, 2017
    Date of Patent: June 30, 2020
    Assignee: MICROSOFT TECHNOLOGY LICENSING, LLC
    Inventors: Sri Sai Kameswara Pavan Kumar Kasturi, Baskar Sridharan, Spiro Michaylov, Joseph M. Gagne, Raghunath Ramakrishnan, Aditya Telidevara
  • Publication number: 20180337993
    Abstract: Sharding a data unit across storage locations (e.g., data centers, clusters, accounts, and so forth). For each locations, the multi-link traffic constraints in data channeling with the storage location are identified. For instance, for a given data channel leading to and/or from a storage location, there may be multiple links. Each link may have their own constraints (e.g., in throughput and/or storage). Policy may consider the sharding of files in a manner that honors the constraints. The policy may also be set so that all portions of the shards may be timely accessed in parallel. When sharding, the policy is applied in order to identify initial placement of the computing data unit across the multiple storage locations. Furthermore, the policy may be consulted to determine which storage location to access the shard from and/or which channel to use to access the shard from a given location.
    Type: Application
    Filed: May 22, 2017
    Publication date: November 22, 2018
    Inventors: Sri Sai Kameswara Pavan KUMAR KASTURI, Baskar SRIDHARAN, Spiro MICHAYLOV, Joseph M. GAGNE, Raghunath RAMAKRISHNAN, Aditya TELIDEVARA