-
公开(公告)号：US20080033774A1
公开(公告)日：2008-02-07
申请号：US11861663
申请日：2007-09-26
IPC分类号： G06Q10/00
CPC分类号： G06F9/50 , G06Q10/0631 , G06Q10/06312 , G06Q10/06315 , H04L67/1002 , H04L67/1008 , H04L67/1023
摘要： A method for server allocation in a Web server “farm” is based on limited information regarding future loads to achieve close to the greatest possible revenue based on the assumption that revenue is proportional to the utilization of servers and differentiated by customer class. The method of server allocation uses an approach of “discounting the future”. Specifically, when the policy faces the choice between a guaranteed benefit immediately and a potential benefit in the future, the decision is made by comparing the guaranteed benefit value with a discounted value of the potential future benefit. This discount factor is exponential in the number of time units that it would take a potential benefit to be materialized. The future benefits are discounted because by the time a benefit will be materialized, things might change and the algorithm might decide to make another choice for a potential (even greater) benefit.
摘要翻译： Web服务器“farm”中的服务器分配方法基于有限的关于未来负载的信息，以实现接近最大可能收入的假设，即假设收入与服务器的利用率成正比，并根据客户类别区分。 服务器分配的方法采用“贴现未来”的方法。 具体来说，当政策面临保证收益立即与潜在利益之间的选择时，通过将担保收益值与潜在未来收益的折扣价值进行比较来做出决策。 这个折扣因子是要实现潜在收益的时间单位数量的指数。 未来的利益是折扣的，因为在实现利益的时候，事情可能会改变，算法可能决定为潜力（甚至更大）的利益作出另一个选择。
-
公开(公告)号：US20060242647A1
公开(公告)日：2006-10-26
申请号：US11110766
申请日：2005-04-21
IPC分类号： G06F9/46
CPC分类号： G06F9/5066 , G06F9/5083
摘要： An optimization problem models the dynamic placement of applications on servers under two types of simultaneous resource requirements, those that are dependent on the loads placed on the applications and those that are independent. The demand (load) for applications changes over time and the goal is to satisfy all the demand while changing the solution (assignment of applications to servers) as little as possible.
-
搜索结果
2 条记录 (耗时 0.018 秒)