Abstract

A model of job processing in distributed environments with non-dedicated resources having owners is proposed and justified. The model adopts the implementation of the so-called fair distribution of resources between independent users and owners of computation nodes. Problems of optimal and efficient combinations of available resources based on dynamically changing schedules (lists of slots of which each is associated with a time interval for the execution of a part of job and a certain type of resources) are discussed.

Full Text
Published version (Free)

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 call