On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments

Shah, R.N.; Veeravalli, Bharadwaj; Misra, Manoj

doi:10.1109/tpds.2007.1115

Cited by 113 publications

(79 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Similarly in maxmin scheduling tasks with maximum completion time is selected and assigned to processor, due to which smaller tasks are assigned after long time to available processors [9]. Solution for above is to apply load balancing concept with this types of scheduling.…”

Section: Load Balancing In Distributed Systemmentioning

confidence: 99%

Scheduling Tasks in Heterogeneous System using Load Balancing Algorithm

Patil¹,

Ade²

2017

IJCA

View full text Add to dashboard Cite

Innovative idea of distributing the tasks to their best processor to reduce the execution time of task by using various scheduling techniques is given in this paper. This paper presents hybrid scheduling techniques which provide better solution of scheduling task that means combination of different scheduling provides better performance without degrading the result quality. Scheduling algorithms such as MinMin+, MaxMin+ and Sufferage+ are suitable for overcomes the drawback of previously used scheduling methods such as MinMin, MaxMin and Sufferage as well as scheduling in this paper provides better complexity as compare to previous scheduling methods. This scheduling are also suitable for heterogeneous environment more effectively to execute different set of task on different processors with different configurations. To get better the show of the existing system we have to improve existing algorithm with the load balancing.So same load should overloaded to all processors.The future algorithm have implement with detailed pseudocodes.

show abstract

Section: Load Balancing In Distributed Systemmentioning

confidence: 99%

Scheduling Tasks in Heterogeneous System using Load Balancing Algorithm

Patil¹,

Ade²

2017

IJCA

View full text Add to dashboard Cite

show abstract

“…Unlike other approaches [32,33] which make instant job delegation decisions depending on information periodically exchanged from all nodes of the grid; the h request first invokes interface it neighbors to fetch an address list of known remote nodes, which is periodically updated by an external resource discovery service employed for this. Later on, the h request sends a job delegation request, which is comprised of information such as job characteristic and number of message replicas, to each known remote node.…”

Section: Y Huang Et Al / Future Generation Computer Systems (mentioning

confidence: 99%

Exploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithm

Huang

Bessis

Norrington

et al. 2013

Future Generation Computer Systems

View full text Add to dashboard Cite

“…Small-scale distributed Computing Infrastructure that supports the resource sharing and coordinated use of geographically distributed and multi-owner, multiadministrative domain resources independently from their physical type and location in dynamic virtual organizations that share the same goal of solving large-scale applications [12]. Distributed systems are collection of autonomous processing nodes connected by a communication network.…”

Section: Introductionmentioning

confidence: 99%

Dynamic and Decentralized Load Balancing Approach in Small Scale Distributed Systems

Dharmik¹,

Sathe²

2017

Sixth International Conference on Advances in Computing, Control and Networking - ACCN 2017

View full text Add to dashboard Cite

Abstract:To improve the throughput of small-scale distributed systems, workloads have to be evenly distributed among all the computing nodes of distributed systems. As any distributed application, can undergo critical performance issues due to workload imbalances on small scale distributed system and heterogeneity of resources. The main goal to prevent, if possible, the condition where some processors are overloaded with set of jobs while other processors are lightly loaded, moderately loaded, heavily loaded and some may be idle processors. This is due to the characteristics of distributed systems and complex nature of the users job. In this paper we have proposed real-time prototype model for small-scale distributed systems. Dynamic and decentralized load balancing algorithm has been implemented to evenly distribution of jobs among all the computing nodes of small-scale distributed systems through which to minimize execution time, response time, communication latency and maximize throughput, CPU utilization. It is beneficial for all those researches who want to make more enhance and efficient load balancing techniques for real-time distributed systems in near future.

show abstract

On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments

Cited by 113 publications

References 20 publications

Scheduling Tasks in Heterogeneous System using Load Balancing Algorithm

Scheduling Tasks in Heterogeneous System using Load Balancing Algorithm

Exploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithm

Dynamic and Decentralized Load Balancing Approach in Small Scale Distributed Systems

Contact Info

Product

Resources

About