Achieving at least substantially constant processing request...

Details Achieving at least substantially constant processing request... Achieving at least substantially constant processing request...

2011-04-12

2011-04-12

Lim, Krisna (Department: 2453)

Electrical computers and digital processing systems: multicomput

Computer network managing

Network resource allocating

C709S224000

Reexamination Certificate

active

07925760

ABSTRACT:
Resource loads are determined based on normalized factors that are themselves based on resource factors. The following is repeated until each resource's load is less than or equal to the resource's willingness capacity or until all the resources are each fully loaded or unavailable. Each resource's willingness capacity is determined based on the resource's willingness parameter. The willingness parameter indicates at least whether a resource is willing to receive a number of processing requests no greater than a maximum or a minimum request limit. A throughput overflow is determined for each resource having a load greater than its willingness capacity. The load for each resource having a throughput overflow greater than zero is reset. The load for each resource that is available and not fully loaded is updated based on new normalized factors and based on a potential throughput loss that is equal to a sum of the throughput overflows.

REFERENCES:
patent: 6571288 (2003-05-01), Sarukkai
patent: 6681251 (2004-01-01), Leymann et al.
patent: 6922724 (2005-07-01), Freeman et al.
patent: 7548977 (2009-06-01), Agapi et al.
patent: 7584262 (2009-09-01), Wang et al.
patent: 7647401 (2010-01-01), Collet et al.
patent: 2003/0126200 (2003-07-01), Wolff
patent: 2005/0021530 (2005-01-01), Garg et al.
patent: 2006/0069780 (2006-03-01), Batni et al.
patent: 2006/0190602 (2006-08-01), Canali et al.
patent: 2007/0124476 (2007-05-01), Oesterreicher et al.
patent: 2007/0245165 (2007-10-01), Fung
patent: 2007/0250631 (2007-10-01), Bali et al.
patent: 2007067652 (2007-06-01), None
R. Raghavendra et al., “No ‘power’ struggles: coordinated multi-level power management for the data center,” Proceedings of ASPLOS'08, Mar. 1-5, 2008, Seattle, Wash., USA.
J. Xu et al., “On the use of fuzzy modeling in virtualized data center management,” 4th Int'l Conf. on Autonomic Computing (ICAC'07), IEEE 2007.
R.A. Parameswaran et al., “Virtualization in system p,” Internet web site www.ibm.com/developerworks/aix/library/au-syspvirutalization, Nov. 13, 2007.
G. Qu et al., “Energy minimization with guaranteed quality of service,” Proceedings of ISLPED'00, Rapallo, Italy, 2000.
N. Banerjee et al., “Triage: balancing energy and quality of service in a microserver,” Proceedings of MobiSys'07, Jun. 11-13, 2007, San Juan, Puerto Rico, USA.
G. Chen et al., “Energy-aware server provisioning and load dispatching for connection-intensive Internet services,” Proceedings of NSDI'08, USENIX 2008.
R. Guerra et al., “Attaining soft real-time constraint and energy-efficiency in web servers,” Proceedings of SAC'08, Mar. 16-20, 2008, Fortaleza, Ceara, Brazil.

Affiliated with

Also associated with

Rating

Achieving at least substantially constant processing request... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Achieving at least substantially constant processing request..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achieving at least substantially constant processing request... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2633413