CENTRAL RING ALGORITHM OF HYPERBOLIC-TYPE TASK QUEUES SCHEDULING
A task queue of hyperbolic type which comes for scheduling in Grid-systems or multiprocessor computer systems is considered. It is proposed and considered a central ring polynomial algorithm for allocation of multiprocessor tasks of hyperbolic and quadratic type. Heuristic measures of our algorithm and optimal one, both are used for computational resources distribution, were compared. The recommendations were given about the algorithm application in MCS or Gridtechnology centre for scheduling. Comparison of heuristic measures of resource shells confirms the usefulness of the proposed center-ring algorithm for scheduling the processor-time resources.