arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2506.02002cs.DCcs.LG
收藏

用于一致性违规故障分析的机器学习

Machine Learning for Consistency Violation Faults Analysis

University of Wyoming(怀俄明大学)

Kamal Giri, Amit Garu

AI总结:

本文提出一种基于机器学习的分析方法,以Dijkstra令牌环为例量化一致性违规故障的影响,并通过FNN和分布式神经网络预测秩效应参数,实验验证了方法的有效性。

摘要:

分布式系统经常遇到一致性违规故障(CVFs),即节点基于过时或不准确的数据运行,从而对收敛性和整体系统性能产生不利影响。本研究提出了一种基于机器学习的方法来分析CVFs的影响,并以Dijkstra令牌环问题作为案例研究。通过计算程序转换秩及其对应效应,所提出的方法量化了CVFs对系统行为的影响。为了解决在较大图中遇到的状态空间爆炸问题,实现了两种模型:一个前馈神经网络(FNN)和一个利用TensorFlow的tf.distribute API的分布式神经网络。这些模型在由较小图(3到10个节点)生成的数据集上进行训练,以预测确定秩效应所必需的参数。实验结果表明性能良好,测试损失为4.39,平均绝对误差为1.5。尽管在CPU上进行分布式训练相比单设备设置并未带来显著的速度提升,但研究结果表明,通过使用GPU或TPU等先进硬件加速器可以增强可扩展性。

英文摘要:

Distributed systems frequently encounter consistency violation faults (cvfs), where nodes operate on outdated or inaccurate data, adversely affecting convergence and overall system performance. This study presents a machine learning-based approach for analyzing the impact of CVFs, using Dijkstra's Token Ring problem as a case study. By computing program transition ranks and their corresponding effects, the proposed method quantifies the influence of cvfs on system behavior. To address the state space explosion encountered in larger graphs, two models are implemented: a Feedforward Neural Network (FNN) and a distributed neural network leveraging TensorFlow's \texttt{tf.distribute} API. These models are trained on datasets generated from smaller graphs (3 to 10 nodes) to predict parameters essential for determining rank effects. Experimental results demonstrate promising performance, with a test loss of 4.39 and a mean absolute error of 1.5. Although distributed training on a CPU did not yield significant speed improvements over a single-device setup, the findings suggest that scalability could be enhanced through the use of advanced hardware accelerators such as GPUs or TPUs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑