Scheduling methods for a job package in a multi-processor computer system of the PS-3000 type

The article is concerned with effective scheduling for a job package repeatedly executed in a multi-processor computer system of the PJ3-3000 type. The situation is modeled as dynamic fluxes in networks. The model parameters are the times of job input/output and execution, the required memory size, and constraints on the number of processes and the size of fast memory in a multi-processor computer system. The computing complexity of the problem is considered. Classes of heuristic algorithms are employed in a procedure of effective scheduling with an algorithm of adaptation to a given job package.