Patents by Inventor Sudhir Radhakrishna SHETIYA

Sudhir Radhakrishna SHETIYA 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).

  • Systems and methods for scheduling tasks and managing computing resource allocation for closed loop control systems
    Patent number: 10671444
    Abstract: Systems and methods of scheduling tasks and managing computing resource allocation in a closed loop control system is provided. The system uses historical run-time statistics that includes expected run-time (?) and standard-deviation (?) in run-times, of the tasks. The run-time statistics are used by the system to first predictively allocate and then to order the execution of the tasks in order to minimize the make-span. The schedule predicted is a queue of tasks to be executed on each computing resource ordered by a function of the expected run-time (?) and standard-deviation (?). Reactive scheduling involves periodically probing the progress and reacting to imbalances in progress across computing resources by switching tasks between lagging and leading computing resources.
    Type: Grant
    Filed: March 21, 2017
    Date of Patent: June 2, 2020
    Assignee: Tata Consultancy Services Limited
    Inventors: Siddhartha Sengupta, Sudhir Radhakrishna Shetiya, Nishant Kumar Agrawal
  • SYSTEMS AND METHODS FOR SCHEDULING TASKS AND MANAGING COMPUTING RESOURCE ALLOCATION FOR CLOSED LOOP CONTROL SYSTEMS
    Publication number: 20190286478
    Abstract: Systems and methods of scheduling tasks and managing computing resource allocation in a closed loop control system is provided. The system uses historical run-time statistics that includes expected run-time (?) and standard-deviation (?) in run-times, of the tasks. The run-time statistics are used by the system to first predictively allocate and then to order the execution of the tasks in order to minimize the make-span. The schedule predicted is a queue of tasks to be executed on each computing resource ordered by a function of the expected run-time (?) and standard-deviation (?). Reactive scheduling involves periodically probing the progress and reacting to imbalances in progress across computing resources by switching tasks between lagging and leading computing resources.
    Type: Application
    Filed: March 21, 2017
    Publication date: September 19, 2019
    Applicant: Tata Consultancy Services Limited
    Inventors: Siddhartha SENGUPTA, Sudhir Radhakrishna SHETIYA, Nishant Kumar AGRAWAL