Abstract
The paper considers the problem fair allocation of multiple resources in a dynamic form. The problem of allocation of these resources is an important issue for any computer system. We have studied the case when the system represents a resource of a predetermined size with a time function , and the two users need to process a maximum number of tasks . Presented the mathematical model and a general algorithm for solution for users who have different demands for the system to solve their tasks. Each user’s task is characterized by two parameters:the size of the requested resources and time to process it. The arbitration decision that maximizes the objective function of a nonlinear programming problem is found. Payoff of user is determined by the number of solved problems, and overall optimal solution is measured by their product. Made numerical calculations for a model problem.
Published Version
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