Job Batch Generation and Scheduling in Distributed Computing Environment | Zendy

Виктор Васильевич Топорков | Zendy; Дмитрий Михайлович Емельянов | Zendy; Пётр Анатольевич Потехин | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Job Batch Generation and Scheduling in Distributed Computing Environment

Author(s) -

Виктор Васильевич Топорков,

Дмитрий Михайлович Емельянов,

Пётр Анатольевич Потехин

Publication year - 2015

Publication title -

bulletin of the south ural state university series computational mathematics and software engineering

Language(s) - English

Resource type - Journals

eISSN - 2410-7034

pISSN - 2305-9052

DOI - 10.14529/cmse150204

Subject(s) - job scheduler , computer science , knapsack problem , distributed computing , job shop scheduling , scheduling (production processes) , fair share scheduling , virtual machine , mathematical optimization , compatibility (geochemistry) , rate monotonic scheduling , algorithm , operating system , engineering , mathematics , schedule , cloud computing , chemical engineering

The paper considers approaches to ranked jobs system generation in the model of cyclic scheduling in the virtual organizations of distributed computing environments. Two different methodologies of job selection for scheduling are proposed and compared: the first one is based on the solution of knapsack problem, the second one utilizes a heuristic "compatibility" indicator of jobs and computing domains. Experimental results that allow estimating of the proposed solutions efficiency are presented, the solutions are compared to random job selection.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research