Patents by Inventor Konanur Chandra Shekar

Konanur Chandra Shekar 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: 7403975
    Abstract: The present invention divides processing across multiple nodes to escape limitations placed by the processing power of commonly available application server platforms. The solution processing divides the problem into independently processed batches. Coordination of processing between nodes is achieved using a relational database tables and coordination for algorithm startup and initialization may be accomplished through a messaging system. The database table is loaded with rows to represent batches to be processed, and the independent processing nodes are given a message via the messaging system to start processing various jobs at a particular level. The nodes may then signal back when they can no longer find batches to process at that level. Once all nodes have completed a level, a message is sent to the nodes starts on to the next level. In this way, the messaging between the nodes is generally limited to two messages per level per node.
    Type: Grant
    Filed: November 10, 2003
    Date of Patent: July 22, 2008
    Assignee: JDA Software Group, Inc.
    Inventors: Daniel John Berkery, Konanur Chandra Shekar, Joseph Allen Jenkins, Joel Lamarr Lindsey, Jr., Thomas J. Drolet
  • Publication number: 20040205074
    Abstract: The present invention divides processing across multiple nodes to escape limitations placed by the processing power of commonly available application server platforms. The solution processing divides the problem into independently processed batches. Coordination of processing between nodes is achieved using a relational database tables and coordination for algorithm startup and initialization may be accomplished through a messaging system. The database table is loaded with rows to represent batches to be processed, and the independent processing nodes are given a message via the messaging system to start processing various jobs at a particular level. The nodes may then signal back when they can no longer find batches to process at that level. Once all nodes have completed a level, a message is sent to the nodes starts on to the next level. In this way, the messaging between the nodes is generally limited to two messages per level per node.
    Type: Application
    Filed: November 10, 2003
    Publication date: October 14, 2004
    Applicant: Manugistics, Inc.
    Inventors: Daniel John Berkery, Konanur Chandra Shekar, Joseph Allen Jenkins, Joel Lamarr Lindsey, Thomas J. Drolet
  • Publication number: 20030033180
    Abstract: The present invention describes a method and system for optimizing resource plans across multiple networks. Aspects of the disclosure include creating planning data and planning rules. Planning data contains information regarding constrained resources in the multiple networks. Planning rules are based on user-defined strategies. Additional aspects include generating a plan based on the planning data and the planning rules and revising the plan in real-time. The generated plan optimally allocates the constrained resources according to the user-defined strategies.
    Type: Application
    Filed: October 29, 2001
    Publication date: February 13, 2003
    Applicant: Manugistics, Inc.
    Inventors: Konanur Chandra Shekar, Salil Joshi, Michael Hooks, Ingrid Bongartz, Robert MacMillan, Christopher A. Greamo