Method and System for Load Balancing in a Distributed Computer System
AssigneePES Institute Of Technology
InventorLaksmikantha Hosahally Shashidhara
Life of this patent
Estimating the term…
Abstract
In an embodiment, a distributed computer system comprises a plurality of computers connected in substantial logical ring architecture. The computers are configured having a synchronized clock operation. At least one predetermined token designated with any one of a busy or an idle status circulates through the logical ring, wherein the computers are configured to check the status and give away or receive a predetermined job for completion, based on one or more predetermined conditions. Further, any deadlock generated is released by preempting the jobs based on predetermined criteria.
Claims35
A load balancing method using an idle token, in a distributed computer system, comprising:
- (i) connecting a plurality of computers in a substantial logical ring architecture based on one or more predetermined criteria;
- (ii) counting the number of idle and overloaded computers, periodically;
- (iii) circulating at least one predetermined idle token through the logical ring if the number of idle computers exceeds the number of overloaded computers;
- (iv) configuring at least one idle computer to acquire the idle token for framing and thereby circulating a message indicative of an idle state and the configuration data of the idle computer to other computers in the logical ring;
- and
- (v) configuring at least one overloaded computer to transfer a predetermined job to the idle computer for completion, based on the idle state and the suitability of the configuration to complete the job.
A load balancing method using a busy token, in a distributed computer system, comprising:
- (i) connecting a plurality of computers in a substantial logical ring architecture based on one or more predetermined criteria;
- (ii) counting the number of idle and overloaded computers periodically;
- (iii) circulating at least one predetermined busy token through the logical ring if the number of overloaded computers exceeds the number of idle computers;
- (iv) configuring at least one overloaded computer to acquire the busy token, frame and thereby circulate a message indicative of an overload status and the required resources for completing a predetermined job to other computers in the logical ring;
- and
- (v) configuring at least one idle computer to check the message and provide a job request to the overloaded computer depending upon the overload status and availability of required resources for completing the job, wherein the overloaded computer transfers the job to the idle computer subsequent to the request.
A distributed computer system, comprising:
- (i) a plurality of computers connected in a substantial logical ring architecture;
- (ii) said computers configured having a synchronized clock operation;
- and
- (iii) at least one predetermined token designated with any one of a busy or an idle status circulating through the logical ring, wherein the computers are configured to check the status and give away or receive a predetermined job for completion, based on one or more predetermined conditions.
Dependencies are inferred from the claim text.