Horus: Non-Intrusive Causal Analysis of Distributed Systems Logs

Francisco Neves, Nuno Machado, R. Vilaça, J. Pereira
{"title":"Horus: Non-Intrusive Causal Analysis of Distributed Systems Logs","authors":"Francisco Neves, Nuno Machado, R. Vilaça, J. Pereira","doi":"10.1109/DSN48987.2021.00035","DOIUrl":null,"url":null,"abstract":"Logs are still the primary resource for debugging distributed systems executions. Complexity and heterogeneity of modern distributed systems, however, make log analysis extremely challenging. First, due to the sheer amount of messages, in which the execution paths of distinct system components appear interleaved. Second, due to unsynchronized physical clocks, simply ordering the log messages by timestamp does not suffice to obtain a causal trace of the execution. To address these issues, we present Horus, a system that enables the refinement of distributed system logs in a causally-consistent and scalable fashion. Horus leverages kernel-level probing to capture events for tracking causality between application-level logs from multiple sources. The events are then encoded as a directed acyclic graph and stored in a graph database, thus allowing the use of rich query languages to reason about runtime behavior. Our case study with TrainTicket, a ticket booking application with 40+ microservices, shows that Horus surpasses current widely-adopted log analysis systems in pinpointing the root cause of anomalies in distributed executions. Also, we show that Horus builds a causally-consistent log of a distributed execution with much higher performance (up to 3 orders of magnitude) and scalability than prior state-of-the-art solutions. Finally, we show that Horus’ approach to query causality is up to 30 times faster than graph database built-in traversal algorithms.","PeriodicalId":222512,"journal":{"name":"2021 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSN48987.2021.00035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Logs are still the primary resource for debugging distributed systems executions. Complexity and heterogeneity of modern distributed systems, however, make log analysis extremely challenging. First, due to the sheer amount of messages, in which the execution paths of distinct system components appear interleaved. Second, due to unsynchronized physical clocks, simply ordering the log messages by timestamp does not suffice to obtain a causal trace of the execution. To address these issues, we present Horus, a system that enables the refinement of distributed system logs in a causally-consistent and scalable fashion. Horus leverages kernel-level probing to capture events for tracking causality between application-level logs from multiple sources. The events are then encoded as a directed acyclic graph and stored in a graph database, thus allowing the use of rich query languages to reason about runtime behavior. Our case study with TrainTicket, a ticket booking application with 40+ microservices, shows that Horus surpasses current widely-adopted log analysis systems in pinpointing the root cause of anomalies in distributed executions. Also, we show that Horus builds a causally-consistent log of a distributed execution with much higher performance (up to 3 orders of magnitude) and scalability than prior state-of-the-art solutions. Finally, we show that Horus’ approach to query causality is up to 30 times faster than graph database built-in traversal algorithms.
Horus:分布式系统日志的非侵入性因果分析
日志仍然是调试分布式系统执行的主要资源。然而,现代分布式系统的复杂性和异构性使得日志分析极具挑战性。首先,由于消息的数量庞大,其中不同系统组件的执行路径似乎是交错的。其次,由于物理时钟不同步,简单地按时间戳对日志消息排序不足以获得执行的因果跟踪。为了解决这些问题,我们提出了Horus,这是一个能够以因果一致和可扩展的方式改进分布式系统日志的系统。Horus利用内核级探测来捕获事件,以跟踪来自多个源的应用程序级日志之间的因果关系。然后将事件编码为有向无循环图并存储在图数据库中,从而允许使用丰富的查询语言来推断运行时行为。我们对TrainTicket(一个包含40多个微服务的订票应用程序)的案例研究表明,Horus超越了目前广泛采用的日志分析系统,能够精确定位分布式执行中异常的根本原因。此外,我们还展示了Horus构建分布式执行的因果一致日志,其性能(高达3个数量级)和可扩展性比之前的最先进的解决方案高得多。最后,我们表明Horus的查询因果关系的方法比图数据库内置遍历算法快30倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信