Optimizing the quasistatic plan of specialized computer system’s computing resources allocation
The problem of optimal computing resources allocation in specialized computer system with poisson incoming flow of tasks of random length and with parallel execution of tasks simultaneously on multiple resources was considered. The residence time of the job is limited to a specified value, which dependson its length. An algorithm for optimizing the quasistatic plan of the computing resources allocation between the jobs was proposed. One of indicators of computer system’s performance (the intensityof fully executed tasks, average total length of the unexecuted parts of jobs leaving the system per unit time, load factor of resources) used as an objective function. The results of numerical experimentsand estimates of complexity of proposed algorithm were obtained.