Scheduling of the arrays of incomparable requests in the GRID systems

Abstract

The paper presents a method for classification of the parallel user’s requests in addition to the existing one represented by the resource rectangles. The proposed classification is considered as more fundamental as it serves to highlight the classes of comparative and incomparable resource rectangles. For the arrays of the incomparable requests, the method allows us to analyze the quality of polynomial algorithms for packing with the non-Euclidean heuristic measure that considers the form of the enclosing rectangle along with its area. Based on the test benchmarks for the optimal tiling in a non-empty square, we demonstrate the effectiveness of the proposed polynomial algorithms for dispatching of the incomparable user’s requests in the GRID systems.