On One Method to Solve the Haversack Problem in Allocation of Computer System Resources

The unidimensional haversack problem is solved by a new procedure in allocation of resources of uniform solution fields between different programs or their parallel branches. The computations are performed as the requirement for a resource is received without interrupting the solution process and are accelerated when identical requirements are received. The procedure implies a parallel solution process and a maximal rate of search for the optimum.