- BlueGene/L Team. An overview of the BlueGene/L Supercomputer. IEEE Supercomputing and IBM Research Report (Nov. 2002). Google ScholarDigital Library
- Cantrill, B.M., Shapiro, M.W. and Leventhal, A.H. Dynamic instrumentation of production systems. Usenix 2004 Annual Technical Conference (Boston, MA, June 2004); http://www.usenix.org/event/usenix04/tech/general/full_papers/cantrill/cantrill.pdf. Google ScholarDigital Library
- Erlingsson, Ú., Peinado, M., Peter, S., Budiu and M. Fay: Extensible distributed tracing from kernels to clusters. In Proceedings of the 23 rd ACM Symposium on Operating Systems Principles, Cascais, Portugal (Oct. 2011); http://research.google.com/pubs/archive/37199.pdf. Google ScholarDigital Library
- Fonseca, R., Porter, G., Katz R., Shenker, S. and Stoica, I. X-Trace: A pervasive network-tracing framework. Usenix Symposium on Networked Systems Design and Implementation (Cambridge, MA, Apr. 2007). Google ScholarDigital Library
- Ganapathi, A., Chen, Y., Fox, A., Katz, R. H. and Patterson, D. A. Statistics-driven workload modeling for the cloud. Workshop on Self-Managing Database Systems at ICDE (2010), 87--92.Google ScholarCross Ref
- Ganapathi, A., Kuno, H. A., Dayal, U., Wiener, J. L., Fox, A., Jordan, M. I. and Patterson, D. A. Predicting multiple metrics for queries: Better decisions enabled by machine learning. International Conference on Data Engineering (2009) 592--603. Google ScholarDigital Library
- Gautam, A. and Stoica, I. ODR: output-deterministic replay for multicore debugging. ACM Symposium on Operating System Principles (2009), 193--206. Google ScholarDigital Library
- Nguyen, X., Huang, L. and Joseph, A. Support vector machines, data reduction, and approximate kernel matrices. In Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases (2008), 137--153. Google ScholarDigital Library
- Oliner, A.J. and Aiken, A. Online detection of multi-component interactions in production systems. In Proceedings of the International Conference on Dependable Systems and Networks (Hong Kong, 2011); http://adam.oliner.net/files/oliner_dsn_2011.pdf. Google ScholarDigital Library
- Oliner, A.J., Kulkarni, A.V. and Aiken, A. Using correlated surprise to infer shared influence. In Proceedings of the International Conference on Dependable Systems and Networks (Chicago, IL, 2010), 191--200; http://adam.oliner.net/files/oliner_dsn_2010.pdf.Google ScholarCross Ref
- Rabkin, A. and Randy, K. Chukwa: A system for reliable large-scale log collection. USENIX Conference on Large Installation System Administration (2010), 1--15. Google ScholarDigital Library
- Sigelman, B., Barroso, L., Burrows, M., Stephenson, P., Plakal, M., Beaver, D., Jaspan, S. and Shanbhag, C. Dapper, a large-scale distributed systems tracing infrastructure. Google Technical Report; http://research.google.com/archive/papers/dapper-2010-1.pdf.Google Scholar
- Thrun, S. et al. Stanley: The robot that won the DARPA Grand Challenge. Journal of Field Robotics 23, 9 (2006), 661--692. Google ScholarDigital Library
- Xu, M. et al. A "flight data recorder" for enabling full-system multiprocessor deterministic replay. In Proceedings of the 30 th annual International Symposium on Computer Architecture (San Diego, CA, June 2003). Google ScholarDigital Library
- Xu, W., Huang, L., Fox, A., Patterson, D. and Jordan, M. Detecting large-scale system problems by mining console logs. In Proceeding of the 22 nd ACM Symposium on Operating Systems Principles (Big Sky, MT, Oct. 2009). Google ScholarDigital Library
- Yuan, D., Zheng, J., Park, S., Zhou, Y. and Savage, S. Improving software diagnosability via log enhancement. In Proceedings of Architectural Support for Programming Languages and Operating Systems (Newport Beach, CA, Mar. 2011); http://opera.ucsd.edu/paper/asplos11-logenhancer.pdf. Google ScholarDigital Library
Index Terms
Advances and challenges in log analysis
Recommendations
Fully dynamic connectivity in O(log n(log log n)2) amortized expected time
SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete AlgorithmsDynamic connectivity is one of the most fundamental problems in dynamic graph algorithms. We present a new randomized dynamic connectivity structure with O(log n(log log n)2) amortized expected update time and O(log n/log log log n) query time, which ...
An O(log n log log n) space algorithm for undirected st-connectivity
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computingWe present a deterministic O(log n log log n) space algorithm for undirected st-connectivity. It is based on the deterministic EREW algorithm of Chong and Lam [6] and uses the universal exploration sequences for trees constructed by Koucký [13]. Our ...
Finding Connected Components in O(log n log log n) Time on the EREW PRAM
In this paper, a parallel algorithm for finding the connected components of an undirected graph is presented. On a graph with n vertices and m edges, the algorithm runs in O(log n log log n) time using n + m processors on an EREW (exclusive-read and ...
Comments