Full metadata record
DC FieldValueLanguage
dc.contributor.authorDaraghmi, Eman Yasseren_US
dc.contributor.authorYuan, Shyan Mingen_US
dc.date.accessioned2015-12-02T03:00:59Z-
dc.date.available2015-12-02T03:00:59Z-
dc.date.issued2013-01-01en_US
dc.identifier.isbn978-1-4799-2418-9en_US
dc.identifier.issnen_US
dc.identifier.urihttp://dx.doi.org/10.1109/PDCAT.2013.17en_US
dc.identifier.urihttp://hdl.handle.net/11536/128639-
dc.description.abstractIn this paper, we present a novel in-domain neighborhood approach to clarify the dynamic load balancing problem on a heterogeneous network and to solve many practical problems. The distributed system consists of a network of workstations with different domains, speeds and capacities. Since the number of workstations and the diameter of the network affect the convergences rate, our approach introduces the in-domain relation that classifies the entire network into sub-networks called domains. The algorithm runs in each workstation in order to reach the fairness state in-domain and in entire network rapidly. In this paper, our approach is applied to a cafeteria system as a case study, each workstation is viewed as a cafeteria where the maximum number of orders that can be submitted to one cafeteria corresponds to the capacity of that cafeteria workstation, the communication channels are modeled between the in-domain cafeterias, and the workload is represented as orders. An algorithm is presented to simulate the migration of the orders between in-domain cafeterias and to distribute a proportion of the excessive workload of heavily loaded node to lightly loaded node by considering the capacity of each node such that when the algorithm terminates, the effective-load in all cafeterias is the same. Therefore, each workstation receives an amount of workload proportional to its total capacity. This framework is analyzed mathematically, and it is proved that the proposed algorithm converges and achieves the fairness state.en_US
dc.language.isoen_USen_US
dc.subjectDynamic load balancingen_US
dc.subjectfairness stateen_US
dc.subjectconvergenceen_US
dc.subjectheterogeneousen_US
dc.subjectin-domain neighborhooden_US
dc.titleIn-domain neighborhood approach to heterogeneous dynamic load balancing in real world networken_US
dc.typeProceedings Paperen_US
dc.identifier.doi10.1109/PDCAT.2013.17en_US
dc.identifier.journal2013 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES (PDCAT)en_US
dc.citation.spage63en_US
dc.citation.epage70en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000361018500011en_US
dc.citation.woscount0en_US
Appears in Collections:Conferences Paper