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

Extending a traditional debugger to debug massively parallel applications

JOURNAL OF parallel AND DISTRIBUTED COMPUTING 2004年第5期64卷 617-628页

作者： Balle, SM Brett, BR Chen, CP LaFrance-Linden, D Hewlett Packard Corp Nashua NH 03062 USA

Beowulf systems, and other proprietary approaches, are placing systems with four or more CPUs in the hands of many researchers and commercial users. In the near future, systems with hundreds of CPUs will become commonly available, with some programmers dealing with tens of thousands of CPUs. The debugging methods used on these systems are a combination of the traditional methods used for debugging single processes and ad-hoc methods to help the user cope with the multitudes of processes. Programmers are usually familiar with a single-process debugger and would like to use it (with minimal user-visible extensions) to debug their distributed program. We present a set of modifications to a traditional debugger that makes it capable of debugging applications running on thousands of processes. Our parallel debugger is composed of individual fully functional debuggers connected with an n-nary aggregating network. This permits us to present to users the results from each debugger at the same time in an aggregated fashion. Users get a global view of the application and can easily see if a given parameter has a different value from either what they expect it to be or from the other processes. Users can then focus on the process sets of interest and investigate the problem. One challenge when debugging thousands of processes is to deal with the amount of output coining from all the debuggers. We present methods to aggregate the overwhelming amount of output from the debuggers into a more manageable subset, which is presented to the user without losing information. Experiments show that the debugger is scalable to thousands of processors. The startup mechanism, as well as users' command response time scale well. The conclusions presented regarding the architecture and the new parallel debugger's scalability are not specific to the serial debugger we are using in our example implementation. (C) 2004 Elsevier Inc. All rights reserved.

关键词： parallel debugging parallel debugger distributed breakpoints parallel programming massively parallel debugging Ladebug (TM)

来源：评论

学校读者我要写书评

暂无评论

Execution replay of parallel procedural programs

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2000年第10期46卷 835-849页

作者： de Kergommeaux, JC Fagot, A ID IMAG Project APACHE F-38041 Grenoble 9 France

This article describes an execution model for the parallel procedural programming paradigm, which combines multithreading and communications. The model is used to prove sufficient conditions to guarantee the equivalence between two executions of the same program. An efficient mechanism for recording and replaying deterministically parallel procedural programs is derived from the model and implemented in a prototype. Performed on the prototype, systematic measurements of the time overhead of recording traces for replaying various program models indicate that this overhead remains very low. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： parallel debugging threads remote procedure call execution replay

来源：评论

学校读者我要写书评

暂无评论

Net-dbx: A web-based debugger of MPI programs over low-bandwidth lines

引用

IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 2001年第9期12卷 986-995页

作者： Neophytou, N Evripidou, P Univ Cyprus Dept Comp Sci CY-1678 Nicosia Cyprus

This paper describes Net-dbx, a tool that utilizes Java and other World Wide Web tools for the debugging of MPI programs from anywhere in the Internet. Net-dbx is a source-level interactive debugger with the full power of gdb (the GNU Debugger) augmented with the debug functionality of the public-domain MPI implementation environments. The main effort was on a low overhead, yet powerful, graphical interface supported by low-bandwidth connections. The portability of the tool is of great importance as well because it enables the tool to be used on heterogeneous nodes that participate in an MPI multicomputer. Both needs are satisfied a great deal by the use of WWW browsing tools and the Java programming language. The user of our system simply points his/her browser to the Net-dbx page, logs in to the destination system, and starts debugging by interacting with the tool, just as with any GUI environment. The user can dynamically select which MPI processes to view/debug. A special WWW-based environment has been designed and implemented to host the system prototype.

关键词： parallel processing message passing parallel debugging Java applets WWW teleworking

来源：评论

学校读者我要写书评

暂无评论

MetaMFL: Metamorphic Multiple Fault Localization Without Test Oracles

引用

IEEE TRANSACTIONS ON RELIABILITY 2024年

作者： Fu, Lingfeng Wu, Zhenyu Lei, Yan Yan, Meng Chongqing Univ Sch Big Data& Software Engn Chongqing 400044 Peoples R China Peng Cheng Lab Shenzhen 518066 Peoples R China

Multiple fault localization (MFL) identifies the positions of multiple faults (i.e., more than one fault) residing in a buggy program. It is notably more difficult as compared with single fault localization (SFL) which aims to locate a single fault (i.e., one fault) in a buggy program. Clustering-based multiple fault localization (CBMFL) is amongst the most popular MFL approaches, showing promising results in multiple fault localization. The requisite of launching CBMFL depends on test oracles to acquire the test results (i.e., a pass or a failure). In practice, test oracles are commonly not available known as the oracle problem, and CBMFL becomes infeasible in these cases. Inspired by metamorphic testing in solving the oracle problem, we attempt to combine this technique into CBMFL to broaden its application scope. Thus, we propose MetaMFL: Metamorphic Multiple Fault Localization, which leverages metamorphic testing to extend CBMFL to the cases where test oracles are not available. Specifically, MetaMFL uses metamorphic testing groups as minimum units of testing. It defines metamorphic features for representing those that have violated metamorphic relations. Using these features, CBMFL can perform clustering to support parallel debugging, thus achieving MFL without test oracles. The large-scale experiments show that MetaMFL largely retains the effectiveness of CBMFL even though test oracles are not available.

关键词： Location awareness Testing debugging Clustering algorithms Terminology Runtime Feature extraction Fault diagnosis Codes Big Data Metamorphic testing multiple fault localization (MFL) multiple faults parallel debugging test oracles

来源：评论

学校读者我要写书评

暂无评论

MSeer-An Advanced Technique for Locating Multiple Bugs in parallel

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2019年第3期45卷 301-318页

作者： Gao, Ruizhi Wong, W. Eric Univ Texas Dallas Richardson TX 75080 USA Univ Texas Dallas Adv Res Ctr Software Testing & Qual Assurance Com Richardson TX 75080 USA

In practice, a program may contain multiple bugs. The simultaneous presence of these bugs may deteriorate the effectiveness of existing fault-localization techniques to locate program bugs. While it is acceptable to use all failed and successful tests to identify suspicious code for programs with exactly one bug, it is not appropriate to use the same approach for programs with multiple bugs because the due-to relationship between failed tests and underlying bugs cannot be easily identified. One solution is to generate fault-focused clusters by grouping failed tests caused by the same bug into the same clusters. We propose MSeer-an advanced fault localization technique for locating multiple bugs in parallel. Our major contributions include the use of (1) a revised Kendall tau distance to measure the distance between two failed tests, (2) an innovative approach to simultaneously estimate the number of clusters and assign initial medoids to these clusters, and (3) an improved K-medoids clustering algorithm to better identify the due-to relationship between failed tests and their corresponding bugs. Case studies on 840 multiple-bug versions of seven programs suggest that MSeer performs better in terms of effectiveness and efficiency than two other techniques for locating multiple bugs in parallel.

关键词： Software fault localization parallel debugging multiple bugs clustering distance metrics

来源：评论

学校读者我要写书评

暂无评论

Race Condition and Deadlock Detection for Large-scale Applications 15

Race Condition and Deadlock Detection for Large-scale Applic...

引用

15th International Symposium on parallel and Distributed Computing (ISPDC)

作者： Do-Mai, Anh-Tu Diep, Thanh-Dang Thoai, Nam HCMC Univ Technol VNUHCM Fac Comp Sci & Engn Ho Chi Minh City Vietnam

ISBN: (纸本)9781509041527

debugging large-scale parallel applications is a problematic issue. Characteristics of scalability bring about an exponential increase in errors and many impacts on performance. With suffering unacceptable overhead and debugging time, traditional techniques, such as checkpointing or record and replay, have become obsolete when applying to large-scale parallel applications. The ex-scale trend is coming, which demands cutting-edge large-scale parallel application debugging techniques. Instead of prior works based on locating exact errors, we proposed an on-the-fly approach by detecting abnormal behaviors arising frequently in complicated message passing channels. In this paper, anomalies are race conditions causing concealing deadlocks which probably result in hangs and make programmers unable to inspect manually errors. The technique utilizes one state-of-the-art detection algorithm which is related to allocation and management tactics. The proposed algorithm is proved the precision and effectiveness by theoretical proofs and experimental results. With acceptable overhead, this technique shows the potential for applying to large-scale parallel applications, specially ones running as master/slave model.

关键词： parallel debugging message-passing large-scale on-the-fly race condition deadlock

来源：评论

学校读者我要写书评

暂无评论

MSeer - an Advanced Technique for Locating Multiple Bugs in parallel 18

MSeer - an Advanced Technique for Locating Multiple Bugs in ...

引用

40th ACM/IEEE International Conference on Software Engineering (ICSE)

作者： Gao, Ruizhi Wong, W. Eric Univ Texas Dallas Dept Comp Sci Richardson TX 75083 USA

ISBN: (纸本)9781450356381

In practice, a program may contain multiple bugs. The simultaneous presence of these bugs may deteriorate the effectiveness of existing fault-localization techniques to locate program bugs. While it is acceptable to use all failed and successful tests to identify suspicious code for programs with exactly one bug, it is not appropriate to use the same approach for programs with multiple bugs because the due-to relationship between failed tests and underlying bugs cannot be easily identified. One solution is to generate fault-focused clusters by grouping failed tests caused by the same bug into the same clusters. We propose MSeer - an advanced fault localization technique for locating multiple bugs in parallel. Our major contributions include the use of (1) a revised Kendall tau distance to measure the distance between two failed tests, (2) an innovative approach to simultaneously estimate the number of clusters and assign initial medoids to these clusters, and (3) an improved K-medoids clustering algorithm to better identify the due-to relationship between failed tests and their corresponding bugs. Case studies on 840 multiple-bug versions of seven programs suggest that MSeer performs better in terms of effectiveness and efficiency than two other techniques for locating multiple bugs in parallel.

关键词： Software fault localization parallel debugging multiple bugs clustering distance metrics

来源：评论

学校读者我要写书评

暂无评论

Evolving Ranking-Based Failure Proximities for Better Clustering in Fault Isolation 7

Evolving Ranking-Based Failure Proximities for Better Cluste...

引用

37th IEEE/ACM International Conference on Automated Software Engineering (ASE)

作者： Song, Yi Xie, Xiaoyuan Zhang, Xihao Liu, Quanming Gao, Ruizhi Wuhan Univ Sch Comp Sci Wuhan Peoples R China Sonos Inc Santa Barbara CA USA

ISBN: (纸本)9781450394758

Failures that are not related to a specific fault can reduce the effectiveness of fault localization in multi-fault scenarios. To tackle this challenge, researchers and practitioners typically cluster failures (e.g., failed test cases) into several disjoint groups, with those caused by the same fault grouped together. In such a fault isolation process that requires input in a mathematical form, ranking-based failure proximity (R-proximity) is widely used to model failed test cases. In R-proximity, each failed test case is represented as a suspiciousness ranking list of program statements through a fingerprinting function (i.e., a risk evaluation formula, REF). Although many offthe-shelf REFs have been integrated into R-proximity, they were designed for single-fault localization originally. To the best of our knowledge, no REF has been developed to serve as a fingerprinting function of R-proximity in multi-fault scenarios. For better clustering failures in fault isolation, in this paper, we present a genetic programming-based framework along with a sophisticated fitness function, for evolving REFs with the goal of more properly representing failures in multi-fault scenarios. By using a small set of programs for training, we get a collection of REFs that can obtain good results applicable in a larger and more general scale of scenarios. The best one of them outperforms the state-of-the-art by 50.72% and 47.41% in faults number estimation and clustering effectiveness, respectively. Our framework is highly configurable for further use, and the evolved formulas can be directly applied in future failure representation tasks without any retraining.

关键词： Failure proximity Clustering Fault isolation parallel debugging Search-based software engineering

来源：评论

学校读者我要写书评

暂无评论

Aletheia: A Failure Diagnosis Toolchain 18

Aletheia: A Failure Diagnosis Toolchain

引用

40th ACM/IEEE International Conference on Software Engineering (ICSE)

作者： Golagha, Mojdeh Raisuddin, Abu Mohammed Mittag, Lennart Hellhake, Dominik Pretschner, Alexander Tech Univ Munich Munich Germany

ISBN: (纸本)9781450356633

Testing and debugging are time-consuming, tedious and costly. As many automated test generation tools are being applied in practice nowadays, there is a growing need for automated failure diagnosis. We introduce Aletheia, a failure diagnosis toolchain, which aims to help developers and testers reduce failure analysis time. The key ideas include: data generation to provide the relevant data for further analysis, failure clustering to group failing tests based on the hypothesized faults, and fault localization to pinpoint suspicious elements of the code. We evaluated Aletheia in a large-scale industrial case study as well as two open-source projects. Aletheia is released as an open-source tool on Github, and a demo video can be found at: https://***/BP9D68D02ZI

关键词： Hit spectra Failure clustering Fault localization parallel debugging

来源：评论

学校读者我要写书评

暂无评论

Memory tagging in charm++

Memory tagging in charm++

引用

6th Workshop on parallel and Distributed Systems: Testing, Analysis, and debugging 2008, PADTAD'08

作者： Gioachin, Filippo Kalé, Laxmikant V. Department of Computer Science University of Illinois Urbana-Champaign United States

ISBN: (纸本)9781605580524

Many scientific applications are logically decomposed into modules, each module performing a different type of computation. These modules are then linked together inside the same executable. While these modules are logically independent, they are not physically independent: a faulty module can corrupt the state of another one. By identifying the different modules inside an application, tagging the memory according to the different modules, and performing extra runtime checks, we can automatically detect certain type of errors. We implemented our idea inside the CHARM++ runtime system, where modules can be easily identified. We illustrate the validity of our approach, and evaluate its overhead. Copyright 2008 ACM.

关键词： debugging Memory debugging Memory tagging parallel debugging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：