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

筛选
英文 中文
Practical verification of high-level dataraces in transactional memory programs 事务性内存程序中高级数据的实际验证
Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2011-07-17 DOI: 10.1145/2002962.2002968
Vasco Pessanha, Ricardo J. Dias, João M. Lourenço, E. Farchi, Diogo Sousa
{"title":"Practical verification of high-level dataraces in transactional memory programs","authors":"Vasco Pessanha, Ricardo J. Dias, João M. Lourenço, E. Farchi, Diogo Sousa","doi":"10.1145/2002962.2002968","DOIUrl":"https://doi.org/10.1145/2002962.2002968","url":null,"abstract":"In this paper we present MoTh, a tool that uses static analysis to enable the automatic verification of concurrency anomalies in Transactional Memory Java programs. Currently MoTh detects high-level dataraces and stale-value errors, but it is extendable by plugging-in sensors, each sensor implementing an anomaly detecting algorithm. We validate and benchmark MoTh by applying it to a set of well known concurrent buggy programs and by close comparison of the results with other similar tools. The results achieved so far are very promising, yielding good accuracy while triggering only a very limited number of false warnings.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"5 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":"115388709","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}
引用次数: 8
Executing association rule mining algorithms under a Grid computing environment 在网格计算环境下执行关联规则挖掘算法
Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2011-07-17 DOI: 10.1145/2002962.2002973
R. Tlili, Y. Slimani
{"title":"Executing association rule mining algorithms under a Grid computing environment","authors":"R. Tlili, Y. Slimani","doi":"10.1145/2002962.2002973","DOIUrl":"https://doi.org/10.1145/2002962.2002973","url":null,"abstract":"Grids are now regarded as promising platforms for data and computation-intensive applications like data mining. However, the exploration of such large-scale computing resources necessitates the development of new distributed algorithms. The major challenge facing the developers of distributed data mining algorithms is how to adjust the load imbalance that occurs during execution. This load imbalance is due to the dynamic nature of data mining algorithms (i.e. we cannot predict the load before execution) and the heterogeneity of Grid computing systems. In this paper, we propose a dynamic load balancing strategy for distributed association rule mining algorithms under a Grid computing environment. We evaluate the performance of the proposed strategy by the use of Grid'5000. A Grid infrastructure distributed in nine sites around France, for research in large-scale parallel and distributed systems.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"51 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":"116441405","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}
引用次数: 15
Robust non-intrusive record-replay with processor extraction 鲁棒非侵入式记录重放与处理器提取
Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2010-07-13 DOI: 10.1145/1866210.1866211
F. Gioachin, G. Zheng, L. Kalé
{"title":"Robust non-intrusive record-replay with processor extraction","authors":"F. Gioachin, G. Zheng, L. Kalé","doi":"10.1145/1866210.1866211","DOIUrl":"https://doi.org/10.1145/1866210.1866211","url":null,"abstract":"With the advent of increasingly larger parallel machines, debugging is becoming more and more challenging. In particular, applications at this scale tend to behave non-deterministically, leading to race condition bugs. Furthermore, gaining access to these large machines for long debugging sessions is generally infeasible. In this paper, we present a 3-step algorithm to perform what we call \"processor extraction\": a procedure to record the execution of a set of processors from a parallel application, and replay any of them in a controlled environment. Our technique generates very low interference in the recorded program thanks to the separation between non-determinism elimination, and detailed processor recording. In order to improve robustness and accuracy, we further augmented our algorithm with a self-correction mechanism.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129338737","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}
引用次数: 6
Unit testing for concurrent business code 并发业务代码的单元测试
Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2010-07-13 DOI: 10.1145/1866210.1866214
Y. Qi, Yarden Nir-Buchbinder, E. Farchi, R. Das, Zhi Da Luo, Zhi Gan
{"title":"Unit testing for concurrent business code","authors":"Y. Qi, Yarden Nir-Buchbinder, E. Farchi, R. Das, Zhi Da Luo, Zhi Gan","doi":"10.1145/1866210.1866214","DOIUrl":"https://doi.org/10.1145/1866210.1866214","url":null,"abstract":"Performing unit testing on concurrent programs is a known challenge. Several solutions have been proposed for the challenges, that provide only a partial answer. We argue that there are two kinds of concurrent code writing, namely concurrency protocols and concurrent \"business code\", and that they are different not only in the coding itself, but also in the way unit testing should be done for them. We show that the current solutions to concurrent unit testing only give a satisfactory answer to concurrency protocols, but not to concurrent business code. We have designed and implemented a unit testing framework suitable for concurrent business code, as part of the IBM Multicore Software Development Kit. This paper presents the distinction between the types of concurrent programming, and describes the new framework.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114574069","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}
引用次数: 1
Profiling of real-world web applications 分析真实的web应用程序
Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2010-07-13 DOI: 10.1145/1866210.1866216
H. M. Aguiar, J. Seco, L. Ferrão
{"title":"Profiling of real-world web applications","authors":"H. M. Aguiar, J. Seco, L. Ferrão","doi":"10.1145/1866210.1866216","DOIUrl":"https://doi.org/10.1145/1866210.1866216","url":null,"abstract":"Non-functional requirements of enterprise web applications, like performance, are usually assessed and analyzed in simulated environments before being released into production. However, it is not easy to simulate a real-world environment and the effective use of the system, leading to poor and expensive performance data collection. Moreover, in agile methodologies, where development is focused in the fast time to market and getting early feedback from end-users, upfront estimation and forward thinking about scalability is not in the top priorities. This constrains even more performance analysis and tests, as developers are only aware of performance issues when critical feedback from production systems is given back to development. This commonly leads to enterprise web applications with scalability problems, and low responsiveness.\u0000 This paper presents a structured way of giving continuous and real world performance feedback to developers of enterprise web applications. By having early access to real performance metrics, developers easily detect stress points in applications, allowing for timely tuning actions, before reaching critical conditions for end-users. Metrics also help developers assessing the impact of changing intensively used parts of existing applications.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134226915","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}
引用次数: 1
A platform for search-based testing of concurrent software 基于搜索的并行软件测试平台
Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2010-07-13 DOI: 10.1145/1866210.1866215
B. Krena, Zdenek Letko, Tomáš Vojnar, S. Ur
{"title":"A platform for search-based testing of concurrent software","authors":"B. Krena, Zdenek Letko, Tomáš Vojnar, S. Ur","doi":"10.1145/1866210.1866215","DOIUrl":"https://doi.org/10.1145/1866210.1866215","url":null,"abstract":"The paper describes a generic, open-source infrastructure called SearchBestie (or S'Bestie for short) that we propose as a platform for experimenting with search-based techniques and for applying them in the area of software testing. Further, motivated by a lack of work on search-based testing targeted at identifying concurrency-related problems, we instantiate S'Bestie for search-based testing of concurrent programs using the IBM's concurrency testing infrastructure called ConTest. We demonstrate on series of experiments the capabilities of S'Bestie and (despite we have just made our first experiments with S'Bestie) also the fact that using search-based testing in the context of testing concurrent programs can be useful.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133507649","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}
引用次数: 39
Open virtualization framework for testing ground systems 用于测试地面系统的开放虚拟化框架
Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2010-07-13 DOI: 10.1145/1866210.1866217
N. Duro, Rui Santos, João M. Lourenço, Hervé Paulino, João Martins
{"title":"Open virtualization framework for testing ground systems","authors":"N. Duro, Rui Santos, João M. Lourenço, Hervé Paulino, João Martins","doi":"10.1145/1866210.1866217","DOIUrl":"https://doi.org/10.1145/1866210.1866217","url":null,"abstract":"The recent developments in virtualization change completely the panorama of the Hardware/OS deployment. New bottlenecks arise in the deployment of application stacks, where IT industry will spend most of the time to assure automation. VIRTU tool aims at managing, configuring and testing distributed ground applications of space systems on a virtualized environment, based on open tools and cross virtualization support. This tool is a spin-off of previous activities performed by the European Space Operations Center (ESOC) and thus it covers the original needs from the ground data systems infrastructure division of the European Space Agency. VIRTU is a testing oriented solution. Its ability to group several virtual machines in an assembly provides the means to easily deploy a full testing infrastructure, including the client/server relationships.\u0000 The possibility of making on-demand request of the testing infrastructure will provide some infrastructure optimizations, specially having in mind that ESA maintains Ground Control software of various missions, and each mission cam potentially have a different set of System baselines and last up to 15 years. The matrix array of supported system combinations is therefore enormous and any improvement on the process provides substantial benefits to ESA, by reducing the effort and schedule of each maintenance activity.\u0000 The ESOC's case study focuses on the development and validation activities of infrastructure or mission Ground Systems solutions. The Ground Systems solutions are typically composed of distributed systems that could take advantage of virtualized environments for testing purposes. Virtualization is used as way to optimize maintenance for tasks such as testing new releases and patches, test different system's configurations and replicate tests. The main benefits identified are related to deployment test environment and the possibility to have on-demand infrastructure.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129527674","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}
引用次数: 4
Debugging support tool for MCAPI applications 调试支持工具的MCAPI应用程序
Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2010-07-13 DOI: 10.1145/1866210.1866212
Mohamed M. Elwakil, Z. Yang
{"title":"Debugging support tool for MCAPI applications","authors":"Mohamed M. Elwakil, Z. Yang","doi":"10.1145/1866210.1866212","DOIUrl":"https://doi.org/10.1145/1866210.1866212","url":null,"abstract":"The recently proposed MCAPI (Multicore Association Communication API) specification provides multicore programs developers with a standard API for inter-core messages-based communication and stream-based communication. Debugging MCAPI programs that use message-based communication is expected to be very challenging due to the non-determinism associated with the order of messages' arrivals at a core. In this paper we present a tool that uses an off-the-shelf SMT solver to symbolically explore all possible orders of messages arrival in an MCAPI program. If there is a specific order of messages arrival that leads to an error state, this order is presented to the user as a debugging aid.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133452818","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}
引用次数: 15
Detection of Transactional Memory anomalies using static analysis 使用静态分析检测事务性内存异常
Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2010-07-13 DOI: 10.1145/1866210.1866213
Bruno C. Teixeira, João M. Lourenço, E. Farchi, Ricardo J. Dias, Diogo Sousa
{"title":"Detection of Transactional Memory anomalies using static analysis","authors":"Bruno C. Teixeira, João M. Lourenço, E. Farchi, Ricardo J. Dias, Diogo Sousa","doi":"10.1145/1866210.1866213","DOIUrl":"https://doi.org/10.1145/1866210.1866213","url":null,"abstract":"Transactional Memory allows programmers to reduce the number of synchronization errors introduced in concurrent programs, but does not ensures its complete elimination. This paper proposes a pattern matching based approach to the static detection of atomicity violation, based on a path-sensitive symbolic execution method to model four anomalies that may affect Transactional Memory programs. The proposed technique may be used to to bring to programmer's attention pairs of transactions that the programmer has mis-specified, and should have been combined into a single transaction. The algorithm first traverses the AST tree, removing all the non-transactional blocks and generating a trace tree in the path sensitive manner for each thread. The trace tree is a Trie like data structure, where each path from root to a leaf is a list of transactions. For each pair of threads, erroneous patterns involving two consecutive transactions are then checked in the trace tree. Results allow to conclude that the proposed technique, although triggering a moderate number of false positives, can be successfully applied to Java programs, correctly identifying the vast majority of the relevant erroneous patterns.","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115250364","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}
引用次数: 15
Towards a better collaboration of static and dynamic analyses for testing concurrent programs 为了更好地协作测试并发程序的静态和动态分析
Parallel and Distributed Systems: Testing, Analysis, and Debugging Pub Date : 2008-07-20 DOI: 10.1145/1390841.1390849
Jun Chen, S. MacDonald
{"title":"Towards a better collaboration of static and dynamic analyses for testing concurrent programs","authors":"Jun Chen, S. MacDonald","doi":"10.1145/1390841.1390849","DOIUrl":"https://doi.org/10.1145/1390841.1390849","url":null,"abstract":"Testing concurrent programs remains a difficult task due to the non-deterministic nature of concurrent executions. Many approaches have been proposed to combine static and dynamic analysis to reduce the complexity of uncovering potential concurrency bugs. However, the existing collaboration schemes only provide a limited mechanism for exchanging relevant information between the two analyses. For example, alias information only flows from the static analysis module to the dynamic analysis module at the beginning of the dynamic analysis. Therefore, we cannot fully exploit the advantages of each type of analysis. Motivated by this observation, in this paper we present a new testing technique which enables a tighter collaboration between static analysis and dynamic analysis. In this collaboration scheme, static analysis and dynamic analysis interact iteratively throughout the whole testing process. Static analysis uses coarse-grained analysis to guide the dynamic analysis to concentrate on the relevant search space, while dynamic analysis collects concrete runtime information during the guided exploration. The runtime information provided by the dynamic analysis helps the static analysis to refine its coarse-grained analysis and provides better guidance on dynamic analysis. Currently, our implementation consists of a static analysis module based on Soot and a dynamic analysis module based on JPF (Java PathFinder).","PeriodicalId":291507,"journal":{"name":"Parallel and Distributed Systems: Testing, Analysis, and Debugging","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121364736","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}
引用次数: 27
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书