Abstract. We consider the model of task scheduling in Grid systems that can be represented by the first coordinate quadrant. The process of task scheduling is based on the parity of processor resources and time resources. We previously proposed a classification of sets of multiprocessor tasks that are to be processed by a Grid system that consists of three types: circular-type, hyperbolic and parabolic task queues. We describe the polynomial time ring algorithm, apply it to a circular-type task queue, and compare our results with the optimal packing of rectangles in an enclosing rectangle of minimum area. Our comparative analysis demonstrates the applicability of the proposed ring algorithm in task scheduling in Grid systems.
The paper studies polynomial angle and level algorithms in terms of scheduling circular request arrays in the GRID systems. The suggested algorithms are analyzed on test arrays obtained from lining a square with stripes of smaller squares. The resulting heuristic measures of the resource wrappers of the level algorithm with the lack are not greater than 0.61, and the amount of error is not greater than 22%. In the GRID systems of centralized architecture, we can recommend the polynomial level algorithm with the lack for scheduling of circular request arrays.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.