Debugging of Distributed Programs

分布式程序的调试

• 批准号: 9110605
• 负责人: Vijay Garg
• 金额: $ 5.91万
• 依托单位: University of Texas at Austin
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1991
• 资助国家: 美国
• 起止时间: 1991-08-01 至 1994-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9110605&HistoricalAwards=false
• 关键词: Debugging; Distributed; Programs

This is an investigation of issues in debugging distributed programs with large numbers of processes. Existing distributed debugging systems are simple extensions of sequential debugging systems and are inadequate for supporting message-based distributed programs. Distributed programs are inherently different from sequential programs due to the presence of nondeterminism, concurrency and communication delays. The research in distributed debugging supports both state-based and event-based approaches for debugging. The state-based is supported mainly by use of breakpoint predicates detection. A logic for specification of breakpoint predicates characterizes the most useful properties of global traces in a distributed environment. The logic is suitably defined to permit efficient detection of global predicates with out resort to computation of global snapshots. Algorithms have been developed to detect global predicates expressed as simple conjunction, disjunction or sequence of local predicates. These mechanisms can detect a large subset of predicates defined by the logic, even if the predicates are unstable. The main objective is to extend these algorithms for applicability to more general global predicates.

这是对调试具有大量进程的分布式程序的问题的调查。 现有的分布式调试系统是顺序调试系统的简单扩展，不足以支持基于消息的分布式程序。 由于存在不确定性、并发性和通信延迟，分布式程序本质上不同于顺序程序。 分布式调试的研究支持基于状态和基于事件的调试方法。 基于状态的支持主要通过使用断点谓词检测来支持。 断点谓词规范的逻辑表征了分布式环境中全局跟踪的最有用的属性。 该逻辑被适当地定义以允许有效地检测全局谓词，而不需要求助于全局快照的计算。 已经开发出算法来检测表示为简单合取、析取或局部谓词序列的全局谓词。 这些机制可以检测逻辑定义的谓词的大子集，即使谓词不稳定。 主要目标是将这些算法扩展到更通用的全局谓词。