Dynamic resource allocation using projected future benefits

Data processing: financial – business practice – management – or co – Automated electrical financial or business practice or... – Health care management

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C705S007380, C705S002000, C709S226000

Reexamination Certificate

active

10000149

ABSTRACT:
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.

REFERENCES:
patent: 5216593 (1993-06-01), Dietrich et al.
patent: 6085216 (2000-07-01), Huberman et al.
patent: 6230200 (2001-05-01), Forecast et al.
patent: 6374227 (2002-04-01), Ye
patent: 6954931 (2005-10-01), Shetty et al.
patent: 2003/0037146 (2003-02-01), O'Neill
patent: 2005/0256778 (2005-11-01), Boyd et al.
patent: WO 9526535 (1995-10-01), None
“IBM's new commercial parallel computing solution improves business decisions” by Nadine Taylor, Business Wire, Dec. 7, 1994.
“Adaptive algorithms for managing a distributed data processing” by Aman et al, IBM Systems Journal, 1997, vol. 36, issue 2, p. 242.
“Online Server Allocation in a Server Farm via Benefit Task Systems” by Jayram et al, STOC'01,. Jul. 6-8, 2001.
“On-Line Analysis of the TCP Acknowledgement Delay Problem” by Dooly et al, Journal of the ACM, Mar. 2001.
“Lookahead routing for ring networks with random extra links” by Kovacevic, IEEE, 1995.
“BPSS: A Scheduling support system for the Packaging Industry” by Adler et al, Operations Research, Jul.-Aug. 1993.
“TCP Dynamic Acknowledgement Delay: Theory and Practice” by Dooly et al, Proceedings of the 30th annual ACM symposium on Theory of computing, ACM Press, 1998.
Jayram “Online Server Allocation in a Server Farm Via Benefit Task Systems”, Jun. 2001, Hersonissos, Crete. pp. 540-549.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Dynamic resource allocation using projected future benefits does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic resource allocation using projected future benefits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic resource allocation using projected future benefits will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3834611

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.