Performance Analysis of Greedy Load Balancing Algorithms in Heterogeneous Distributed Computing System

Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/2309

Full metadata record

DC Field	Value	Language
dc.contributor.author	Sahoo, Bibhudatta	-
dc.contributor.author	Kumar, D	-
dc.contributor.author	Jena, S K	-
dc.date.accessioned	2015-04-28T13:14:08Z	-
dc.date.available	2015-04-28T13:14:08Z	-
dc.date.issued	2014	-
dc.identifier.citation	International Conference on High Performance Computing and Applications (ICHPCA), Bhubaneswar, 22-24 Dec,2014	en_US
dc.identifier.isbn	978-1-4799-5957-0	-
dc.identifier.uri	http://hdl.handle.net/2080/2309	-
dc.description	Copy right belongs to proceeding publisher	en_US
dc.description.abstract	The Load balancing problem on Heterogeneous Distributed Computing System (HDCS) deals with allocation of tasks to compute nodes, so that computing nodes are evenly loaded. Dynamic load balancing problem to assign tasks on HDCS is presented as a linear programming problem to minimize the makespan. Different greedy resource allocation algorithms are presented for load balancing on HDCS with tasks as Expected Time to Compute(ETC) matrix. The relative performance of the four heuristic algorithms under different circumstances has been simulated on two different HDCS using in house simulator. The simulation results show that the greedy based scheduling policy has the significant impact on the system heterogeneity	en_US
dc.language.iso	en	en_US
dc.publisher	IEEE	en_US
dc.subject	Expected time to compute	en_US
dc.subject	Greedy algorithm	en_US
dc.subject	Heterogeneous distributed system	en_US
dc.subject	Load balancing	en_US
dc.subject	Makespan	en_US
dc.title	Performance Analysis of Greedy Load Balancing Algorithms in Heterogeneous Distributed Computing System	en_US
dc.type	Article	en_US
Appears in Collections:	Conference Papers

Files in This Item:

File	Description	Size	Format
HDLB_6page.pdf		113.95 kB	Adobe PDF	View/Open

Show simple item record