Patents by Inventor Joel Lamarr Lindsey

Joel Lamarr Lindsey 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).

  • Design for highly-scalable, distributed replenishment planning algorithm
    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
  • Design for highly-scalable, distributed replenishment planning algorithm
    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