Integer and combinatorial optimization
Integer and combinatorial optimization
Introduction to algorithms
Modern control theory (3rd ed.)
Modern control theory (3rd ed.)
Randomized algorithms
Web server workload characterization: the search for invariants
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
System identification (2nd ed.): theory for the user
System identification (2nd ed.): theory for the user
In search of invariants for e-business workloads
Proceedings of the 2nd ACM conference on Electronic commerce
Dynamically Discovering Likely Program Invariants to Support Program Evolution
IEEE Transactions on Software Engineering - Special issue on 1999 international conference on software engineering
Mining web logs for prediction models in WWW caching and prefetching
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Modern Information Retrieval
Tracking down software bugs using automatic anomaly detection
Proceedings of the 24th International Conference on Software Engineering
Discovering Web Access Patterns and Trends by Applying OLAP and Data Mining Technology on Web Logs
ADL '98 Proceedings of the Advances in Digital Libraries Conference
Web usage mining: discovery and applications of usage patterns from Web data
ACM SIGKDD Explorations Newsletter
Recovery Oriented Computing (ROC): Motivation, Definition, Techniques,
Recovery Oriented Computing (ROC): Motivation, Definition, Techniques,
Efficient incremental algorithms for dynamic detection of likely invariants
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
ADMiRe: An Algebraic Data Mining Approach to System Performance Analysis
IEEE Transactions on Knowledge and Data Engineering
Capturing, indexing, clustering, and retrieving system history
Proceedings of the twentieth ACM symposium on Operating systems principles
Tracking Probabilistic Correlation of Monitoring Data for Fault Detection in Complex Systems
DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
Modeling and Tracking of Transaction Flow Dynamics for Fault Detection in Complex Systems
IEEE Transactions on Dependable and Secure Computing
Why do internet services fail, and what can be done about it?
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Discovering Likely Invariants of Distributed Transaction Systems for Autonomic System Management
ICAC '06 Proceedings of the 2006 IEEE International Conference on Autonomic Computing
Ranking the importance of alerts for problem determination in large computer systems
ICAC '09 Proceedings of the 6th international conference on Autonomic computing
Mining invariants from console logs for system problem detection
USENIXATC'10 Proceedings of the 2010 USENIX conference on USENIX annual technical conference
Leveraging many simple statistical models to adaptively monitor software systems
International Journal of High Performance Computing and Networking
Mining temporal invariants from partially ordered logs
SLAML '11 Managing Large-scale Systems via the Analysis of System Logs and the Application of Machine Learning Techniques
Mining temporal invariants from partially ordered logs
ACM SIGOPS Operating Systems Review
Application dependency discovery using matrix factorization
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Inferring class level specifications for distributed systems
Proceedings of the 34th International Conference on Software Engineering
Using substructure mining to identify misbehavior in network provenance graphs
First International Workshop on Graph Data Management Experiences and Systems
Workload-aware anomaly detection for Web applications
Journal of Systems and Software
| Hi-index | 0.00 |
Distributed systems generate large amount of monitoring data such as log files to track their operational status. However, it is hard to correlate such monitoring data effectively across distributed systems and along observation time for system management. In previous work, we proposed a concept named flow intensity to measure the intensity with which internal monitoring data reacts to the volume of user requests. We calculated flow intensity measurements from monitoring data and proposed an algorithm to automatically search constant relationships between flow intensities measured at various points across distributed systems. If such relationships hold all the time, we regard them as invariants of the underlying systems. Invariants can be used to characterize complex systems and support various system management tasks. However, the computational complexity of previous invariant search algorithm is high so that it may not scale well in large systems with thousands of measurements. In this paper, we propose two efficient but approximate algorithms for inferring invariants in large-scale systems. The computational complexity of new randomized algorithms is significantly reduced and experimental results from a real system are also included to demonstrate the accuracy and efficiency of our new algorithms.