Patents by Inventor Manoj Syamala

Manoj Syamala 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).

  • Publication number: 20230333975
    Abstract: Intelligent memory brokering for multiple process instances, such as relational databases (e.g., SQL servers), reclaims memory based on value, thereby minimizing cost across instances. An exemplary solution includes: based at least on a trigger event, determining a memory profile for each of a plurality of process instances at a computing node; determining an aggregate memory profile, the aggregate memory profile indicating a memory unit cost for each of a plurality of memory units; determining a count of memory units to be reclaimed; identifying, based at least on the aggregate memory profile and the count of memory units to be reclaimed, a count of memory units to be reclaimed within each process instance so that a total cost is minimized to reclaim the determined count; and communicating, to each process instance having identified memory units to be reclaimed, a count of memory units to be reclaimed within the process instance.
    Type: Application
    Filed: June 19, 2023
    Publication date: October 19, 2023
    Inventors: Manoj SYAMALA, Vivek NARASAYYA, Junfeng DONG, Ajay KALHAN, Shize XU, Changsong LI, Pankaj ARORA, Jiaqi LIU, John M. OSLAKE, Arnd Christian KÖNIG
  • Patent number: 11726905
    Abstract: Intelligent memory brokering for multiple process instances, such as relational databases (e.g., SQL servers), reclaims memory based on value, thereby minimizing cost across instances. An exemplary solution includes: based at least on a trigger event, determining a memory profile for each of a plurality of process instances at a computing node; determining an aggregate memory profile, the aggregate memory profile indicating a memory unit cost for each of a plurality of memory units; determining a count of memory units to be reclaimed; identifying, based at least on the aggregate memory profile and the count of memory units to be reclaimed, a count of memory units to be reclaimed within each process instance so that a total cost is minimized to reclaim the determined count; and communicating, to each process instance having identified memory units to be reclaimed, a count of memory units to be reclaimed within the process instance.
    Type: Grant
    Filed: January 21, 2021
    Date of Patent: August 15, 2023
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Manoj Syamala, Vivek Narasayya, Junfeng Dong, Ajay Kalhan, Shize Xu, Changsong Li, Pankaj Arora, Jiaqi Liu, John M. Oslake, Arnd Christian König
  • Patent number: 11595319
    Abstract: Techniques for differential overbooking on a cloud database. These techniques may include determining a reservation amount of a multi-tenant resource for a first service of a based upon an overbooking characteristic of the first service, and determining that a total usage value of the multi-tenant resource by a plurality of services is greater than a threshold value. In addition, the techniques may include determining a service usage value of the multi-tenant resource by the first service, determining a first overage value of the first service based on the service usage value and the reservation amount, and performing a resource reclamation process over the multi-tenant resource based on the first overage value of the first service.
    Type: Grant
    Filed: December 21, 2020
    Date of Patent: February 28, 2023
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Changsong Li, Ajay Kalhan, Pankaj Arora, Junfeng Dong, Yi Shan, Christian Konig, Manoj Syamala, Vivek Narasayya, Shize Xu, John M. Oslake, Jiaqi Liu
  • Publication number: 20220200927
    Abstract: Techniques for differential overbooking on a cloud database. These techniques may include determining a reservation amount of a multi-tenant resource for a first service of a based upon an overbooking characteristic of the first service, and determining that a total usage value of the multi-tenant resource by a plurality of services is greater than a threshold value. In addition, the techniques may include determining a service usage value of the multi-tenant resource by the first service, determining a first overage value of the first service based on the service usage value and the reservation amount, and performing a resource reclamation process over the multi-tenant resource based on the first overage value of the first service.
    Type: Application
    Filed: December 21, 2020
    Publication date: June 23, 2022
    Inventors: Changsong Li, Ajay Kalhan, Pankaj Arora, Junfeng Dong, Yi Shan, Christian Konig, Manoj Syamala, Vivek Narasayya, Shize Xu, John M. Oslake, Jiaqi Liu
  • Patent number: 11256619
    Abstract: A solution is disclosed for memory management of serverless databases that includes: based at least on detecting a trigger event, determining whether memory is to be reclaimed; based at least on determining that memory is to be reclaimed, determining an amount of memory to be reclaimed; identifying memory to be reclaimed; and reclaiming the identified memory. Disclosed solutions are flexible, enabling customization of the aggressiveness and manner of memory reclamation. This permits users to specify a tailored balance point between performance and cost, for arrangements that bill users based on resource usage (e.g., memory consumed by a serverless database). In some examples, users specify a ramp-down parameter that is used to determine how much memory can be evicted in a particular reclamation event, time intervals (or another criteria) for triggering a reclamation event, and a definition for whether a cache is active.
    Type: Grant
    Filed: August 13, 2019
    Date of Patent: February 22, 2022
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Manoj Syamala, Arnd Christian König, Vivek Narasayya, Junfeng Dong, Ajay Kalhan, Shize Xu, Changsong Li, Pankaj Arora, Jiaqi Liu, John M. Oslake
  • Patent number: 11201832
    Abstract: Described herein are technologies relating to computing resource allocation among multiple tenants. Each tenant may have a respective absolute reservation for rate-based computing resources, which is independent of computing resource reservations of other tenants. The multiple tenants vie for the rate-based computing resources, and tasks are scheduled based upon which tenants submit the tasks and the resource reservations of such tenants.
    Type: Grant
    Filed: June 25, 2020
    Date of Patent: December 14, 2021
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sudipto Das, Vivek Narasayya, Feng Li, Manoj Syamala
  • Publication number: 20210141720
    Abstract: Intelligent memory brokering for multiple process instances, such as relational databases (e.g., SQL servers), reclaims memory based on value, thereby minimizing cost across instances. An exemplary solution includes: based at least on a trigger event, determining a memory profile for each of a plurality of process instances at a computing node; determining an aggregate memory profile, the aggregate memory profile indicating a memory unit cost for each of a plurality of memory units; determining a count of memory units to be reclaimed; identifying, based at least on the aggregate memory profile and the count of memory units to be reclaimed, a count of memory units to be reclaimed within each process instance so that a total cost is minimized to reclaim the determined count; and communicating, to each process instance having identified memory units to be reclaimed, a count of memory units to be reclaimed within the process instance.
    Type: Application
    Filed: January 21, 2021
    Publication date: May 13, 2021
    Inventors: Manoj SYAMALA, Vivek NARASAYYA, Junfeng DONG, Ajay KALHAN, Shize XU, Changsong LI, Pankaj ARORA, Jiaqi LIU, John M. OSLAKE, Arnd Christian KÖNIG
  • Patent number: 10936480
    Abstract: Intelligent memory brokering for multiple process instances, such as relational databases (e.g., SQL servers), reclaims memory based on value, thereby minimizing cost across instances. An exemplary solution includes: based at least on a trigger event, determining a memory profile for each of a plurality of process instances at a computing node; determining an aggregate memory profile, the aggregate memory profile indicating a memory unit cost for each of a plurality of memory units; determining a count of memory units to be reclaimed; identifying, based at least on the aggregate memory profile and the count of memory units to be reclaimed, a count of memory units to be reclaimed within each process instance so that a total cost is minimized to reclaim the determined count; and communicating, to each process instance having identified memory units to be reclaimed, a count of memory units to be reclaimed within the process instance.
    Type: Grant
    Filed: May 31, 2019
    Date of Patent: March 2, 2021
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Manoj Syamala, Vivek Narasayya, Junfeng Dong, Ajay Kalhan, Shize Xu, Changsong Li, Pankaj Arora, Jiaqi Liu, John M. Oslake, Arnd Christian König
  • Publication number: 20200403930
    Abstract: Described herein are technologies relating to computing resource allocation among multiple tenants. Each tenant may have a respective absolute reservation for rate-based computing resources, which is independent of computing resource reservations of other tenants. The multiple tenants vie for the rate-based computing resources, and tasks are scheduled based upon which tenants submit the tasks and the resource reservations of such tenants.
    Type: Application
    Filed: June 25, 2020
    Publication date: December 24, 2020
    Inventors: Sudipto Das, Vivek Narasayya, Feng Li, Manoj Syamala
  • Publication number: 20200379896
    Abstract: Intelligent memory brokering for multiple process instances, such as relational databases (e.g., SQL servers), reclaims memory based on value, thereby minimizing cost across instances. An exemplary solution includes: based at least on a trigger event, determining a memory profile for each of a plurality of process instances at a computing node; determining an aggregate memory profile, the aggregate memory profile indicating a memory unit cost for each of a plurality of memory units; determining a count of memory units to be reclaimed; identifying, based at least on the aggregate memory profile and the count of memory units to be reclaimed, a count of memory units to be reclaimed within each process instance so that a total cost is minimized to reclaim the determined count; and communicating, to each process instance having identified memory units to be reclaimed, a count of memory units to be reclaimed within the process instance.
    Type: Application
    Filed: May 31, 2019
    Publication date: December 3, 2020
    Inventors: Manoj SYAMALA, Vivek NARASAYYA, Junfeng DONG, Ajay KALHAN, Shize XU, Changsong LI, Pankaj ARORA, Jiaqi LIU, John M. OSLAKE, Arnd Christian KÖNIG
  • Publication number: 20200349067
    Abstract: A solution is disclosed for memory management of serverless databases that includes: based at least on detecting a trigger event, determining whether memory is to be reclaimed; based at least on determining that memory is to be reclaimed, determining an amount of memory to be reclaimed; identifying memory to be reclaimed; and reclaiming the identified memory. Disclosed solutions are flexible, enabling customization of the aggressiveness and manner of memory reclamation. This permits users to specify a tailored balance point between performance and cost, for arrangements that bill users based on resource usage (e.g., memory consumed by a serverless database). In some examples, users specify a ramp-down parameter that is used to determine how much memory can be evicted in a particular reclamation event, time intervals (or another criteria) for triggering a reclamation event, and a definition for whether a cache is active.
    Type: Application
    Filed: August 13, 2019
    Publication date: November 5, 2020
    Inventors: Manoj SYAMALA, Arnd Christian KÖNIG, Vivek NARASAYYA, Junfeng DONG, Ajay KALHAN, Shize XU, Changsong LI, Pankaj ARORA, Jiaqi LIU, John M. OSLAKE
  • Patent number: 10749814
    Abstract: Described herein are technologies relating to computing resource allocation among multiple tenants. Each tenant may have a respective absolute reservation for rate-based computing resources, which is independent of computing resource reservations of other tenants. The multiple tenants vie for the rate-based computing resources, and tasks are scheduled based upon which tenants submit the tasks and the resource reservations of such tenants.
    Type: Grant
    Filed: August 21, 2018
    Date of Patent: August 18, 2020
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sudipto Das, Vivek Narasayya, Feng Li, Manoj Syamala
  • Publication number: 20190089647
    Abstract: Described herein are technologies relating to computing resource allocation among multiple tenants. Each tenant may have a respective absolute reservation for rate-based computing resources, which is independent of computing resource reservations of other tenants. The multiple tenants vie for the rate-based computing resources, and tasks are scheduled based upon which tenants submit the tasks and the resource reservations of such tenants.
    Type: Application
    Filed: August 21, 2018
    Publication date: March 21, 2019
    Inventors: Sudipto Das, Vivek Narasayya, Feng Li, Manoj Syamala
  • Patent number: 10063491
    Abstract: Described herein are technologies relating to computing resource allocation among multiple tenants. Each tenant may have a respective absolute reservation for rate-based computing resources, which is independent of computing resource reservations of other tenants. The multiple tenants vie for the rate-based computing resources, and tasks are scheduled based upon which tenants submit the tasks and the resource reservations of such tenants.
    Type: Grant
    Filed: February 16, 2017
    Date of Patent: August 28, 2018
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sudipto Das, Vivek Narasayya, Feng Li, Manoj Syamala
  • Publication number: 20170163554
    Abstract: Described herein are technologies relating to computing resource allocation among multiple tenants. Each tenant may have a respective absolute reservation for rate-based computing resources, which is independent of computing resource reservations of other tenants. The multiple tenants vie for the rate-based computing resources, and tasks are scheduled based upon which tenants submit the tasks and the resource reservations of such tenants.
    Type: Application
    Filed: February 16, 2017
    Publication date: June 8, 2017
    Inventors: Sudipto Das, Vivek Narasayya, Feng Li, Manoj Syamala
  • Patent number: 9602426
    Abstract: Described herein are technologies relating to computing resource allocation among multiple tenants. Each tenant may have a respective absolute reservation for rate-based computing resources, which is independent of computing resource reservations of other tenants. The multiple tenants vie for the rate-based computing resources, and tasks are scheduled based upon which tenants submit the tasks and the resource reservations of such tenants.
    Type: Grant
    Filed: May 6, 2014
    Date of Patent: March 21, 2017
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Sudipto Das, Vivek Narasayya, Feng Li, Manoj Syamala
  • Patent number: 9009124
    Abstract: A plurality of indicators representing a plurality of respective candidate database configurations may be obtained, each of the candidate database configurations including a plurality of database queries and a plurality of candidate database indexes associated with a database table. A portion of the candidate database indexes included in the plurality of database indexes may be selected based on skyline selection. An enumeration of the portion of the plurality of the candidate database indexes may be determined based on a greedy algorithm.
    Type: Grant
    Filed: June 17, 2011
    Date of Patent: April 14, 2015
    Assignee: Microsoft Technology Licensing, LLC
    Inventors: Hideaki Kimura, Vivek Narasayya, Manoj Syamala
  • Publication number: 20140379924
    Abstract: Described herein are technologies relating to computing resource allocation among multiple tenants. Each tenant may have a respective absolute reservation for rate-based computing resources, which is independent of computing resource reservations of other tenants. The multiple tenants vie for the rate-based computing resources, and tasks are scheduled based upon which tenants submit the tasks and the resource reservations of such tenants.
    Type: Application
    Filed: May 6, 2014
    Publication date: December 25, 2014
    Applicant: Microsoft Corporation
    Inventors: Sudipto Das, Vivek Narasayya, Feng Li, Manoj Syamala
  • Patent number: 8805800
    Abstract: This patent application relates to granular and workload driven database index defragmentation techniques. These techniques allow for defragmenting individual index ranges, performing benefit analysis to estimate the impact of defragmenting indexes or index ranges, and leveraging such benefit analysis to provide automated workload-driven recommendations of index(es) or index range(s) to defragment.
    Type: Grant
    Filed: March 14, 2010
    Date of Patent: August 12, 2014
    Assignee: Microsoft Corporation
    Inventors: Vivek Narasayya, Manoj Syamala
  • Publication number: 20130332428
    Abstract: The subject disclosure is directed towards defragmenting one or more ranges of a database index based upon actual usage statistics and policy. A range tracker tracks and uses statistics corresponding to actual I/O operations to determine whether the benefit of defragmenting a range sufficiently (based upon the policy) exceeds its cost. If so, the online range defragmenter automatically defragments the range in an online manner. The range tracker may be configurable to monitor less than all ranges of the index.
    Type: Application
    Filed: June 11, 2012
    Publication date: December 12, 2013
    Applicant: MICROSOFT CORPORATION
    Inventors: Vivek Ravindranath Narasayya, Hyunjung Park, Manoj Syamala