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

ConTesa: Directed Test Suite Augmentation for concurrent Software

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2020年第4期46卷 405-419页

作者： Yu, Tingting Huang, Zunchen Wang, Chao Univ Kentucky Dept Comp Sci Lexington KY 40506 USA Univ Southern Calif Dept Comp Sci Los Angeles CA 90089 USA

As software evolves, test suite augmentation techniques may be used to identify which part of the program needs to be tested due to code changes and how to generate these new test cases for regression testing. However, existing techniques focus exclusively on sequential software, without considering concurrent software in which multiple threads may interleave with each other during the execution and thus lead to a combinatorial explosion. To fill the gap, we propose ConTesa, the first test suite augmentation tool for concurrent software. The goal is to generate new test cases capable of exercising both code changes and the thread interleavings affected by these code changes. At the center of ConTesa is a two-pronged approach. First, it judiciously reuses the current test inputs while amplifying their interleaving coverage using random thread schedules. Then, it leverages an incremental symbolic execution technique to generate more test inputs and interleavings, to cover the new concurrency-related program behaviors. We have implemented ConTesa and evaluated it on a set of real-world multithreaded Linux applications. Our results show that it can achieve a significantly high interleaving coverage and reveal more bugs than state-of-the-art testing techniques.

关键词： Testing Schedules Instruction sets concurrent computing Tools Context Regression testing concurrent programming symbolic execution dynamic analysis

来源：评论

学校读者我要写书评

暂无评论

A survey of concurrency-oriented refactoring

引用

concurrent ENGINEERING-RESEARCH AND APPLICATIONS 2020年第4期28卷 319-330页

作者： Zhang, Yang Li, Liuxu Zhang, Dongwen Hebei Univ Sci & Technol Sch Informat Sci & Engn Shijiazhuang 050000 Hebei Peoples R China

Refactoring has become an effective approach to convert sequential programs into concurrent programs. Many refactoring algorithms and tools are proposed to assist developers in writing high-performance concurrent programs. Although researchers actively conduct surveys on refactoring, we are not aware of any survey that summarizes, categorizes and discusses concurrency-oriented refactoring. To this end, this paper presents a survey that investigates how refactoring assists with concurrent programming. To the best of our knowledge, this paper is the first survey that summarizes the state-of-the-art, concurrency-oriented refactoring. First, we design six research questions addressing the concurrent structure, programming language, performance improvement and consistency evaluation. Second, we answer these questions by examining the related papers and then present the results to show how refactoring provides support for concurrent programming after a decade of development, such as transforming the concurrent structures, supporting parallel language, and improving performance. Finally, we summarize the related works and present the future trends.

关键词： concurrent programming refactoring survey consistency performance

来源：评论

学校读者我要写书评

暂无评论

Safety and Security Framework for Exception Handling in concurrent programming

Safety and Security Framework for Exception Handling in Conc...

引用

3rd International Conference on Advances in Computing and Communications (ICACC)

作者： Anwer, Faisal Nazir, Mohd. Mustafa, Khurram Jamia Millia Islamia Dept Comp Sci Cent Univ New Delhi India

ISBN: (纸本)9780769550336

Exception handling mechanism provides a structured way of handling errors in software applications as compared to traditional error handling. Moreover it may cause safety and security threats if not used carefully. Some of the possible issues are information leakage, spoofed parent classes and inconsistent states. Unfortunately most programmers are rarely aware of exception handling re-percussions, in case of inappropriate exception handling. However, with the advent of multi-core processors people are more interested in utilizing all the computational powers of machine by using concurrent programming. This also brings up new challenges in terms of exception handling decisions like retry, continuation, rollback, termination and at the same time maintaining the clean state of the program. In this paper we propose a safety and security architecture by using Aspect Oriented programming (AOP) technique and transactional memory (TM) concept without making any modifications to the development language.

关键词： Exception Handling Transactional Memory Safety and Security Information Leakage concurrent programming Multi-threading

来源：评论

学校读者我要写书评

暂无评论

A History of the Oz Multiparadigm Language

引用

PROCEEDINGS OF THE ACM ON programming LANGUAGES-PACMPL 2020年第HOPL期4卷 1–56页

作者： Van Roy, Peter Haridi, Seif Schulte, Christian Smolka, Gert Catholic Univ Louvain B-1348 Louvain La Neuve Belgium Royal Inst Technol Stockholm Sweden RISE Stockholm Sweden Saarland Univ Saarbrucken Germany

Oz is a programming language designed to support multiple programming paradigms in a clean factored way that is easy to program despite its broad coverage. It started in 1991 as a collaborative effort by the DFKI (Germany) and SICS (Sweden) and led to an influential system, Mozart, that was released in 1999 and widely used in the 2000s for practical applications and education. We give the history of Oz as it developed from its origins in logic programming, starting with Prolog, followed by concurrent logic programming and constraint logic programming, and leading to its two direct precursors, the concurrent constraint model and the Andorra Kernel Language (AKL). We give the lessons learned from the Oz effort including successes and failures and we explain the principles underlying the Oz design. Oz is defined through a kernel language, which is a formal model similar to a foundational calculus, but that is designed to be directly useful to the programmer. The kernel language is organized in a layered structure, which makes it straightforward to write programs that use different paradigms in different parts. Oz is a key enabler for the book Concepts, Techniques, and Models of Computer programming (MIT Press, 2004). Based on the book and the implementation, Oz has been used successfully in university-level programming courses starting from 2001 to the present day.

关键词： Computer programming multiparadigm programming concurrent programming dataflow functional programming logic programming lazy evaluation programming education distributed programming

来源：评论

学校读者我要写书评

暂无评论

Transactions in the Era of Non Volatile Memory and Heterogeneous Memory Architectures 21

Transactions in the Era of Non Volatile Memory and Heterogen...

引用

ACM/SPEC International Conference on Performance Engineering (ICPE)

作者： Romano, Paolo Univ Lisbon Inst Super Tecn Lisbon Portugal INESC ID Lisbon Portugal

ISBN: (纸本)9781450383318

Transactions are a simple, yet powerful, abstraction that aims at masking programmers from the complexity of having to ensure correct and efficient synchronization of concurrent *** introduced in the domain of database systems, transactions have recently garnered significant interest in the broader domain of concurrent programming, via the Transactional Memory (TM) paradigm. Nowadays, hardware supports for TM are provided in commodity CPUs (e.g., by Intel and IBM) and, at the software level, TM has been integrated in mainstream programming languages, such as C/C++ and *** this talk I will present the novel challenges and research opportunities that arise in the area of TM due to the emergence of two recent hardware trends, namely Non-Volatile Memory (NVM) and heterogeneous computing *** the front of NVM, I will focus on the problem of how to allow the execution of transactions over NVM using unmodified commodity hardware TM (HTM) implementations. However, the reliance of commodity HTM implementations on CPU caches raises a crucial problem when applications access data stored in NVM from within a HTM transaction. Since CPU caches are volatile in today's systems, HTM implementations do not guarantee that the effects of a hardware transaction are atomically transposed to PM when the transaction commits --- although such effects are immediately visible to subsequent *** this talk, I will overview somoe recent approaches to tackle this problem and present experimental results highlighting the existence of several bottlenecks that hinder the scalability of existing solutions. Next, I will show how these limitations can be addressed by presenting SPHT. SPHT introduces a novel commit logic that considerably mitigates the scalability bottlenecks of previous alternatives, providing up to 2.6x/2.2x speedups at 64 threads in, resp., STAMP/TPC-C. Moreover, SPHT introduces a novel approach to log replay that employs cross-transaction log l

关键词： concurrent programming Transactional Memory Non-Volatile Memory Heterogeneous Architectures

来源：评论

学校读者我要写书评

暂无评论

GMR: graph-compatible MapReduce programming model

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2019年第1期78卷 457-475页

作者： Zhang, Weidong He, Boxin Chen, Yifeng Zhang, Qifei Peking Univ Beijing Peoples R China Zhejiang Univ Hangzhou Zhejiang Peoples R China

The MapReduce programming model is widely used to parallelize data processing over the large scale of commodity computer clusters. However, on account of its monotonous data representation, it fails to express graph-parallel algorithms naturally and execute them efficiently. Alternatively, Pregel and PowerGraph could address these challenges. But they require users to familiarize another set of programming patterns and platforms, and at the same time the legacy MapReduce code also becomes incompatible and useless. In this paper, we proposed the Graph-compatible MapReduce (GMR) as an extension of Google's Standard MapReduce (SMR). In this way, graph-parallel algorithm will be naturally expressed without compromising the efficiency and simplicity, and meanwhile the conventional MapReduce programming pattern be preserved. Also, users could gain the convenience of Think like a vertex. Based on the experimental studying, we analyzed the ratio of the redundant computation, transmission and data caching introduced in naive iterative MapReduce platforms (e.g., HaLoop, Twister). Furthermore, we discussed the difference between GMR and the graph-targeted frameworks. The evaluation experiment results show that GMR outperforms GraphX in a series of real-world graph-parallel algorithms.

关键词： Distributed systems Parallel architectures Graph theory Systems programs and utilities Performance analysis and design aids concurrent programming Modes of computation Performance of systems

来源：评论

学校读者我要写书评

暂无评论

An Implementation of User-Level Processes using Address Space Sharing 34

An Implementation of User-Level Processes using Address Spac...

引用

34th IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Hori, Atsushi Gerofi, Balazs Ishikawa, Yutaka RIKEN Ctr Computat Sci Tokyo Japan

ISBN: (纸本)9781728174457

There is a wide range of implementation approaches to multi-threading. User-level threads are efficient because threads can be scheduled by a user-defined scheduling policy that suits the needs of the specific application. However, user-level threads are unable to handle blocking system-calls efficiently. To the contrary, kernel-level threads incur large overhead during context switching. Kernel-level threads are scheduled by the scheduling policy provided by the OS kernel which is hard to customize to application needs. We propose a novel thread execution model, bi-level thread, that combines the best aspects of the two conventional thread implementations. A bi-level thread can be either a kernel-level thread or a user-level thread at runtime. Consequently, the context switching overhead of a bi-level thread is as low as that of user-level threads, but thread scheduling can be defined by user policies. Blocking system-calls, on the other hand, can be called as a kernel-level thread without blocking the execution of other user-level threads. Furthermore, the proposed bi-level thread is combined with an address space sharing technique which allows processes to share the same virtual address space. Processes sharing the same address space can be scheduled with the same technique as user-level threads, thus we call this implementation a user-level process. However, the main difference between threads and processes is that threads share most of the kernel state of the underlying process, such as process ID and file descriptors, whereas different processes do not. A user-level process must guarantee that the system-calls always access the appropriate kernel information that belongs to the particular process. We call this system-call consistency. In this paper, we show that the proposed bi-level threads, implemented in an address space sharing library, can resolve the blocking system-call issue of user-level threads, while at the same time it retains system-call consisten

关键词： Threads concurrent programming concurrent programming structures

来源：评论

学校读者我要写书评

暂无评论

Beyond traditional architecture for MDO applications: The Erlang VM and its potential 2

Beyond traditional architecture for MDO applications: The Er...

引用

Conference on Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications II Part of SPIE Defense + Commercial Sensing Conference

作者： Wilkinson, C. M. Bastian, Nathaniel D. Kwon, Minseok US Mil Acad Army Cyber Inst West Point NY 10996 USA US Dept Def Joint Artificial Intelligence Ctr Washington DC 20305 USA Rochester Inst Technol Dept Comp Sci Rochester NY 14623 USA

ISBN: (纸本)9781510636040

In order to scale for speed, technology often builds upon the earliest proven systems and architectures. As the context changes, from a civilian application domain to a military application domain, the priority of functional requirements can and often do change. The hardware, software, and language development environment set the foundation for the constraints and potential of a system. This along with the fact the information technology revolution, since early 2000, has primarily been driven by the commercial sector, requires engineers to consider whether nontraditional, less well-known architectures may have a role in the Multi-Domain Operations (MDO) application space. This paper will highlight features inherent to traditional architectures, the challenges associated with these architectural features, and how the Erlang VM represents an opportunity to develop an architectural foundation suitable to the MDO application domain. Finally, this paper will highlight a future technology concept integrating demonstrated neural interface technology with an Erlang VM supported architecture. This foundation will help enable human-machine teaming by empowering a human agent to interact with sensors and AI-enabled autonomous systems with a dynamic user interface allowing the human agent to accomplish MDO applications. The great potential for the concept depends on a fault-tolerant, distributed system permitted by the Erlang VM to flexibly integrate the capabilities required to address the diverse challenges of a complex operating environment.

关键词： distributed computing Erlang virtual machine edge computing concurrent programming Multi-Domain Operations CTRL-kit neural interface platform

来源：评论

学校读者我要写书评

暂无评论

Contributions to improve the combined selection of concurrent software testing techniques 20

Contributions to improve the combined selection of concurren...

引用

5th Brazilian Symposium on Systematic and Automated Software Testing (SAST)

作者： Santos, Italo Furlanetti, Andre B. P. Melo, Silvana M. Lopes de Souza, Paulo Sergio Delamaro, Marcio E. Souza, Simone R. S. Univ Sao Paulo ICMC USP Sao Carlos SP Brazil Fed Univ Grande Dourados UFGD Dourados MS Brazil

ISBN: (纸本)9781450387552

[Context] There are a variety of testing techniques available that present different and often complementary characteristics (e.g., cost of application, effectiveness in revealing defects, types of defects). Considering these complementary characteristics make the selection process even more complex. Testers must make decisions on which techniques they will use in a specific situation. Combining different testing techniques outperforms the use of any single technique alone. [Objective] This paper proposes an approach to support the combined selection of testing techniques for concurrent software projects. The approach is implemented in the SeleCTT-v2 tool, supporting testers to find complementary testing techniques in the body of knowledge proposed in SeleCTT-v1. [Method] We conducted a case study to evaluate the combined selection approach (SeleCTT-v2) with the previous version of the SeleCTT-v1 and to investigate how testers perform a combined selection task for concurrent software projects. [Results and Conclusions] The results indicated a rise in the effectiveness of the combined selection of concurrent testing techniques suggested, which demonstrates SeleCTT-v2 is less likely to make an incorrect recommendation of combined techniques for a concurrent software project, thus avoiding costs associated with the incorrect application of a testing technique. If the testers could access a tool that supports the selection process, the effectiveness of the results would have reached a higher value, as evidenced by our approach. Performing the combination of testing techniques is essential to ensure that software under test has all their features tested to prevent possible errors.

关键词： testing techniques selection combined selection concurrent programming concurrent software testing

来源：评论

学校读者我要写书评

暂无评论

React++: A Lightweight Actor Framework in C++

React++: A Lightweight Actor Framework in C++

引用

作者： Khan, Md Navid Alvee University of Waterloo

学位级别：硕士

Distributed software remains susceptible to data races and poor scalability because of the widespread use of locks and other low-level synchronization primitives. Furthermore, using this programming approach is known to break encapsulation offered by object-oriented programming. Actors present an alternative model of concurrent computation by serving as building blocks with a higher level of abstraction. They encapsulate concurrent logic in their behaviors and rely only on asynchronous exchange of messages for synchronization, preventing a broad range of concurrent issues by eschewing locks. Existing actor frameworks often seem to focus on CPU-bound workloads and lack an actor-oriented I/O infrastructure. The purpose of this thesis is to investigate the scalability of user-space I/O operations carried out by actors. It presents an experimental actor framework named React++, with an M: N runtime for cooperative scheduling of actors and an integrated I/O subsystem. Load distribution is policy-driven and uses a variant of the randomized work-stealing algorithm. The evaluation of the framework is carried out in three stages. First, the efficiency of message delivery, scheduling and load balancing is assessed by a set of micro-benchmarks, where React++ retains a competitive score against several well-known actor frameworks. Next, a web server built on React++ is shown to be on par with its fastest event-driven counterparts in the TechEmpower plaintext benchmark. Finally, the runtime of an existing messaging library (ZeroMQ) is augmented with React++, replacing the backend and delegating all network I/O to actors without incurring any substantial overhead.

关键词： C++ actor model concurrent programming work-stealing non-blocking I/O event-driven programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：