Jobs of a computing system are scheduled by estimating the resources and schedule lengths in a general conveyor system, forced idling of processors, and branches in two-processor homogeneous and nonhomogeneous systems via dynamic programming with regard for the rank levels of dependent jobs in their priority orgraphs. These estimates are applied to find the structure of a computing system from models with partial constraints and without constraints on resources and jobs.
展开▼
