Game-Theoretic Approach for Load Balancing in Computational Grids

Subrata, R.; Zomaya, Albert Y.; Landfeldt, Bjorn

doi:10.1109/tpds.2007.70710

Cited by 105 publications

(60 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [3] and [11], since the proposed solution is centralized, the authors quantified the connection quality of each node by dividing its transmission rate by the network bandwidth of the dispatcher. In [40] the network performance between two sites is calculated using two parameters: transmission delay representing the start-up cost and contention delays at intermediate links and a data transmission rate representing the available bandwidth.…”

Section: Resource Assignment To the Polyhedron Topologymentioning

confidence: 99%

See 1 more Smart Citation

Topology Aware Load Balancing for Grids

Barkallah

Gzara

Ben-Abdallah

2017

IJGCA

View full text Add to dashboard Cite

KEYWORDSGrid computing, meta-scheduling, distributed load balancing, topology-aware. 1.INTRODUCTIONGrid computing[1] extends existing distributed computing to a more unified and collaborative structure. It enables multiple computing resources, that are geographically distributed and owned by different individuals or organizations, to be logically coupled to form the illusion of a powerful super computer with infinite capacity [2].Scheduling and load balancingare essential grid software infrastructure services. Theseservices assigntasks to nodes(i.e. computing resources) and transfer tasks from overloaded to under-loaded nodesin orderto maximizeresource utilization on one hand,and minimizing the total task's execution time on the other hand. Considering the grid load balancing problem, several solutions have been proposed using different methods and strategies, e.g., [3] Among the most critical issues pertaining to grids is how to manage the resources [4]. In the proposed solution, the grid resources are organized according to a logical topology called theresource managementmodel [4]. This topology/model defines how the different grid entities communicate and work in order to achieve the received jobs/tasks. R. Buyyaet al. proclaimed that the choice of the right model for the resource management architecture plays a major role in its eventual (commercial) success [4].The motivation behind this paperis based on the observation that the load balancing problem can be improved by simply improving the classical used models tree, star, and P2Pand further proposing a new one; a polyhedron sphere like model that was introduced for the first time in [14]. This logical model has the merit of providing optimized load balancing in a stateless context. It guarantees a high level of decentralization and scalability of the load balancing process leading tobetter resource utilization rates and minimum tasks execution time. Therefore,this work proposes adecentralizedtopology-awareload balancing solutionfor independent tasks in a grid environment

show abstract

Section: Resource Assignment To the Polyhedron Topologymentioning

confidence: 99%

“…System speedup in case of 100, 1000, and 10000 tasks running under 10 and Figure 12.Average system speedup variation using 10,20,30,40, and 50 resources.…”

Section: Load Balancing Performancementioning

confidence: 99%

Topology Aware Load Balancing for Grids

Barkallah

Gzara

Ben-Abdallah

2017

IJGCA

View full text Add to dashboard Cite

show abstract

“…Further, this treatment implied that all user requests are the same thereby preventing individual users to negotiate based on their demand, priority and budget availability. In addition, despite recent attempts to model the scheduling problem in a non-cooperative way [29], this line of research has not considered an economic framework using which agents could trade resources.…”

Section: Related Workmentioning

confidence: 99%

“…It presented the equilibrium behavior of the model when the interaction results in stochastic demand which is satisfied according to guaranteed quality of service standards. Further, given that efficiently balancing the load on the grid implied by these jobs is important, [29] developed a game theoretic solution to the load balancing problem.…”

Section: Related Workmentioning

confidence: 99%

Existence of Market Equilibria for Grid Computing

Shrimali¹,

Tayi²

2012

View full text Add to dashboard Cite

Grid computing has emerged as an effective mechanism for allocating globally available surplus computational capacity to applications whose requirements exceed local capacity. It is often viewed as a commodity exchange with additional grid computing specific constraints that may arise due to requirements on multiple resources (e.g., disk space) in addition to computing power. These constraints are related to complementarity and substitution effects among resources, and significantly alter the assumptions typically used for demonstrating the existence of market equilibrium. However, prior work in grid computing has simply assumed that market equilibria exist. Our work fills this gap by studying the existence of market equilibrium under the grid computing environment. To do so, we first establish an economic framework that incorporates the grid computing specific constraints into a commodity market. We next derive some intuitive necessary conditions based on the computing requirements of individual agents. We finally establish the existence of regular markets as a competitive equilibrium, given that these necessary conditions are met and that the agents' utility functions satisfy some minimal requirements. In the process, we also show existence of competitive equilibrium for the special case of grid computing as a pure exchange economy 1 .

show abstract

“…A game-theoretic-based solution to the grid load-balancing problem has been proposed in Subrata et al (2008). The developed algorithm combines the inherent efficiency of the centralised approach and the fault-tolerant nature of the decentralised approach.…”

Section: Introductionmentioning

confidence: 99%

A combination of game theory and genetic algorithm for load balancing in distributed computer systems

Chronopoulos

Siar

Kiani

2017

IJAIP

View full text Add to dashboard Cite

High demand of computation and communication in recent decades has increased the importance of distributed computer systems. Because of the heterogeneity of resources, resource management is one of the main challenges in designing distributed computer systems. In this paper, a new method has been proposed for solving load balancing problem in distributed computer systems using game theory and a genetic algorithm. The load balancing problem has been modelled as a non-cooperative game among users of the system. The payoff function of players was computed using an introduced parameter in order to decrease the users' expected response time. Certain Nash equilibriums are unstable in a multi agent problem. Thus, a genetic algorithm based on the concept of Nash equilibrium is used for solving the load balancing game. Simulation results show the performance of the proposed load balancing algorithm in terms of the expected response time and fairness index as parameters in evaluating the performance of load balancing algorithms.

show abstract

Game-Theoretic Approach for Load Balancing in Computational Grids

Cited by 105 publications

References 19 publications

Topology Aware Load Balancing for Grids

Topology Aware Load Balancing for Grids

Existence of Market Equilibria for Grid Computing

A combination of game theory and genetic algorithm for load balancing in distributed computer systems

Contact Info

Product

Resources

About