首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous markov modeling
Authors:VP Koutras  AN Platis  GA Gravvanis
Institution:1. Department of Financial and Management Engineering, Business School, University of the Aegean, 31, Fostini Street, GR 82100 Chios, Greece;2. Department of Electrical and Computer Engineering, School of Engineering, Democritus of Thrace, 12, Vas. Sofias Street, GR 67100 Xanthi, Greece
Abstract:Resource availability optimization is studied on a server–client system where different users are partitioned into priority classes. The aim is to provide higher resource availability according to the priority of each class. For this purpose, resource reservation is modeled by a homogeneous continuous time Markov chain (CTMC), but also by a cyclic non-homogeneous Markov chain (CNHMC) as there is a cyclic behavior of the users’ requests for resources. The contribution of the work presented consists in the formulation of a multiobjective optimization problem for both the above cases that aims to determine the optimal resource reservation policy providing higher levels of resource availability for all classes. The optimization problem is solved either with known methods or with a proposed kind of heuristic algorithm. Finally, explicit generalized approximate inverse preconditioning methods are adopted for solving efficiently sparse linear systems that are derived, in order to compute resource availability.
Keywords:Server resources  Priority classes  Resource availability modeling  Non-homogeneous Markov chains  Optimization  Approximate inverse matrix algorithms  Preconditioning
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号