Abstract
To serve parallel tasks of multiple users of Grid systems require the development of efficient methods for allocating processors and time resources. Optimal resource management is practically unrealizable due to the exponential complexity. In the situation, when the Grid-system is modeled by the resource quadrant and the user’s task is represented by the resource rectangle, heuristic polynomial algorithms are proposed with the quality assessment of scheduling by a Non-Euclidean heuristic measure. Using the example of arrays with an exact resource measure and induced by partridge linings, the adaptation of level polynomial algorithms is investigated, and a comparative analysis of the proposed algorithms is carried out.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
