Optimal Resource Allocation and Scheduling Among Parallel Processes,

摘要

The problem of optimally allocating limited resources among competing processes may be formulated as a problem in finding the shortest path in a directed graph, provided a quantitative measure of the performance of each process as a function of its resource allocation can be suitably defined. If this measure is also a function of time, scheduling problems arise so that optimal allocations become time-varying and may depend upon various precedence relations or constraints among the processes. Dynamic programming approaches to such allocation and scheduling problems are presented in the context of parallel processing.