Parallel and Distributed Systems: Testing, Analysis, and Debugging最新文献

Using program closures to make an application programming interface (API) implementation thread safe 使用程序闭包使应用程序编程接口(API)实现线程安全

Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2012-07-16 DOI: 10.1145/2338967.2336810

E. Farchi, Itai Segall, João M. Lourenço, Diogo Sousa

{"title":"Using program closures to make an application programming interface (API) implementation thread safe","authors":"E. Farchi, Itai Segall, João M. Lourenço, Diogo Sousa","doi":"10.1145/2338967.2336810","DOIUrl":"https://doi.org/10.1145/2338967.2336810","url":null,"abstract":"Consider a set of methods implementing an Application Programming Interface (API) of a given library or program module that is to be used in a multithreaded setting. If those methods were not originally designed to be thread safe, races and deadlocks are expected to happen. This work introduces the novel concept of program closure and describes how it can be applied in a methodology used to make the library or module implementation thread safe, by identifying the high level data races introduced by interleaving the parallel execution of methods from the API. High-level data races result from the misspecification of the scope of an atomic block, by wrongly splitting it into two or more atomic blocks sharing a data dependency. \u0000 Roughly speaking, the closure of a program P, clos(P), is obtained by incrementally adding new threads to P in such a way that enables the identification of the potential high level data races that may result from running P in parallel with other programs. \u0000 Our model considers the methods implementing the API of a library of program module as concurrent programs and computes and analyses their closure in order to identify high level data races. These high level data races are inspected and removed to make the interface thread safe. We illustrate the application of this methodology with a simple use case.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128083365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

A static analysis tool using a three-step approach for data races in HPC programs 一个静态分析工具，使用三步法分析HPC程序中的数据竞争

Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2012-07-16 DOI: 10.1145/2338967.2336809

Yasushi Negishi, H. Murata, Guojing Cong, H. Wen, I. Chung

{"title":"A static analysis tool using a three-step approach for data races in HPC programs","authors":"Yasushi Negishi, H. Murata, Guojing Cong, H. Wen, I. Chung","doi":"10.1145/2338967.2336809","DOIUrl":"https://doi.org/10.1145/2338967.2336809","url":null,"abstract":"Multicore processors are becoming dominant in the high performance computing (HPC) area, so multithread programming with OpenMP is becoming a key to good performance on such processors, though debugging problems remain. In particular, it is difficult to detect data races among threads with nondeterministic results, thus calling for tools to detect data races. Because HPC programs tend to run for long periods, detection tools that do not need to run the target programs are strongly preferred. We developed a static program analysis tool to detect data races in OpenMP loops in FORTRAN programs. Programmers can quickly use the tool at compile time without executing the target program. Because static analysis tools tend to report many false positives, we counted the false positives in some large applications to assess the utility and limits of static analysis tools. We have devised a new approach to detect data races. Our approach combines existing program analysis methods with a new analysis. We experimented with NAS parallel benchmarks and two real applications, GTC for plasma physics and GFMC for nuclear physics. Our new analysis method also reduces number of reported candidates from totally 97 to 33 in these applications. We found 13 previously unknown bugs out of 33 candidates reported by our prototype. Our analysis is fast enough for practical use, since the analysis time for the NAS parallel benchmark was shorter than the compilation time (18.5 seconds compared to 33.0 seconds).","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125865404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Noise-based testing and analysis of multi-threaded C/C++ programs on the binary level 基于噪声的多线程C/ c++程序二进制级测试与分析

Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2012-07-16 DOI: 10.1145/2338967.2336813

Jan Fiedor, Tomáš Vojnar

引用次数: 7

On-the-fly detection of data races in OpenMP programs OpenMP程序中数据竞争的动态检测

Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2012-07-16 DOI: 10.1145/2338967.2336808

Ok-Kyoon Ha, In-Bon Kuh, G. M. Tchamgoue, Yong-Kee Jun

{"title":"On-the-fly detection of data races in OpenMP programs","authors":"Ok-Kyoon Ha, In-Bon Kuh, G. M. Tchamgoue, Yong-Kee Jun","doi":"10.1145/2338967.2336808","DOIUrl":"https://doi.org/10.1145/2338967.2336808","url":null,"abstract":"OpenMP provides a portable way to achieve high performance and simple compiler directives to transform a sequential program into parallel program. It is important to detect data races in OpenMP programs, because they may lead to unpredictable results from an execution of the programs. To detect data races that occur during an execution of OpenMP programs, the representative on-the-fly technique, Helgrind+, mainly focuses on reducing false positives. Unfortunately, this technique is still imprecise and inefficient, when applied to large OpenMP programs which use a structured fork-join parallelism with a large number of threads. This paper presents a novel approach which efficiently detects apparent data races without false positives in large OpenMP programs. This approach combines an efficient thread labeling to maintain the logical concurrency of thread segments with a precise detection protocol to analyze conflicting accesses to every shared memory location. We implemented this approach on top of the Pin binary instrumentation framework and compared it with Helgrind+. Empirical results using OpenMP benchmarks show that our technique detects apparent data races without false positives contrarily to Helgrind+, while reducing the average runtime overhead to 19% of Helgrind+ with a similar amount of space overhead.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122322245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 29

Using combinatorial benchmark construction to improve the assessment of concurrency bug detection tools 采用组合基准构建改进并发性bug检测工具的评估

Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2012-07-16 DOI: 10.1145/2338967.2336812

J. S. Bradbury, Itai Segall, E. Farchi, Kevin Jalbert, D. Kelk

引用次数: 3

Refactoring Java programs using concurrent libraries 使用并发库重构Java程序

Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2011-07-17 DOI: 10.1145/2002962.2002970

K. Ishizaki, S. Daijavad, T. Nakatani

{"title":"Refactoring Java programs using concurrent libraries","authors":"K. Ishizaki, S. Daijavad, T. Nakatani","doi":"10.1145/2002962.2002970","DOIUrl":"https://doi.org/10.1145/2002962.2002970","url":null,"abstract":"Multithread programming is becoming ever-more important to exploit the capabilities of multicore processors. Versions of Java prior to version 5 provide only the synchronized construct as a consistency primitive, which causes a performance scalability problem for multicore machines. Therefore, Java 5 added the java.util.concurrent package to reduce lock contention. Programmers must manually rewrite their existing code to use this package in existing programs. There are two typical rewritings methods. One is to replace an operation on a variable within a synchronized block with an atomic-lock-free version. The other is to replace a sequential concurrent class with its concurrent version. The conventional rewriting approach has three deficiencies. One problem is transformations that may change the behavior of a program. The second problem is missed modifications to be rewritten. The third problem is two difference writing techniques are applied individually to each code fragment even in the same method. This paper describes our refactoring algorithms that address these three problems as they rewrite Java code for scalable performance. We use inter-procedural pointer analysis and consistency tests among the candidate code fragments.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121899601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Deterministic replay for MCAPI programs MCAPI程序的确定性重放

Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2011-07-17 DOI: 10.1145/2002962.2002966

Mohamed M. Elwakil, Z. Yang

引用次数: 2

Extending a distributed loop network to tolerate node failures 扩展分布式环路网络以容忍节点故障

Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2011-07-17 DOI: 10.1145/2002962.2002971

A. Farrag

引用次数: 1

Research in concurrent software testing: a systematic review 并行软件测试研究:系统回顾

Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2011-07-17 DOI: 10.1145/2002962.2002964

S. Souza, Maria A. S. Brito, Rodolfo A. Silva, P. L. D. Souza, E. Zaluska

引用次数: 27

Java replay for dependence-based debugging 用于基于依赖的调试的Java重播

Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2011-07-17 DOI: 10.1145/2002962.2002967

Jan Lönnberg, M. Ben-Ari, L. Malmi

引用次数: 8