×

Dynamic routing and load balancing packet distribution with a software factory

  • US 8,141,030 B2
  • Filed: 08/07/2007
  • Issued: 03/20/2012
  • Est. Priority Date: 08/07/2007
  • Status: Expired due to Fees
First Claim
Patent Images

1. A computer-implemented method for dynamically routing and load balancing packet distribution within a software factory, the computer-implemented method comprising:

  • receiving a plurality of configuration routes describing a plurality of available routes for a work packet,wherein the plurality of configuration routes are configured by a project manager using an availability status for each of a plurality of assembly line workers of an assembly line in the software factory,wherein the assembly line conducts an integration test, a system test, a system integration test and a performance test of a deliverable software, wherein the integration test tests the deliverable software for compatibility with a client'"'"'s system, the system test checks the client'"'"'s system to ensure that the client'"'"'s system is operating properly, the system integration test tests for bugs that may arise when the deliverable software is integrated into the client'"'"'s system, and the performance test tests the deliverable software for defects as it is executing in the client'"'"'s system, andwherein each of the plurality of assembly line workers is associated with a respective work queue, and each of the configuration routes are associated with one of the work queues;

    receiving the work packet from a design center in the software factory;

    receiving an activity report from each of the plurality of work queues identifying a number of preexisting work packets in each of the plurality of work queues;

    collecting workload data for each of the plurality of assembly line workers, wherein the workload data includes previous activity reports;

    calculating, by a processor, an estimated completion time for each work queue using the activity report and the workload data for each of the plurality of work queues;

    identifying, by the processor, a first work queue corresponding to a shortest estimated completion time; and

    routing the work packet to a first assembly line worker associated with the first work queue.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×