Topology aggregation for hierarchical routing in ATM networks
ACM SIGCOMM Computer Communication Review
Topology information condensation in hierarchical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Future Generation Computer Systems - Special issue on metacomputing
Journal of Parallel and Distributed Computing
A taxonomy and survey of grid resource management systems for distributed computing
Software—Practice & Experience
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
ACM Transactions on Computer Systems (TOCS)
Scheduling with Advanced Reservations
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Grid Information Services for Distributed Resource Sharing
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
Software—Practice & Experience
Grid Resource Monitoring and Selection for Rapid Turnaround Applications
IEICE - Transactions on Information and Systems
Topology aggregation for combined additive and restrictive metrics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fair Scheduling Algorithms in Grids
IEEE Transactions on Parallel and Distributed Systems
Routing and scheduling connections in networks that support advance reservations
Computer Networks: The International Journal of Computer and Telecommunications Networking
Spectral Clustering Scheduling Techniques for Tasks with Strict QoS Requirements
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Fault tolerant aggregation in heterogeneous sensor networks
Journal of Parallel and Distributed Computing
Fair resource sharing in hierarchical virtual organizations for global grids
GRID '07 Proceedings of the 8th IEEE/ACM International Conference on Grid Computing
Resource Information Aggregation in Hierarchical Grid Networks
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Grid broker selection strategies using aggregated resource information
Future Generation Computer Systems
A taxonomy of grid monitoring systems
Future Generation Computer Systems
Trust overlay networks for global reputation aggregation in P2P grid computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
A task routing approach to large-scale scheduling
Future Generation Computer Systems
ProFID: Practical frequent items discovery in peer-to-peer networks
Future Generation Computer Systems
Distance-aware bloom filters: Enabling collaborative search for efficient resource discovery
Future Generation Computer Systems
Hi-index | 0.00 |
We consider information aggregation as a method for reducing the information exchanged in a Grid network and used by the resource manager in order to make scheduling decisions. In this way, information is summarized across nodes and sensitive or detailed information can be kept private, while resources are still publicly available for use. We present a general framework for information aggregation, trying to identify issues that relate to aggregation in Grids. In this context, we describe a number of techniques, including single point and intra-domain aggregation, define appropriate grid-specific domination relations and operators for aggregating static and dynamic resource information, and discuss resource selection optimization functions. The quality of an aggregation scheme is measured both by its effects on the efficiency of the scheduler's decisions and also by the reduction it brings on the amount of resource information recorded, a tradeoff that we examine in detail. Simulation experiments demonstrate that the proposed schemes achieve significant information reduction, either in the amount of information exchanged, or in the frequency of the updates, while at the same time maintaining most of the value of the original information as expressed by a stretch factor metric we introduce.