An Adaptive Algorithm for Information Dissemination in Self-Organizing Grids

• DOI: 10.1109/e-science.2006.21
• Publication Date: 2006-12-04
• Authors: D. Cenk Erdil; Michael Lewis; Nael Abu‐Ghazaleh
• Keywords: Information Dissemination

Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of large number distributed resources that comprise grid. Classical information dissemination approaches such as push, pull, and their combinations, are not well suited to problem resource tracking, where redundant full about all everywhere neither necessary nor desirable. Aggregated, partial, or probabilistic forwarding protocols result more efficient (but incomplete) dissemination, while maintaining sufficient enable effective scheduling. However, a static approach which treated identically, ineffective presence spatial temporal non-uniformity demands. For example, single probability for gossipping-based may unnecessarily high overhead some areas Moreover, right values can change over time, with changes offered load node utilization. Adaptive adjust aggressiveness disseminated, based on current grid conditions, turn increase query satisfaction rates, reduce overhead, both. This paper explores characteristics behavior adaptive change-sensitive protocols, identifying addressing several issues problems, introducing better able rates variety conditions.