Scheduling efficiency of resource information aggregation in grid networks

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.

[1]  Kai Hwang,et al.  Trust overlay networks for global reputation aggregation in P2P grid computing , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[2]  Rajkumar Buyya,et al.  A taxonomy and survey of grid resource management systems for distributed computing , 2002, Softw. Pract. Exp..

[3]  Sanjay Ranka,et al.  Fault tolerant aggregation in heterogeneous sensor networks , 2009, J. Parallel Distributed Comput..

[4]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[5]  Liana L. Fong,et al.  Grid broker selection strategies using aggregated resource information , 2010, Future Gener. Comput. Syst..

[6]  Henri Casanova,et al.  An Evaluation of Job Scheduling Strategies for Divisible Loads on Grid Platforms , 2006 .

[7]  Richard Wolski,et al.  The network weather service: a distributed resource performance forecasting service for metacomputing , 1999, Future Gener. Comput. Syst..

[8]  Warren Smith,et al.  Scheduling with advanced reservations , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[9]  Rizos Sakellariou,et al.  A taxonomy of grid monitoring systems , 2005, Future Gener. Comput. Syst..

[10]  Emmanouel A. Varvarigos,et al.  Spectral Clustering Scheduling Techniques for Tasks with Strict QoS Requirements , 2008, Euro-Par.

[11]  Emmanouel A. Varvarigos,et al.  Resource Information Aggregation in Hierarchical Grid Networks , 2009, 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid.

[12]  Whay C. Lee,et al.  Topology aggregation for hierarchical routing in ATM networks , 1995, CCRV.

[13]  Alexandru Iosup,et al.  The Grid Workloads Archive , 2008, Future Gener. Comput. Syst..

[14]  Robbert van Renesse,et al.  Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining , 2003, TOCS.

[15]  Piet Van Mieghem Topology Information Condensation in Hierarchical Networks , 1999, Comput. Networks.

[16]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[17]  Emmanouel A. Varvarigos,et al.  Fair Scheduling Algorithms in Grids , 2007, IEEE Transactions on Parallel and Distributed Systems.

[18]  Paolo Scotton,et al.  Topology aggregation for combined additive and restrictive metrics , 2006, Comput. Networks.

[19]  David Abramson,et al.  Scheduling parameter sweep applications on global Grids: a deadline and budget constrained cost–time optimization algorithm , 2005, Softw. Pract. Exp..

[20]  Ian T. Foster,et al.  Grid information services for distributed resource sharing , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[21]  Ariel Orda,et al.  Networks with advance reservations: the routing perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  Keqin Li,et al.  Experimental performance evaluation of job scheduling and processor allocation algorithms for grid computing on metacomputers , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[23]  Fumihiko Ino,et al.  Grid Resource Monitoring and Selection for Rapid Turnaround Applications , 2005, IEICE Trans. Inf. Syst..

[24]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[25]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[26]  Wolfgang Blochinger,et al.  Capability-Aware Information Aggregation in Peer-to-Peer Grids , 2009, Journal of Grid Computing.

[27]  Kai Hwang,et al.  Distributed Aggregation Algorithms with Load-Balancing for Scalable Grid Resource Monitoring , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[28]  Ruth A. Aydt,et al.  A Grid Monitoring Architecture , 2002 .

[29]  Emmanouel A. Varvarigos,et al.  Routing and scheduling connections in networks that support advance reservations , 2008, 2008 5th International Conference on Broadband Communications, Networks and Systems.

[30]  Rajkumar Buyya,et al.  Fair resource sharing in hierarchical virtual organizations for global grids , 2007, 2007 8th IEEE/ACM International Conference on Grid Computing.

[31]  Péter Kacsuk,et al.  A Taxonomy of Grid Resource Brokers , 2007 .