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

2015 IEEE 17th International Conference on High Performance Computing and Communications (HPCC)

作者： Wu, Zhendong Lu, Kai Wang, Xiaoping Natl Univ Def Technol Coll Comp Sci & Technol Parallel & Distributed Proc Lab Changsha Hunan Peoples R China

ISBN: (纸本)9781479989379

Harmful data races hidden in concurrent programs are hard to be detected due to non-determinism. Many race detectors report a large number of benign data races. To detect the harmful data races automatically, previous tools dynamically execute program and actively insert delay to create real race condition, checking whether failure occurs due to the race. If so, a harmful race is detected. However, performance may be affected due to the inserted delay. We use speculative execution to alleviate this problem. Unlike previous tools that suspend one thread's memory access to wait for another thread's memory access, we continue to execute this thread's memory accesses and do not suspend this thread until it is going to execute a memory access that may change the effort of race. Therefore, real race condition will be created with less delay or even no delay. To our knowledge, this is the first technique that can trigger data races by speculative execution. The speculative execution does not affect the detection of harmful races. We have implemented a prototype tool and experimented on some real world programs. Results show that our tool can detect harmful races effectively. By speculative execution, the performance is improved significantly.

关键词： harmful data race speculative execution dynamic analysis concurrent program

来源：评论

学校读者我要写书评

暂无评论

RaceChecker: Efficient Identification of Harmful Data Races 23

RaceChecker: Efficient Identification of Harmful Data Races

引用

23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

作者： Lu, Kai Wu, Zhendong Wang, Xiaoping Chen, Chen Zhou, Xu Natl Univ Def Technol Coll Comp Sci & Technol Parallel & Distributed Proc Lab Changsha Hunan Peoples R China

ISBN: (纸本)9781479984909

Data races hidden in concurrent programs have caused severe failures. To improve the reliability, many race detectors are proposed. However, most of the reported races are not harmful, which consumes manual effort to identify the harmful races. This paper proposes RaceChecker that can detect the potential races and identify the harmful races effectively and efficiently. Unlike previous detectors, RaceChecker combines happens-before relation and ad-hoc synchronization to prune the infeasible races so that fewer potential races are required to be verified. Before verification, RaceChecker groups the remaining potential races, guaranteeing the potential races in one group do not interfere with each other. Therefore, multiple potential races in one group can be verified together in one execution. To our knowledge, this is the first effective technique that groups the potential races to improve the efficiency. Unlike previous detectors that verify one potential race in one execution, RaceChecker dynamically controls thread scheduler to create real race conditions to verify multiple potential races in one execution, identifying the harmful races that cause program failures. We have implemented RaceChecker as a prototype tool and have experimented on a number of real-world concurrent programs. Results show that 66% of the potential races are infeasible and nearly 48% of the executions are reduced by the grouping strategy. The known harmful races are also identified effectively. By pruning and grouping, RaceChecker identifies the harmful races more efficiently. Comparing with RaceMob and RaceFuzzer, the time is reduced significantly, with an average of 45% and 81% respectively.

关键词： concurrent program data race false positive harmful race dynamic verification

来源：评论

学校读者我要写书评

暂无评论

A Review on Refactoring Sequential program to Parallel Code in Multicore Era

A Review on Refactoring Sequential Program to Parallel Code ...

引用

International Conference on Intelligent Computing and Internet of Things

作者： Zhao, Song Bian, Yixin Zhang, Sen Sen Harbin Normal Univ Coll Comp Sci & Informat Engn Harbin Peoples R China

ISBN: (纸本)9781479975341

Nowdays it is inevitable to face the emergence of multicore processors and parallel platforms. In the multicore time, sequential programs need to be refactored for parallelism. Refactoring is a process of adjusting the code structure of a program keeping its internal function. However, refactoring sequential code to concurrent program is not trivial. In this paper, a survey of the current literature that frequently reported parallel refactoring are carried out. It is important for programmers or computer researchers to exploit multicore platform in order to get better understand and perform refactoring in parallel. This review can help the research community to know the different directions about development of parallel refactoring in order to improve the quality of software.

关键词： refactoring parallel sequential program multicore concurrent program

来源：评论

学校读者我要写书评

暂无评论

PFinder: Efficiently Detecting Bugs in concurrent programs through Parallelizing Race Verification 9

PFinder: Efficiently Detecting Bugs in Concurrent Programs t...

引用

9th International Conference on Computer Engineering & Systems (ICCES)

作者： Wu, Zhendong Lu, Kai Wang, Xiaoping Zhou, Xu Chen, Chen Natl Univ Def Technol Coll Comp Sci & Technol Parallel & Distributed Proc Lab Changsha Hunan Peoples R China

ISBN: (纸本)9781479965946

Races hidden in concurrent programs can lead to harmful bugs. These bugs are difficult to detect due to their non-deterministic characteristics. Previous work has tried to dynamically verify races in actual executions to check whether they would lead to failures. However, it is inefficient to verify all the races to find the harmful bugs if there are a large number of races. To improve the efficiency, PFinder is the first technique that uses a parallel method to verify multiple races on multiple machines simultaneously. We have implemented PFinder as a prototype tool and have experimented on a number of real-world concurrent programs. All the known bugs in known benchmarks are detected. Also, PFinder could scale well as the number of machines increases. Additionally, the speedup of PFinder can be increased linearly with the number of machines.

关键词： concurrent program concurrency bug detection parallel method data race race verification harmful bug

来源：评论

学校读者我要写书评

暂无评论

Ordinary Differential Equation-Based Deadlock Detection

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2014年第10期44卷 1435-1454页

作者： Ding, Zuohua Zhou, MengChu Wang, ShouGuang Zhejiang Sci Tech Univ Inst Intelligent Comp & Software Engn Hangzhou 310018 Peoples R China Tongji Univ Key Lab Embedded Syst & Serv Comp Minist Educ Shanghai 201804 Peoples R China New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA Zhejiang Gongshang Univ Sch Informat & Elect Engn Hangzhou 310018 Peoples R China

Deadlock detection for concurrent systems via static analysis is in general difficult because of state-space explosion;indeed it is PSPACE compete. This paper presents a new method to detect the deadlocks. A concurrent system consisting of several processes that communicate using a resource sharing mechanism is represented by a set of ordinary differential equations of a restricted type. The equations describe the system state changes, and their solutions, also called state measures, indicate the extent to which the state can be reached in execution. Based on the solutions, the resource deadlock can be detected. By taking into account the computation errors of numerical solution for the differential equations, the detection can be performed via a MATLAB solver, as shown in the experiments. The complexity of the proposed method is polynomial.

关键词： concurrent program concurrent system continuous Petri net deadlock detection ordinary differential equation state space explosion

来源：评论

学校读者我要写书评

暂无评论

Scheduling Parallel Virtual Machine in Xen based on Credit 8

Scheduling Parallel Virtual Machine in Xen based on Credit

引用

8th Asia-Pacific Services Computing Conference (APSCC)

作者： Ding, Xiaobo Ma, Zhong Dai, Xinfa Zhong, Alin Harbin Engn Univ Coll Comp Sci & Technol Harbin Heilongjiang Peoples R China China Three Gorges Univ Coll Comp & Informat Technol Yichang Peoples R China Wuhan Digital Engn Res Inst Wuhan Hubei Peoples R China

ISBN: (纸本)9780769553818

With the development of multi-processor system, parallel program becomes a very important direction of software development. But in virtual machine systems, the performance of concurrent program scheduling is poor. In order to improve the performance of scheduling parallel applications in Virtual Machine (VM), this paper raises a parallel schedule algorism called PSA, which is based on Credit scheduler in Xen VMM. This new algorism support for scheduling the parallel Virtual CPUs (vCPUs) synchronously;it reduces the effect of asynchrony of parallel vCPUs by the interrupt of I/O bounded workloads;and it keeps the synchronization of parallel vCPUs when asynchrony emerges in the process of scheduling. The evaluation shows remarkable improvement of the PSA in scheduling the parallel vCPUs with different workloads, compared to the original Credit scheduler, co-scheduler and UVF: the demand-based coordinated scheduler.

关键词： virtual machine concurrent program I/O event synchronism scheduling

来源：评论

学校读者我要写书评

暂无评论

State-cover testing for nondeterministic terminating concurrent programs with an infinite number of synchronization sequences

引用

SCIENCE OF COMPUTER programMING 2013年第9期78卷 1294-1323页

作者： Lin, Che-Sheng Hwang, Gwan-Hwan Natl Taiwan Normal Univ Dept Comp Sci & Informat Engn Taipei 11677 Taiwan

concurrent programs exhibit nondeterministic behavior in that multiple executions thereof with the same input might produce different sequences of synchronization events and different results. This is because different executions of a concurrent program with the same input may exhibit different interleavings. Thus, one of the major issues in the testing of concurrent programs is how to explore different interleavings or exhaust all the possible interleavings of the target programs. However, for terminating concurrent programs that have cyclic state spaces due to using iterative statements such as busy-waiting loops, they might have an infinite number of feasible synchronization sequences;that is, there is an infinite number of possible interleavings, which makes it impossible to explore all the possible interleavings for this type of concurrent program. To overcome this problem, we propose a testing scheme called dynamic effective testing that can perform state-cover testing for nondeterministic terminating concurrent programs with an infinite number of synchronization sequences. Dynamic effective testing does not require static analysis of the target concurrent program or the assistance of a model checker, and thus is loosely coupled to the syntax of the target concurrent program. It only needs to analyze sequences of synchronization events produced by the execution of the concurrent programs for race detection and state-traversal control. Therefore, the method is easy to port to different programming languages. In addition, only reiterated states discovered in a single SYN-sequence need to be stored. The implementation and experimental results obtained with real code demonstrate that source-code-level dynamic testing can be systematically performed on nondeterministic concurrent programs with infinite synchronization sequences. (C) 2012 Elsevier B.V. All rights reserved.

关键词： concurrent program Nondeterministic behavior concurrent testing SYN-sequence Reachability testing

来源：评论

学校读者我要写书评

暂无评论

An Automation-assisted Empirical Study on Lock Usage for concurrent programs

An Automation-assisted Empirical Study on Lock Usage for Con...

引用

29th IEEE International Conference on Software Maintenance (ICSM)

作者： Xin, Rui Qi, Zhengwei Huang, Shiqiu Xiang, Chengcheng Zheng, Yudi Wang, Yin Guan, Haibing Shanghai Jiao Tong Univ Sch Software Shanghai 200030 Peoples R China Univ Lugano Lugano Switzerland Facebook Cambridge MA USA

Nowadays concurrent programs are becoming more and more important with the development of hardware and network technologies. However, it is not easy for programmers to write reliable concurrent programs. Concurrency characteristics such as thread-interleaving make it difficult to debug or maintain concurrent programs. Although there are lots of research work on concurrency such as multi-thread testing tools, concurrent program verification and data race detection, all of them leave open problems. For instance, some are not scalable enough for large real world applications and some may report false warnings. Since locks are widely used to protect shared memory, it is beneficial for both programmers and tool designers in all fields to have a good understanding of common lock usage patterns in real world concurrent programs. This paper reports an empirical study on lock usage in concurrent programs. It is based on our automatic lock analysis tool called LUPA. The study analyzes how lock is used in concurrent programs and how lock usage changes throughout the product environment. In this study, four representative concurrent programs (Apache httpd, Mysql, Aget, Pbzip2) are selected, of which both lock manifestation and lock usage pattern in different versions are studied. This study reveals some interesting findings including but not limited to: (1) about 80.5% of the lock related functions acquire only one lock;(2) simple lock patterns account for 54.5% of all lock usage in real world applications;(3) only 12 out of 527 detected patterns belong to condition lock pattern which may lead to vulnerabilities easily;(4) only 0.65% of the functions are lock related. Additionally, a potential bug caused by problematic locking pattern is found.

关键词： concurrent program lock usage empirical study

来源：评论

学校读者我要写书评

暂无评论

An Empirical Study of Data Race Detector Tools

An Empirical Study of Data Race Detector Tools

引用

25th Chinese Control and Decision Conference (CCDC)

作者： Alowibdi, Jalal S. Stenneth, Leon Univ Illinois Dept Comp Sci Chicago IL 60607 USA

ISBN: (纸本)9781467355322;9781467355339

The industry of software applications has been increased significantly because of the high demand of using the software applications. This revolution leads on developing many concurrent software systems. Noticeably, some of these concurrent software systems have falsely report data race condition to one or more of their shared variables. Debugging such concurrent software systems to find the race condition is a challenge, especially for large and complex software systems. Since the race condition concerned mostly ignored in the concurrent software systems, adopting it could help to ensure the efficiency of these software systems. There are few detector tools that have been known in the industry focusing on data race detectors. This paper aims to study those tools. We are going to conduct empirical study of data race using well known tools in order to measure the correctness, performances and effectiveness of those tools in practical by using some benchmarks. Those benchmarks will be tested on each tool and compare it with others to see the similarity and differentiate.

关键词： Data race Performance Correctness concurrent program

来源：评论

学校读者我要写书评

暂无评论

New Types of program Dependences and Interprocedural Relations in Ada 2012 programs

New Types of Program Dependences and Interprocedural Relatio...

引用

2013 IEEE 4th International Conference on Software Engineering and Service Science

作者： Bo Wang Yuichi Goto Jingde Cheng School of Computer Science and Technology Tianjin University

ISBN: (纸本)9781467349970

System dependence net is a formal model to explicitly represent program dependences and interprocedural relations in a concurrent program with multiple *** is useful for development and maintenance of concurrent programs,such as program slicing,testing,debugging,and complexity *** now,although system dependence nets for Ada 95 and Ada 2005 programs were proposed respectively,they cannot be used for Ada 2012 programs,because Ada 2012 has a lot of changes and extensions from Ada *** the first step to extend the current model of system dependence nets for Ada 2012 programs,it is indispensable to identify all new program dependences and interprocedural relations in Ada 2012 *** paper presents some new types of program dependences and interprocedural relations in Ada 2012 programs,and shows their real examples.

关键词： program dependence program dependence graph system dependence net concurrent program Ada 2012 program

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：