Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
NEEMON Algorithm Based on Data Locality for Priority Based Dynamic Load Balancing in Distributed Database
verfasst von : Neera Batra, A. K. Kapil
Erschienen in: Information Processing and Management
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A load balancing scheme comprises of three phases: information collection, decision making based on information and data migration. In distributed database, it is important to take data locality into account, since they have big impact on the communication requirements. Several techniques are proposed for balancing the load in homogeneous applications but still some improvement in terms of efficiency is required. In this paper, we present a load balancing architecture that can deal with homogeneous applications in distributed database [3] more efficiently. In our proposed architecture, memory utilization based priority method is used and data locality is also taken into consideration along with process waiting time and data transmission time. We have developed a load balancing algorithm which balances the load on different nodes working in homogeneous environment in a fragmented distributed database.