Abstract

Tabu search algorithm like simulated annealing or evolutionary algorithm or genetic algorithm and guided local search algorithm is a effective solution of optimization problem. This is the most comprehensive combinatorial optimization technique available for treating difficult problems. It is a neighborhood based search method which is very useful in distributed system for monitoring application. Distributed operation of Applications involve: Multiple applications deployed over different sets of hosts e. g. Datacenters. Application State monitored the performance of both systems and applications running on large-scale distributed systems. It is constantly collecting detailed performance attribute values as a large number of nodes & a large number of attributes. Tricky task of Resource aware application state monitoring is the monitoring overlay construction. In this method first, it jointly considers inter-task cost sharing opportunity and node-level resource constraints. Further, it clearly models the per-message processing overhead which can be extensive but is often ignored by earlier works. Second, REMO produces a forest of optimized monitoring trees through iterations of two phases. One stage explores cost-sharing opportunities between tasks, and the other refines the tree with resource-sensitive construction schemes. REMO also included an adaptive algorithm that balances the profit and costs of cover adaptation. This is helpful for large systems with continuously changing monitoring tasks.

References

• Shicong Meng, Student Member, IEEE, Srinivas R. Kashyap,Chitra Venkatramani, and Ling Liu, Senior Member, IEEE. Vol. 23, No. 12, DECEMBER 2012
• K. Park and V. S. Pai, Comon: a mostly-scalable monitoring system for planetlab, Operating Systems Review, vol. 40, no. 1, pp. 6574, 2006. Fröhlich, B. and Plate, J. 2000. The cubic mouse: a new device for three-dimensional input. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems.
• D. J. Abadi, S. Madden, and W. Lindner, Reed: Robust, efficient filtering and event detection in sensor networks, in VLDB, 2005.
• G. Cormode and M. N. Garofalakis, Sketching streams through the net: Distributed approximate query tracking, in VLDB, 2005, pp. 1324.
• P. Yalagandula and M. Dahlin, A scalable distributed information management system, in SIGCOMM, 2004, pp. 379390.
• U. Srivastava, K. Munagala, and J. Widom, Operator placement for in-network stream query processing, in PODS, 2005, pp. 250258.
• C. Olston, B. T. Loo, and J. Widom, Adaptive precision setting for cached approximate values, in SIGMOD, 2001.
• S. Meng, S. R. Kashyap, C. Venkatramani, and L. Liu, Remo: Resource-aware application state monitoring for large-scale distributed systems, in ICDCS, 2009, pp. 248255.
• R. Huebsch, B. N. Chun, J. M. Hellerstein, B. T. Loo, P. Maniatis, T. Roscoe, S. Shenker, I. Stoica, and A. R. Yumerefendi, The architecture of pier: an internet-scale query processor, in CIDR, 2005.
• A. Silberstein, R. Braynard, and J. Yang, "Constraint Chaining: On Energy-Efficient Continuous Monitoring in Sensor Networks," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD), 2006.