| US 7,590,464 B2 | ||
| System and method for on-line planning utilizing multiple planning queues | ||
| Wheeler Ruml, Palo Alto, Calif. (US); Minh Binh Do, Mountain View, Calif. (US); and Rong Zhou, San Jose, Calif. (US) | ||
| Assigned to Palo Alto Research Center Incorporated, Palo Alto, Calif. (US) | ||
| Filed on May 29, 2007, as Appl. No. 11/807,472. | ||
| Prior Publication US 2008/0300707 A1, Dec. 04, 2008 | ||
| Int. Cl. G06F 19/00 (2006.01) | ||
| U.S. Cl. 700—101 [709/223] | 20 Claims |
| 1. A computer-readable medium that stores instructions for concurrently processing job request batches for machine control,
the instructions comprising:
receiving multiple batches of job requests for concurrent processing in parallel planning queues;
placing each job request batch in a respective unplanned subqueue of a planning queue, wherein each planning queue comprises
the unplanned subqueue that stores unplanned job requests in its batch, an unsent subqueue that stores planned jobs that have
not been output for execution, and a sent subqueue that stores planned jobs that have been output for execution;
identifying an unsent subqueue having a shortest length relative to other unsent subqueues;
identifying a job request in the unplanned subqueue in the same planning queue as the shortest unsent subqueue;
removing the identified job request from the unplanned subqueue;
generating a plan for executing the identified job request; and
inserting the planned job into the identified unsent subqueue to increase its length.
|