Algorithm for additional dispatching of tasks in multi-program information systems

Abstract

Algorithm for additional dispatching of tasks in multi-program information systems

Kozyr' O.F.

Incoming article date: 12.07.2020

A task flow scheduling procedure is proposed that sets the order between groups of equivalent tasks based on their comparison by a number of characteristics. The goal of task flow scheduling was to minimize the total time spent on idle tasks in queues while waiting for the release of sequentially used resources. In the proposed method, when selecting tasks to perform, priority is given to tasks that use the minimum resources. This algorithm allows you to avoid running tasks that use the same resources simultaneously. Recommendations for practical application of the scheduling procedure are given, and a scheme for its interaction with the built-in OS scheduler is developed. To get the greatest effect from controling task scheduling in various environments, options for changing the dispatching algorithm are proposed.

Keywords: multi-program information systems, real-time systems, algorithm, flowchart, task dispatching, process scheduling by structural criteria, task grouping, task control based on priorities, comparison of multi-criteria tasks, Pareto dominance rule