Consider a simple search problem with multiple paths. The main processing path can be computed in series as required functionality is identified. Completion occurs whenever an adequate solution is found. Alternatively, potential paths can be searched in batches or all simultaneously ahead of time**. This diminishes the wait for required functionality at the cost of additional processing, some of which may never be necessary. We trade computation power for statistically lower execution time.