Observing the Performance of Greedy algorithms for dynamic load balancing in Heterogeneous Distributed Computing System

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

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	2013-01-31T09:25:02Z	-
dc.date.available	2013-01-31T09:25:02Z	-
dc.date.issued	2012	-
dc.identifier.citation	1st International Conference on Computing, Communication and Sensor Networks- CCSN,(2012),vol. 62, PIET, Rourkela, Odisha, pp. 265-269, 2012.	en
dc.identifier.uri	http://hdl.handle.net/2080/1852	-
dc.description	Copyright belongs to proceeding publisher	en
dc.description.abstract	Distributed systems have been an active research area in computer science for the last decade, task allocation and load balancing have been a major issue associated with such systems. The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i.e. the completion time at the maximum loaded computing node). Load balancing problem is a NP hard problem. This paper discusses the performance of some simple heuristic algorithms to solve load balancing problem with makespan as performance metric to minimize the makespan.	en
dc.format.extent	313254 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.subject	Heterogeneous distributed system	en
dc.subject	dynamic load balancing	en
dc.subject	makespan	en
dc.subject	greedy heuristic	en
dc.title	Observing the Performance of Greedy algorithms for dynamic load balancing in Heterogeneous Distributed Computing System	en
dc.type	Article	en
Appears in Collections:	Conference Papers

Files in This Item:

File	Description	Size	Format
Greddy_BIBHU_NITR.pdf		305.91 kB	Adobe PDF	View/Open