Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1852
Title: Observing the Performance of Greedy algorithms for dynamic load balancing in Heterogeneous Distributed Computing System
Authors: Sahoo, Bibhudatta
Kumar, D
Jena, S K
Keywords: Heterogeneous distributed system
dynamic load balancing
makespan
greedy heuristic
Issue Date: 2012
Citation: 1st International Conference on Computing, Communication and Sensor Networks- CCSN,(2012),vol. 62, PIET, Rourkela, Odisha, pp. 265-269, 2012.
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.
Description: Copyright belongs to proceeding publisher
URI: http://hdl.handle.net/2080/1852
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
Greddy_BIBHU_NITR.pdf305.91 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.