检索结果-内蒙古大学图书馆

Diagnosis of Performance Faults in Large Scale MPI Applications via Probabilistic Progress-Dependence Inference

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2015年第5期26卷 1280-1289页

作者： Laguna, Ignacio Ahn, Dong H. de Supinski, Bronis R. Bagchi, Saurabh Gamblin, Todd Lawrence Livermore Natl Lab Livermore CA 94550 USA Purdue Univ Dept Elect & Comp Engn W Lafayette IN 47907 USA

debugging large-scale parallel applications is challenging. Most existing techniques provide little information about failure root causes. Further, most debuggers significantly slow down program execution, and run sluggishly with massively parallel applications. This paper presents a novel technique that scalably infers the tasks in a parallel program on which a failure occurred, as well as the code in which it originated. Our technique combines scalable runtime analysis with static analysis to determine the least-progressed task(s) and to identify the code lines at which the failure arose. We present a novel algorithm that infers probabilistically progress dependence among MPI tasks using a globally constructed Markov model that represents tasks' control-flow behavior. In comparison to previous work, our algorithm infers more precisely the least-progressed task. We combine this technique with static backward slicing analysis, further isolating the code responsible for the current state. A blind study demonstrates that our technique isolates the root cause of a concurrency bug in a molecular dynamics simulation, which only manifests itself at 7,996 tasks or more. We extensively evaluate fault coverage of our technique via fault injections in 10 HPC benchmarks and show that our analysis takes less than a few seconds on thousands of parallel tasks.

关键词： distributed debugging MPI progress dependence parallel applications

来源：评论

学校读者我要写书评

暂无评论

PerfCompass: Online Performance Anomaly Fault Localization and Inference in Infrastructure-as-a-Service Clouds

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2016年第6期27卷 1742-1755页

作者： Dean, Daniel J. Nguyen, Hiep Wang, Peipei Gu, Xiaohui Sailer, Anca Kochut, Andrzej N Carolina State Univ Dept Comp Sci Raleigh NC 27603 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY USA

Infrastructure-as-a-service clouds are becoming widely adopted. However, resource sharing and multi-tenancy have made performance anomalies a top concern for users. Timely debugging those anomalies is paramount for minimizing the performance penalty for users. Unfortunately, this debugging often takes a long time due to the inherent complexity and sharing nature of cloud infrastructures. When an application experiences a performance anomaly, it is important to distinguish between faults with a global impact and faults with a local impact as the diagnosis and recovery steps for faults with a global impact or local impact are quite different. In this paper, we present PerfCompass, an online performance anomaly fault debugging tool that can quantify whether a production-run performance anomaly has a global impact or local impact. PerfCompass can use this information to suggest the root cause as either an external fault (e.g., environment-based) or an internal fault (e.g., software bugs). Furthermore, PerfCompass can identify top affected systemcalls to provide useful diagnostic hints for detailed performance debugging. PerfCompass does not require source code or runtime application instrumentation, which makes it practical for production systems. We have tested PerfCompass by running five common open source systems (e.g., Apache, MySQL, Tomcat, Hadoop, Cassandra) inside a virtualized cloud testbed. Our experiments use a range of common infrastructure sharing issues and real software bugs. The results show that PerfCompass accurately classifies 23 out of the 24 tested cases without calibration and achieves 100 percent accuracy with calibration. PerfCompass provides useful diagnosis hints within several minutes and imposes negligible runtime overhead to the production system during normal execution time.

关键词： Reliability, availability, and serviceability debugging aids distributed debugging performance

来源：评论

学校读者我要写书评

暂无评论

Jdebug: A Fast, Non-Intrusive and Scalable Fault Locating Tool for Ten-Million-Scale Parallel Applications

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2022年第12期33卷 3491-3504页

作者： Peng, Dajia Feng, Yunlong Liu, Yong Liu, Xin Xue, Wei Chen, Dexun Song, Jiawei Chen, Zuoning Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China Natl Supercomp Ctr Wuxi Wuxi Jiangsu Peoples R China Natl Res Ctr Parallel Comp Engn & Technol Beijing 100083 Peoples R China

This article presents Jdebug, a fast, non-intrusive and scalable fault locating tool for extreme-scale parallel applications. Large-scale debugging has drawn more attention with the increasing scale of supercomputers and applications. To eliminate program intrusion caused by traditional instrumentation or interception during debugging information acquisition, we introduce the out-of-band management into large-scale debugging. We propose a rapid information gathering scheme that separates user and debugging traffic to solve scalability problem and to eliminate program interference during merging data. Observations of Program Counters (PC) and performance characteristics in suspended applications find abnormalities and help locate abnormal threads caused by software errors or hardware failures effectively. Evaluation shows that Jdebug collects PCs of over 20 million cores on the new Sunway supercomputer within 1.97 seconds, and can locate the abnormal threads in 1.4 seconds with an accuracy of 92.5%. In the running test of three fundamental benchmarks (HPL, HPCG, Graph500) and seventeen real-world applications, Jdebug quickly and accurately locates abnormal threads to help find scalability errors and hardware failures including memory access failures, communication failures, and execution component failures, which validates its effectiveness.

关键词： debugging Servers Supercomputers Hardware Maintenance engineering Instruction sets Task analysis distributed debugging software engineering software software engineering testing and debugging

来源：评论

学校读者我要写书评

暂无评论

Retroscope: Retrospective Monitoring of distributed Systems

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2019年第11期30卷 2582-2594页

作者： Charapko, Aleksey Ailijiang, Ailidani Demirbas, Murat Kulkarni, Sandeep SUNY Buffalo Comp Sci & Engn Buffalo NY 14260 USA Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA

Retroscope is a comprehensive lightweight distributed monitoring tool that enables users to query and reconstruct past consistent global states of the system. Retroscope achieves this by augmenting the system with Hybrid Logical Clocks (HLC) and by streaming HLC-stamped event logs for storage and processing;these HLC timestamps are then used for constructing global (or nonlocal) snapshots upon request. Retroscope provides a rich querying language (RQL) to facilitate searching for global predicates across past consistent states. The search is performed by advancing through global states in small incremental steps, greatly reducing the amount of computation needed to construct consistent states. The Retroscope search algorithm is embarrassingly-parallel and can employ many worker processes (each processing up to 150,000 consistent snapshots per second) to handle a single query. We evaluate Retroscope's monitoring capabilities in two case studies: Chord and Apache ZooKeeper.

关键词： distributed debugging distributed applications tracing query languages

来源：评论

学校读者我要写书评

暂无评论

Detection of strong unstable predicates in distributed programs

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 1996年第12期7卷 1323-1333页

作者： Garg, VK Waldecker, B IBM CORP AUSTIN TX 78758 USA

This paper discusses detection of global predicates in a distributed program. A run of a distributed program results in a set of sequential traces, one for each process. These traces may be combined to form many global sequences consistent with the single run of the program. A strong global predicate is true in a run if it is true for all global sequences consistent with the run. We present algorithms which detect if the given strong global predicate became true in a run of a distributed program. Our algorithms can be executed on line as well as off line. Moreover, our algorithms do not assume that underlying channels satisfy FIFO ordering.

关键词： unstable predicates predicate detection distributed algorithms distributed debugging

来源：评论

学校读者我要写书评

暂无评论

debugging PARALLEL PROGRAMS WITH INSTANT REPLAY

引用

IEEE TRANSACTIONS ON COMPUTERS 1987年第4期36卷 471-482页

作者： LEBLANC, TJ MELLORCRUMMEY, JM Department of Computer Science University of Rochester

The debugging cycle is the most common methodology for finding and correcting errors in sequential programs. Cyclic debugging is effective because sequential programs are usually deterministic. debugging parallel programs is considerably more difficult because successive executions of the same program often do not produce the same results. In this paper we present a general solution for reproducing the execution behavior of parallel programs, termed Instant Replay. During program execution we save the relative order of significant events as they occur, not the data associated with such events. As a result, our approach requires less time and space to save the information needed for program replay than other methods. Our technique is not dependent on any particular form of interprocess communication. It provides for replay of an entire program, rather than individual processes in isolation. No centralized bottlenecks are introduced and there is no need for synchronized clocks or a globally consistent logical time. We describe a prototype implementation of Instant Replay on the BBN Butterfly™ Parallel Processor, and discuss how it can be incorporated into the debugging cycle for parallel programs.

关键词： CREW protocols distributed debugging execution replay parallel programming program instrumentation shared objects

来源：评论

学校读者我要写书评

暂无评论

Efficient detection of channel predicates in distributed systems

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 1997年第2期45卷 134-147页

作者： Garg, VK Chase, CM Kilgore, R Mitchell, JR Univ Texas Dept Elect & Comp Engn Austin TX 78712 USA

This paper discusses efficient detection of global predicates in a distributed program, Previous work in this area required predicates to be specified as a conjunction of predicates defined on individual processes, Many properties in distributed systems, however, use the state of channels, such as "the channel is empty," or "there is a token in the channel." In this paper, we introduce the concept of a linear channel predicate and provide efficient centralized and distributed algorithms to detect any conjunction of local and linear channel predicates, The class of linear predicates is fairly broad, For example, classic problems such as detection of termination and computation of global virtual time are instances of conjunctions of linear channel predicates, Linear predicates can be functions of the number of messages in the channel, or fan be based upon the actual contents of the messages, The main application of our results are in debugging and testing of distributed programs, For these applications it is important to detect the first state where some predicate is true, We show that this first state is uniquely defined if and only if linear predicates are used. (C) 1997 Academic Press.

关键词： distributed systems distributed debugging predicate detection channel predicate linear channel predicates

来源：评论

学校读者我要写书评

暂无评论

DETECTION OF WEAK UNSTABLE PREDICATES IN distributed PROGRAMS

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 1994年第3期5卷 299-307页

作者： GARG, VK WALDECKER, B AUSTIN SYST CTR SCHLUMBERGER WELL SERV AUSTINTX 78720

This paper discusses detection of global predicates in a distributed program. Earlier algorithms for detection of global predicates proposed by Chandy and Lamport work only for stable predicates. A predicate is stable if it does not turn false once it becomes true. Our algorithms detect even unstable predicates, without excessive overhead. In the past, such predicates have been regarded as too difficult to detect. The predicates are specified by using a logic described formally in this paper. We discuss detection of weak conjunctive predicates that are formed by conjunction of predicates local to processes in the system. Our detection methods will detect whether such a predicate is true for any interleaving of events in the system, regardless of whether the predicate is stable. Also, any predicate that can be reduced to a set of weak conjunctive predicates is detectable. This class of predicates captures many global predicates that are of interest to a programmer. The message complexity of our algorithm is bounded by the number of messages used by the program. The main applications of our results are in debugging and testing of distributed programs. Our algorithms have been incorporated in a distributed debugger that runs on a network of Sun workstations in UNIX.

关键词： UNSTABLE PREDICATES PREDICATE DETECTION distributed ALGORITHMS distributed debugging

来源：评论

学校读者我要写书评

暂无评论

Scalable Relative debugging

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2014年第3期25卷 740-749页

作者： Minh Ngoc Dinh Abramson, David Jin, Chao Monash Univ Fac Informat Technol Mulgrave Vic 3170 Australia Monash Univ Fac Informat Technol Clayton Vic 3800 Australia Univ Queensland Ctr Res Comp Brisbane Qld 4072 Australia Monash Univ Fac Informat Technol Mulgrave Vic 3170 Australia

Detecting and isolating bugs that arise only at high processor counts is a challenging task. Over a number of years, we have implemented a special debugging method, called "relative debugging," that supports debugging applications as they evolve or are ported to larger machines. It allows a user to compare the state of a suspect program against another reference version even as the number of processors is increased. The innovative idea is the comparison of runtime data to reason about the state of the suspect program. While powerful, a naive implementation of the comparison phase does not scale to large problems running on large machines. In this paper, we propose two different solutions including a hash-based scheme and a direct point-to-point scheme. We demonstrate the implementation, a case study, as well as the performance, of our techniques on 20K cores of a Cray XE6 system.

关键词： Parallellism and concurrency distributed debugging assertion checkers

来源：评论

学校读者我要写书评

暂无评论

debugging AND MONITORING HIGHLY PARALLEL SYSTEMS WITH GRIP

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROPROGRAMMING 1990年第1-5期28卷 79-84页

作者： VENABLES, PJ ZEDAN, H UNIV OXFORD PROGRAMMING RES GRPOXFORDENGLAND UNIV YORK DEPT COMP SCIYORK YO1 5DDN YORKSHIREENGLAND

This paper reports an investigation to build a tool for the debugging and monitoring of highly parallel systems. The investigation is based on the principle of folding/unfolding graphical user interface and materialised in the design of GRIP . Initially we based our investigation on transputer-based systems but will be extended in a later stage to incorporate other non-transputer-based parallel systems.

关键词： distributed debugging distributed Monitoring Parallel system occam

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：