Equilibrieum allocation of processor time with linear utility functions
Sibirskij žurnal industrialʹnoj matematiki, Tome 13 (2010) no. 2, pp. 46-53.

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider a model for the processor time market in a multiprocessor system. The processes differ in speed and expences. Each user has one job, whose volume and budget are known, and a utility function depending linearly on the share of the job completed during the period to be allocated. The budget of each job coincides with a monetary estimate of its utility for the user. We show that under these assumptions the equilibrium prices and distribution of processor time between the jobs can be obtained from certain linear programming problems.
Keywords: multiprocessor system, allocation of processor time, usefulness, balanced prices, linear programming.
@article{SJIM_2010_13_2_a4,
     author = {S. V. Bredikhin and A. B. Khutoretskiǐ},
     title = {Equilibrieum allocation of processor time with linear utility functions},
     journal = {Sibirskij \v{z}urnal industrialʹnoj matematiki},
     pages = {46--53},
     publisher = {mathdoc},
     volume = {13},
     number = {2},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJIM_2010_13_2_a4/}
}
TY  - JOUR
AU  - S. V. Bredikhin
AU  - A. B. Khutoretskiǐ
TI  - Equilibrieum allocation of processor time with linear utility functions
JO  - Sibirskij žurnal industrialʹnoj matematiki
PY  - 2010
SP  - 46
EP  - 53
VL  - 13
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SJIM_2010_13_2_a4/
LA  - ru
ID  - SJIM_2010_13_2_a4
ER  - 
%0 Journal Article
%A S. V. Bredikhin
%A A. B. Khutoretskiǐ
%T Equilibrieum allocation of processor time with linear utility functions
%J Sibirskij žurnal industrialʹnoj matematiki
%D 2010
%P 46-53
%V 13
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SJIM_2010_13_2_a4/
%G ru
%F SJIM_2010_13_2_a4
S. V. Bredikhin; A. B. Khutoretskiǐ. Equilibrieum allocation of processor time with linear utility functions. Sibirskij žurnal industrialʹnoj matematiki, Tome 13 (2010) no. 2, pp. 46-53. http://geodesic.mathdoc.fr/item/SJIM_2010_13_2_a4/

[1] Foster I., “What is the Grid? – a three point checklist”, GRIDtoday, 1:6 (2002); http://gridclub.ru/library/publication.2004-11-29.5830756248/publ_file/

[2] Buyya R., Abramson D., Venugopal S., “The Grid economy”, Proc. IEEE, 93:3 (2005), 698–714 | DOI

[3] Wolski R., Brevik J., Plank J. S., Bryan T., “Grid resource allocation and control using computational economies”, Grid Computing. Making the Global Infrastructure a Reality, John Wiley Sons, Chichester, 2003, Chap. 32

[4] Stuer G., Vanmechelen K., Broeckhove J., “A commodity market for pricing substitutable Grid resources”, Future Generation Computer Systems, 23 (2007), 688–701 | DOI

[5] Bredikhin S. V., Khutoretskii A. B., “Modeli raspredeleniya resursov v vychislitelnykh setyakh: obzor”, Vestnik Novosib. gos. un-ta. Ser. Informatsionnye tekhnologii, 2:1 (2005), 31–53 | MR

[6] Wieczorek M., Hoheisel A., Prodan R., “Towards a generalmodel of the multi-criteria workflow scheduling on the grid”, Future Generation Computer Systems, 25 (2009), 237–256 | DOI

[7] Smale S., “A convergent process of price adjustment and global Newton methods”, J. Math. Economics, 3 (1976), 107–120 | DOI | MR | Zbl

[8] Li C., Li L., “Optimization decomposition approach for layered QoS scheduling in grid computing”, J. Systems Architecture, 53 (2007), 816–822 | DOI

[9] Bredikhin S. V., Tiunova E. M., Khutoretskii A. B., “Tsenovoe soglasovanie sprosa i predlozheniya pri raspredelenii moschnosti mnogoprotsessornoi sistemy”, Sib. zhurn. industr. matematiki, 10:3(31) (2007), 20–28 | MR

[10] Garg S., Konugurthi P., Buyya R., “A linear programming driven genetic algorithm for metascheduling on utility grids”, Proc. 16 Internat. Conf. on Advanced Computing and Communication, ADCOM 2008 (Dec. 14–17, 2008), IEEE Press, N.Y., 2008, 19–26

[11] Debreu G., “Existence of competitive equilibrium”, Handbook of Mathematical Economics, v. 2, North-Holland Publ., N.Y. et al., 1993, chap. 15, 697–743