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

Empirical research on concurrent software testing: A systematic mapping study

INFORMATION AND SOFTWARE TECHNOLOGY 2019年 105卷 226-251页

作者： Melo, Silvana M. Carver, Jeffrey C. Souza, Paulo S. L. Souza, Simone R. S. Univ Sao Paulo Inst Math & Comp Sci Ave Trabalhador Sao Carlense400 Ctr BR-13566590 Sao Carlos SP Brazil Univ Alabama Dept Comp Sci 3441 SECBox 870290 Tuscaloosa AL 35487 USA

Background: concurrent software testing is a costly and difficult task, especially due to the exponential increase in the test sequences caused by non-determinism. Such an issue has motivated researchers to develop testing techniques that select a subset of the input domain that has a high probability of revealing faults. Academics and industrial practitioners rarely use most concurrent software testing techniques because of the lack of data about their applicability. Empirical evidence can provide an important scientific basis for the strengths and weaknesses of each technique to help researchers and practitioners choose concurrent testing techniques appropriate for their environments. Aim: This paper gathers and synthesizes empirical research on concurrent software testing to characterize the field and the types of empirical studies performed. Method: We performed a systematic mapping study to identify and analyze empirical research on concurrent software testing techniques. We provide a detailed analysis of the studies and their design choices. Results: The primary findings are: (1) there is a general lack of empirical validation of concurrent software testing techniques, (2) the type of evaluation method varies with the type of technique, (3) there are some key challenges to empirical study design in concurrent software testing, and (4) there is a dearth of controlled experiments in concurrent software testing. Conclusions: There is little empirical evidence available about some specific concurrent testing techniques like model-based testing and formal testing. Overall, researchers need to perform more empirical work, especially real-world case studies and controlled experiments, to validate properties of concurrent software testing techniques. In addition, researchers need to perform more analyses and synthesis of the existing evidence. This paper is a first step in that direction.

关键词： Empirical software engineering concurrent programming Software testing Systematic mapping

来源：评论

学校读者我要写书评

暂无评论

Distributed execution of communicating sequential process-style concurrency: Golang case study

引用

JOURNAL OF SUPERCOMPUTING 2019年第3期75卷 1396-1409页

作者： Whitney, James Gifford, Chandler Pantoja, Maria Cal Poly San Luis Obispo Coll Engn San Luis Obispo CA 93407 USA

In the last decade, the majority of new central processing units (CPU) have become multicore. To take advantage of these new architectures, we need programming languages that can express parallelisms. The programming language Golang is well known for providing developers with an easy programming model for communicating sequential process-style concurrency enabling programmers to easily write functions that will execute on the different cores of a modern multicore CPUs. Unfortunately, Golang does not support distributed execution of goroutines on clusters or distributed systems. In this paper, we extend the concurrency capabilities of Golang to a distributed cluster by providing a library called Gluster that is simple and easy to use. We developed a programming model that allows users to easily distribute work between machines, in a similar way as workloads are distributed in multicore CPUs by using operating system threads with libraries similar to Pthreads and OpenMP. Our Gluster solution is based on a single master node that connects to peers over a network and distributes work to these peers. The master node is able to send function arguments over the network to worker nodes as well as receive return values. Results using matrix multiplication show that our distributed implementation can speed up the goroutines by 5x in a small 16 nodes cluster, but more importantly, it shows that the results are scalable to cluster size.

关键词： concurrent programming Distributed computing Cluster HPC

来源：评论

学校读者我要写书评

暂无评论

Synthesis of multiple video streams through multi-thread programming

Synthesis of multiple video streams through multi-thread pro...

引用

第32届中国控制与决策会议

作者： Jian Wang Shihui Duan Jun Xu Song Wang Qiang Ling University of Science and Technology of China China Academy of Information and Communications Technology of MIIT Key Laboratory of Internet and industrial integration and innovation of MIIT

In some scenarios,we need to combine multiple video streams and pictures into a single *** this paper,we develop an application to synthesize two channel video stream and two channel *** application can be used for synthetic display of multiple network video streams and offline video synthetic *** the single thread decoding of multiple video streams takes a lot of time,we propose the use of a multithreading producer-consumer *** makes full use of the advantages of multi-core CPU and improves the programming *** our experiments,we compare video synthesis through single thread and *** is much faster than single threading.

关键词： Multiple video streams synthesis multithreading concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Comparing the the performance of concurrent hash tables implemented in Haskell

引用

SCIENCE OF COMPUTER programming 2019年 173卷 56-70页

作者： Duarte, Rodrigo Medeiros Du Bois, Andre Rauber Pilla, Mauricio Lima Cavalheiro, Gerson Geraldo H. Sander Reiser, Renata Hax Univ Fed Pelotas PPGC Gomes Carneiro 1 BR-96010610 Pelotas RS Brazil

This paper presents seven concurrent hash table implementations in Haskell, ranging from low-level synchronization mechanisms to high-level ones such as transactional memories. The hash tables were compared using different initial sizes, load factors, data types and hash functions. We also present a case study on implementing a color palette algorithm using the hash tables. The result of the comparison between the algorithms shows that the implementation using the STM Haskell transactional memory library and fine-grain synchronization provides the best performance and good scalability, followed by the implementation using lock striping and MVars. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Software transactional memory Haskell concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Using TOST in Teaching Mutual Exclusion, Synchronization, and Deadlock 29

Using TOST in Teaching Mutual Exclusion, Synchronization, an...

引用

29th Annual Conference of the European-Association-for-Education-in-Electrical-and-Information-Engineering (EAEEIE)

作者： Golemanov, Tzanko Golemanova, Emiliya Ruse Univ Dept Comp Syst & Technol Ruse Bulgaria

ISBN: (纸本)9781728132228

The paper describes the capabilities of the integrated environment TOST in teaching some of the basic IT concepts such as Mutual exclusion, concurrent processes synchronization, and Deadlock. The purpose of TOST is to be used in Operating systems and Parallel programming courses. It allows the student to develop and run sample programs in two simple PASCAL-style and C-style programming languages and to monitor the data in the main system tables. A set of well-known concurrent processing problems are presented in order to illustrate the TOST usage in teaching IT specialists.

关键词： Operating Systems concurrent programming Teaching Tools Mutual Exclusion Interprocess Synchronization Deadlock

来源：评论

学校读者我要写书评

暂无评论

Parallel Particle Advection and Lagrangian Analysis for 3D-PLI Fiber Orientation Maps 9

Parallel Particle Advection and Lagrangian Analysis for 3D-P...

引用

9th IEEE Symposium on Large Data Analysis and Visualization (LDAV)

作者： Demiralp, Ali C. Zielasko, Daniel Axer, Markus Vierjahn, Tom Kuhlen, Torsten W. Rhein Westfal TH Aachen Visual Comp Inst JARA HPC Aachen Germany Univ Trier Trier Germany Julich Res Ctr Julich Germany Westphalian Univ Appl Sci Gelsenkirchen Germany

ISBN: (纸本)9781728126050

3D-Polarized Light Imaging (3D-PLI) is a recent neuroimaging technique which is able to record the orientation of nerve fibers in unprecedented detail, reaching micrometer scale. Particle advection, which streamline tractography is based upon, is an established tool to study the structure of fiber tracts within the brain. This work presents a distributed particle advection pipeline for 3D-PLI fiber orientation maps, which are time-invariant vector fields describing the dominant orientation of nerve fibers at each point. Due to the high resolution, 3D-PLI creates large datasets ranging from few gigabytes up to hundreds of terabytes, which is addressed through a data-parallel approach to advection. Furthermore, we propose Lagrangian analysis of time-invariant brain data through computation of Finite-Time Lyapunov Exponents (FTLE), which may aid identification of macroscopic fiber bundles.

关键词： D.1.3 [Software]: programming Techniques concurrent programming I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling Curve, surface, solid and object representations

来源：评论

学校读者我要写书评

暂无评论

A Graph Transformation System formalism for Software Transactional Memory Opacity 19

A Graph Transformation System formalism for Software Transac...

引用

23rd Brazilian Symposium on programming Languages (SBLP)

作者： Cardoso, Diogo J. Foss, Luciana Du Bois, Andre R. Univ Fed Pelotas Programa Posgrad Comp Pelotas RS Brazil

ISBN: (纸本)9781450376389

In order to check the correctness of Transactional Memory (TM) systems, a formal description of the implementations guarantees is necessary. There are many consistency conditions for TM, one of the most common is opacity. In this paper we present a formal definition to prove opacity on TM histories using a Graph Transformation System (GTS). We explore the connection between a history definition, a sequence of actions to the TM, and a result of direct graph transformations based on the actions portrayed in the history. Thus, creating a framework capable of observing the property of opacity on TM histories.

关键词： Formal Semantics Graph Grammar Transactional Memory concurrent programming Model Checking

来源：评论

学校读者我要写书评

暂无评论

Framework for Development of Real-Time Applications on Embedded Systems 22

Framework for Development of Real-Time Applications on Embed...

引用

22nd Symposium on Image, Signal Processing and Artificial Vision (STSIVA)

作者： Restrepo Alvarado, Juan C. Benjumea Mazo, Miguel A. Lopez Parrado, Alexander Univ Quindio Fac Ingn Programa Ingn Elect Carrera 15 Calle 12 Norte Armenia Quindio Colombia

ISBN: (纸本)9781728114910

In this paper we describe RTX, a framework for development of real-time applications on embedded systems. RTX facilitates programming and structuring of source code when building this kind of applications. Also, RTX seeks to improve user-computer interaction in real-time applications development and helps to exploit the capabilities of multicore processors in modern embedded systems. In addition, RTX allows the programmer to build and execute real-time applications from a Graphical User Interface (GUI) inspired in the Arduino environment, in the same way, an Application programming Interface (API) is provided through a functions library for the C ++ programming language. For RTX validation, a real-time concurrent control system was implemented on a Raspberry Pi board by using designed API and GUI.

关键词： Framework real time embedded systems GUI API concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Analysis of Students' Preconceptions of Concurrency 1

Analysis of Students' Preconceptions of Concurrency

引用

1st ACM SIGSOFT International Workshop on Education through Advanced Software Engineering and Artificial Intelligence (EASEAI)

作者： Libert, Cedric Vanhoof, Wim Univ Namur Namur Belgium

ISBN: (纸本)9781450368520

In previous literature, several authors have recommended teaching concurrent programming, as the current evolution of IT involves concurrency. However, in order to teach concurrent programming properly, in a constructivist educational learning framework, we need to know the preconceptions students have regarding it. In this paper, we report on the results found from data collected through a questionnaire submitted in secondary schools to 101 students aged from 12 to 15. We detail the preconceptions of concurrent programming we extracted from the questionnaire answers and formulate recommendations toward creating a course teaching concurrent programming.

关键词： concurrency preconception teaching concurrent programming

来源：评论

学校读者我要写书评

暂无评论

Practical Progress Verification of Descriptor-Based Non-Blocking Data Structures 27

Practical Progress Verification of Descriptor-Based Non-Bloc...

引用

IEEE 27th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)

作者： Peterson, Christina Cook, Victor Dechev, Damian Univ Cent Florida Dept Comp Sci Orlando FL 32816 USA

ISBN: (纸本)9781728149516;9781728149509

The difficulty of designing non-blocking data structures has motivated techniques to verify that progress will always be made. Existing lock-free verification techniques assume that the ability of a thread to exit a CompareAndSwap-based loop implies lock-freedom. Wait-free verification techniques prove wait-freedom by showing that all loops terminate in a fixed number of iterations despite interference from other threads. Previous progress verification techniques do not accommodate loops whose termination is dependent on complex behaviors of the interfering threads, making these approaches unsuitable. We overcome these challenges by presenting the first progress verification technique for non-blocking algorithms that are dependent on descriptor-based helping mechanisms. Many practical lock-free data structures, wait-free data structures, and algorithms to facilitate non-blocking programming all incorporate descriptor objects to ensure that an operation comprising multiple atomic steps is completed according to the progress guarantee. We define algorithms for the communication through descriptor objects with interfering threads and define a loop invariant specification to prove progress of descriptor-based non-blocking data structures. To verify that all loops in a non-blocking data structure terminate according to the specification, we implement a practical framework that enables the semi-automatic verification of concurrent programs written in the C programming language. We demonstrate the application of our methodology on practical non-blocking data structures including a lock-free transactional list and a wait-free queue.

关键词： formal verification concurrent programming progress guarantees

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：