首页> 外文学位 >Run-time predicate monitoring for distributed systems.
【24h】

Run-time predicate monitoring for distributed systems.

机译:分布式系统的运行时谓词监视。

获取原文
获取原文并翻译 | 示例

摘要

The problem of global state detection and predicate monitoring is fundamental to distributed systems. All interactions in distributed systems can be analyzed in terms of the building block formed by pairwise interactions of intervals between two processes. Considering causality-based pairwise interactions by which two processes may interact with each other, there exists a rich class of orthogonal interactions. This work examines the problem: "If a global state of interest to an application is specified in terms of the pairwise interactions types between each pair of processes, how can such a global state be detected?" A solution identifies a global state in which the relation specified for each process pair is satisfied. Devising an efficient algorithm is a challenge because of the overhead of having to track the intervals at different processes. This work formulates the specific conditions on the exact communication structures to determine which of the intervals being examined at any time may never satisfy the stipulated relation for that pair of processes, and therefore that interval(s) must be deleted. One centralized and two distributed on-line algorithms are presented to solve the above problem.; In this work, for conjunctive predicates, we also show how to use these algorithms to detect the traditional Possibly and Definitely modalities along with the added information of the exact interaction type between each pair of intervals (one interval at each process). The polynomial time, space, and message complexities of the proposed on-line detection algorithms to detect Possibly and Definitely in terms of the rich class of interaction types per pair of processes, are the same as those of the earlier on-line algorithms that can detect only whether the Possibly and Definitely modalities hold. This work provides the theoretical background for the problem of temporal interactions in a distributed system and has potential applications in fields such as temporal data mining, synchronization and coordination, distributed debugging, sensor networks, and industrial process control.
机译:全局状态检测和谓词监视问题对于分布式系统至关重要。可以根据由两个过程之间的时间间隔的成对交互形成的构造块来分析分布式系统中的所有交互。考虑到基于因果关系的成对交互作用,两个过程可以通过这种交互作用进行交互,因此存在一类丰富的正交交互作用。这项工作研究了以下问题:“如果根据每对进程之间的成对交互类型指定了应用程序感兴趣的全局状态,那么如何检测到这种全局状态?”解决方案标识一个全局状态,在该状态下满足为每个进程对指定的关系。设计一种有效的算法是一项挑战,因为必须在不同的过程中跟踪间隔的开销。这项工作在确切的通信结构上制定了特定条件,以确定随时检查的哪个间隔可能永远无法满足该对过程的规定关系,因此必须删除一个或多个间隔。提出了一种集中式和两种分布式在线算法来解决上述问题。在本文中,对于连接谓语,我们还将展示如何使用这些算法来检测传统的“可能”和“绝对”模态,以及每对间隔(每个过程一个间隔)之间确切交互类型的附加信息。所提出的在线检测算法的多项式时间,空间和消息复杂性,可以根据每对进程的交互类型的丰富类来确定地进行确定性检测,这与早期的在线算法相同,可以仅检测“可能”和“绝对”模式是否成立。这项工作为分布式系统中的时间交互问题提供了理论背景,并在诸如时间数据挖掘,同步和协调,分布式调试,传感器网络和工业过程控制等领域具有潜在的应用。

著录项

  • 作者

    Chandra, Punit.;

  • 作者单位

    University of Illinois at Chicago.;

  • 授予单位 University of Illinois at Chicago.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2005
  • 页码 108 p.
  • 总页数 108
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号