Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Future Generation Computer Systems - Special issue on metacomputing
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Grid Information Services for Distributed Resource Sharing
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Engineering Self-Organising Systems
Engineering Self-Organising Systems
A scalable distributed information management system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Analysis of Query Matching Criteria and Resource Monitoring Models for Grid Application Scheduling
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
Adaptive Approach to Information Dissemination in Self-Organizing Grids
ICAS '06 Proceedings of the International Conference on Autonomic and Autonomous Systems
An Adaptive Algorithm for Information Dissemination in Self-Organizing Grids
E-SCIENCE '06 Proceedings of the Second IEEE International Conference on e-Science and Grid Computing
Proceedings of the 16th international symposium on High performance distributed computing
Grid Resource Scheduling with Gossiping Protocols
P2P '07 Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Hi-index | 0.00 |
Increasing scale, dynamism, and complexity of hybrid grids make traditional grid resource scheduling approaches difficult. In such grids, where resource volatility and dynamism is common, self-organization is a key technique for autonomous grid nodes to follow basic rules to minimize human participation, and administrative bottlenecks. This paper presents experimental results with a framework for distributed grid resource scheduling. In particular, we study information dissemination, which distributes information about dynamic grid resource states to remote schedulers. The framework helps each autonomous grid node self-organize by (1) self-configuring its operational parameters based on dynamic grid characteristics, and (2) self-adjusting its dissemination behavior by taking feedback from the system. The framework also helps distributed grid schedulers to find the tradeoff between two important performance parameters: dissemination overhead, and query satisfaction rates. We show by simulation that autonomous grid nodes that self-organize into small groups, and compare their local state to the states of other peer nodes, can perform comparable to both (1) similar dissemination protocols that are statically configured for each specific case, and (2) a theoretical central metascheduler that operates on complete knowledge of available resource and offered load states.