Scheduling Satisfying Search Under Execution-Time Constraints
Original Publication Date: 1988-Jun-01
Included in the Prior Art Database: 2005-Feb-15
A technique is described whereby a data processing scheduling policy is established for completing execution of a set of search tasks in a minimum expected time frame. Discussed is a method of how to schedule a satisfying search among several alternative tasks, when the tasks are characterized by different success probabilities, the amount of work required and the constraints on their maximum execution rate. In prior art, optimum problem solving search techniques have been explored, but without consideration of time rate constraints. The concept described herein extends the search techniques of prior art to cover tasks that have constrained execution rates.