The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches
综述了过程分配问题，即如何将多个过程分配到处理器网络中以最小化通信与执行成本，并评述了图论和数学规划求解方法，也介绍了启发式算法。
The Process Allocation Problem, which consists of allocating a number of processes to a network of processors with the objective of minimizing the sum of communication (between processes residing on different processors) and execution costs, is presented and the relevant literature reviewed. Solution procedures employing graph-theoretic and mathematical programming methods are critically examined. Some heuristic algorithms are also presented.