TY - GEN
T1 - An adaptive algorithm for information dissemination in self-organizing grids
AU - Erdil, Deger Cenk
AU - Lewis, Michael J.
AU - Abu-Ghazaleh, Nael B.
PY - 2006
Y1 - 2006
N2 - Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise the grid. Classical distributed information dissemination approaches such as push, pull, and their combinations, are not well suited to the problem of resource tracking, where resources are redundant and full information about all resources everywhere is neither necessary nor desirable. Aggregated, partial, or probabilistic forwarding protocols result in more efficient (but incomplete) dissemination, while maintaining sufficient information to enable effective scheduling. However, a static approach to dissemination in which all information is treated identically, is ineffective in the presence of spatial and temporal non-uniformity of resources and demands. For example, a single forwarding probability for gossipping-based dissemination may result in unnecessarily high overhead in some areas of the grid. Moreover, the right forwarding probability values can change over time, with changes in offered load and node utilization. Adaptive protocols can adjust the aggressiveness with which information is disseminated, based on current grid conditions, and can in turn increase query satisfaction rates, reduce overhead, or both. This paper explores the characteristics and behavior of adaptive probabilistic and change-sensitive information forwarding protocols, identifying and addressing several issues and problems, and introducing dissemination protocols that are better able to reduce over-head and increase query satisfaction rates for a variety of grid conditions.l
AB - Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise the grid. Classical distributed information dissemination approaches such as push, pull, and their combinations, are not well suited to the problem of resource tracking, where resources are redundant and full information about all resources everywhere is neither necessary nor desirable. Aggregated, partial, or probabilistic forwarding protocols result in more efficient (but incomplete) dissemination, while maintaining sufficient information to enable effective scheduling. However, a static approach to dissemination in which all information is treated identically, is ineffective in the presence of spatial and temporal non-uniformity of resources and demands. For example, a single forwarding probability for gossipping-based dissemination may result in unnecessarily high overhead in some areas of the grid. Moreover, the right forwarding probability values can change over time, with changes in offered load and node utilization. Adaptive protocols can adjust the aggressiveness with which information is disseminated, based on current grid conditions, and can in turn increase query satisfaction rates, reduce overhead, or both. This paper explores the characteristics and behavior of adaptive probabilistic and change-sensitive information forwarding protocols, identifying and addressing several issues and problems, and introducing dissemination protocols that are better able to reduce over-head and increase query satisfaction rates for a variety of grid conditions.l
KW - Adaptive information dissemination
KW - Grid resource discovery
KW - Self-organizing grids
UR - https://www.scopus.com/pages/publications/38449110636
U2 - 10.1109/E-SCIENCE.2006.261156
DO - 10.1109/E-SCIENCE.2006.261156
M3 - Conference contribution
SN - 0769527345
SN - 9780769527345
T3 - e-Science 2006 - Second IEEE International Conference on e-Science and Grid Computing
BT - e-Science 2006 - Second IEEE International Conference on e-Science and Grid Computing
T2 - e-Science 2006 - 2nd IEEE International Conference on e-Science and Grid Computing
Y2 - 4 December 2006 through 6 December 2006
ER -