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

Technology for testing nondeterministic client/server database applications (vol 30, pg 69, 2004)

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 2004年第4期30卷 278-278页

作者： Hwang, GH Chang, SJ Chu, HD Natl Taiwan Normal Univ Dept Informat & Comp Educ Taipei 106 Taiwan Chunghwa Telecom Co LTd Telecommun Labs Taoyuan 326 Taiwan Takming Coll Dept Management Informat Syst Taipei 114 Taiwan

The execution of a client/server application involving database access requires a sequence of database transaction events (or, T-events), called a transaction sequence (or, T-sequence). A client/server database application may have nondeterministic behavior in that multiple executions thereof with the same input may produce different T-sequences. We present a framework for testing all possible T-sequences of a client/server database application. We first show how to define a T-sequence in order to provide sufficient information to detect race conditions between T-events. Second, we design algorithms to change the outcomes of race conditions in order to derive race variants, which are prefixes of other T-sequences. Third, we develop a prefix-based replay technique for race variants derived from T-sequences. We prove that our framework can derive all the possible T-sequences in cases where every execution of the application terminates. A formal proof and an analysis of the proposed framework are given. We describe a prototype implementation of the framework and present experimental results obtained from it.

关键词： client-server systems distributed databases formal verification program testing reachability analysis parallel programming client-server database database transaction event T-events transaction sequence T-sequence reachability testing database management system concurrent programming Database applications Frameworks reachability analysis database management systems Legal Executions Formal verification data base access client-server systems hazards and race conditions multiple execution Parallel programming program testing distributed databases

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Streamline Integration Using MPI-Hybrid Parallelism on a Large Multicore Architecture

引用

IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS 2011年第11期17卷 1702-1713页

作者： Camp, David Garth, Christoph Childs, Hank Pugmire, Dave Joy, Kenneth I. Univ Calif Davis Lawrence Berkeley Natl Lab Davis CA 95616 USA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Oak Ridge Natl Lab Oak Ridge TN 37831 USA

Streamline computation in a very large vector field data set represents a significant challenge due to the nonlocal and data-dependent nature of streamline integration. In this paper, we conduct a study of the performance characteristics of hybrid parallel programming and execution as applied to streamline integration on a large, multicore platform. With multicore processors now prevalent in clusters and supercomputers, there is a need to understand the impact of these hybrid systems in order to make the best implementation choice. We use two MPI-based distribution approaches based on established parallelization paradigms, parallelize over seeds and parallelize over blocks, and present a novel MPI-hybrid algorithm for each approach to compute streamlines. Our findings indicate that the work sharing between cores in the proposed MPI-hybrid parallel implementation results in much improved performance and consumes less communication and I/O bandwidth than a traditional, nonhybrid distributed implementation.

关键词： concurrent programming parallel programming modes of computation parallelism and concurrency picture/image generation display algorithms

来源：评论

学校读者我要写书评

暂无评论

SYNCHRONIZED EXECUTION ON SHARED MEMORY MULTIPROCESSORS

引用

PARALLEL COMPUTING 1988年第1-3期8卷 165-175页

作者： FRANCIS, R MATHIESON, I Department of Computer Science La Trobe University Bundoora 3083 Australia

Threads provides a mechanism for simulating the execution of parallel algorithms on a simplified model of a shared-memory multiprocessor. The algorithms can be expressed in a high-level block-structured language, which supports multiple threads of execution within a common body of program code. Results show an ability to achieve good speedup for small problems using algorithms derived by simple modifications of sequential algorithms. As well, a sibling thread synchronisation feature provides the basis for the synchronous execution of threads. k -parallel algorithms tailored to the machine size and implemented as synchronously executing iterations, can provide near linear speedup as the problem size is increased. The techniques described in this paper seem to promise an effective synchronous execution mode for shared-memory MIMD architectures.

关键词： concurrent programming language constructs parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

THE VELOX TRANSACTIONAL MEMORY STACK

引用

IEEE MICRO 2010年第5期30卷 76-87页

作者： Felber, Pascal Riviere, Etienne Moreira, Walther Maldonado Harmanci, Derin Marlier, Patrick Diestelhorst, Stephan Hohmuth, Michael Pohlack, Martin Cristal, Adrian Hur, Ibrahim Unsal, Osman S. Stenstrom, Per Dragojevic, Aleksandar Guerraoui, Rachid Kapalka, Michal Gramoli, Vincent Drepper, Ulrich Tomic, Sasa Afek, Yehuda Korland, Guy Shavit, Nir Fetzer, Christof Nowack, Martin Riegel, Torvald Univ Neuchatel Dept Comp Sci CH-2009 Neuchatel Switzerland Univ Politecn Cataluna E-08028 Barcelona Spain Tel Aviv Univ Tel Aviv Israel Tech Univ Dresden Dresden Germany Ecole Polytech Fed Lausanne CH-1015 Lausanne Switzerland Chalmers Univ Technol Gothenburg Sweden Barcelona Supercomp Ctr Barcelona Spain

The transactional memory programming paradigm could become the coordination methodology of choice for actual and future multicore and many-core architectures. The transactional memory support spans a complete software and hardware stack, including programming language and hardware support, runtime and libraries, compilers, and application environments. The VELOX project has developed such a comprehensive transactional memory stack.

关键词： compilers concurrent programming Hardware hardware transactional memory Java language extensions Libraries Program processors programming Runtime software transactional memory

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTATION OF A CSP-BASED EXTENSION OF PASCAL

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROprogramming 1988年第4期22卷 233-242页

作者： CERRADA, JA COLLADO, M UNIV POLITECN MADRID ESCUELA TECN SUPER INGN INDDEPT INGN SISTEMAS & AUTOMATE-28006 MADRIDSPAIN UNIV POLITECN MADRID FAC INFORMATDEPT LENGUAJES & SISTEMAS INFORMATE-28031 MADRIDSPAIN

A software tool for programming real-time concurrent systems is described. It appears as a set of extensions of the Pascal language, and is adequate for multiprocessor systems without common storage (like networks of micros). Applications can be programmed as a set of related tasks that communicate and are synchronized by message exchanges. The scheme is based on Hoare's csp construct and incorporates a logical channel mechanism (called port ) for communication control. A nondeterministic control structure based on Dijkstra's guarded commands is also included, thus allowing selective reception. An implementation based on a compiler-interpreter combination is also described. This implementation generates extended symbolic P-code and runs on a conventional minicomputer.

关键词： CSP Distributed systems programming Pascal extensions Message passing Nondeterministic programming Guarded commands concurrent programming

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTING concurrent-C

引用

SOFTWARE-PRACTICE & EXPERIENCE 1992年第3期22卷 265-285页

作者： GEHANI, NH ROOME, WD AT&T Bell Laboratories 600 Mountain Ave Murray Hill. New Jersey 07974 U.S.A.

concurrent C (C++) is a parallel superset of C (C++). Versions of concurrent C have now been implemented for a variety of uniprocessors and multiprocessors. We first implemented a uniprocessor version of concurrent C correctly anticipating that it would be relatively easy to extend the uniprocessor implementation to run on multiprocessors. concurrent C is translated to C. The generated C code contains calls to the C library implementing the concurrent C run-time system. This paper describes the 'hard core' details of the concurrent C implementation: the specifics of process states, the data structures used, the library functions, and the C code generated for various concurrent C constructs. We also give an overview of the concurrent C facilities and of the uniprocessor, distributed and shared-memory multiprocessor implementations.

关键词： concurrent programming concurrent C++ C++ PARALLEL programming

来源：评论

学校读者我要写书评

暂无评论

Modelling the semantics of multitasking facilities in concurrent C using Petri nets

引用

INFORMATION AND SOFTWARE TECHNOLOGY 1996年第1期38卷 3-9页

作者： Boujarwah, A AlSeif, N Saleh, K Kuwait University Department of Electrical and Computer Engineering P.O. Box 5969 Safat 13060 Kuwait

concurrent C (ConcC) [1] is a relatively new language that extends the C programming language [2] by incorporating multitasking facilities. These facilities are mainly based on the bidirectional rendez-vous concept, and they offer flexible and efficient mechanisms for the specification of concurrency, communication and synchronization often required in real-time systems. However, as for most real-time and concurrent programming languages such as Ada [3], the description of multitasking facilities in ConcC is lacking a rigorous and formal semantical definition. Most existing introductory materials to ConcC by its authors are informally described, and cannot be easily understood. In this paper, we explain the semantics of multitasking facilities in ConcC using the Petri net model. As is well known, the Petri net model is a formal graphical model that can describe concurrent behaviours of systems in a natural and intuitive manner, and yet it is based on strong mathematical and semantical foundations. Timed, inhibitor are and predicate Petri nets are extensions that are used to enhance the expressive power of the basic Petri net to model and explain all ConcC multitasking features.

关键词： concurrent C concurrent programming multitasking Petri nets real-time systems semantics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：