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

As-if-serial exception handling semantics for Java futures

SCIENCE OF COMPUTER programming 2009年第5-6期74卷 314-332页

作者： Zhang, Lingli Krintz, Chandra Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA Microsoft Corp Redmond WA 98052 USA

Exception handling enables programmers to specify the behavior of a program when an exceptional event occurs at runtime. Exception handling, thus, facilitates software fault tolerance and the production of reliable and robust software systems. With the recent emergence of multi-processor systems and parallel programming constructs, techniques are needed that provide exception handling support in these environments that are intuitive and easy to use. Unfortunately, extant semantics of exception handling for concurrent settings is significantly more complex to reason about than their serial counterparts. In this paper, we investigate a similarly intuitive semantics for exception handling for the future parallel programming construct in Java. Futures are used by programmers to identify potentially asynchronous computations and to introduce parallelism into sequential programs. The intent of futures is to provide some performance benefits through the use of method-level concurrency while maintaining as-if-serial semantics that novice programmers can easily understand - the semantics of a program with futures is the same as that for an equivalent serial version of the program. We extend this model to provide asif-serial exception handling semantics. Using this model our runtime delivers exceptions to the same point it would deliver them if the program was executed sequentially. We present the design and implementation of our approach and evaluate its efficiency using an open source Java virtual machine. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Java Exception handling concurrent programming Futures

来源：评论

学校读者我要写书评

暂无评论

Dynamic slicing of concurrent specification languages

引用

PARALLEL COMPUTING 2016年第Apr.期53卷 1-22页

作者： Llorens, M. Oliver, J. Silva, J. Tamarit, S. Univ Politecn Valencia Dept Sistemas Informat & Comp E-46022 Valencia Spain Univ Politecn Madrid Babel Res Grp Fac Informat Campus Montegancedo S-N Boadilla Del Monte 28660 Spain

Dynamic slicing is a technique to extract the part of the program (called slice) that influences or is influenced, in a particular execution, by a given point of interest in the source code (called slicing criterion). Since a single execution is considered, the technique often uses a trace of this execution to analyze data and control dependencies. In this work we present the first formulation and implementation of dynamic slicing in the context cif CSP. Most of the ideas presented can be directly applied to other concurrent specification languages such as Promela or CCS, but we center the discussion and the implementation on CSP. We base our technique on a new data structure to represent CSP computations called track. A track is a data structure which represents the sequence of expressions that have been evaluated during the computation, and moreover, it is labeled with the location of these expressions in the specification. The implementation of a dynamic slicer for CSP is useful for debugging, program comprehension, and program specialization, and it is also interesting from a theoretical perspective because CSP introduces difficulties such as heavy concurrency and non-determinism, synchronizations, frequent absence of data dependence, etc. (C) 2016 Elsevier B.V. All rights reserved.

关键词： concurrent programming CSP Slicing

来源：评论

学校读者我要写书评

暂无评论

Study of hardware transactional memory characteristics and serialization policies on Haswell

引用

PARALLEL COMPUTING 2016年 54卷 46-58页

作者： Pereira, Marcio Machado Gaudet, Matthew Amaral, J. Nelson Araujo, Guido Univ Estadual Campinas UNICAMP Inst Comp Sci Campinas SP Brazil Univ Alberta Dept Comp Sci Edmonton AB T6G 2M7 Canada

This paper presents an extensive performance study of the implementation of Hardware Transactional Memory (HTM) in the Haswell generation of Intel x86 core processors. It evaluates the strengths and weaknesses of this new architecture by exploring several dimensions in the space of Transactional Memory (TM) application characteristics using the Eigen-bench (Hong et al., 2010 [1]) and the CLOMP-TM (Schindewolf et al., 2012 [2]), benchmarks. This paper also introduces a new tool, called htm-pBuilder that tailors fallback policies and allows independent exploration of its parameters. This detailed performance study provides insights on the constraints imposed by the Intel's Transaction Synchronization Extension (Intel's TSX) and introduces a simple, but efficient policy for guaranteeing forward progress on top of the best-effort Intel's HTM which was critical to achieving performance. The evaluation also shows that there are a number of potential improvements for designers of TM applications and software systems that use Intel's TM and provides recommendations to extract maximum benefit from the current TM support available in Haswell. (C) 2015 Elsevier B.V. All rights reserved.

关键词： programming techniques concurrent programming Transactional memory

来源：评论

学校读者我要写书评

暂无评论

ParMiBench - An Open-Source Benchmark for Embedded Multiprocessor Systems

IEEE COMPUTER ARCHITECTURE LETTERS

引用

IEEE COMPUTER ARCHITECTURE LETTERS 2010年第2期9卷 45-48页

作者： Iqbal, Syed Muhammad Zeeshan Liang, Yuchen Grahn, Hakan Blekinge Inst Technol Sch Comp SE-37179 Karlskrona Sweden

Multicore processors are the main computing platform in laptops, desktop, and servers today, and are making their way into the embedded systems market also. Using benchmarks is a common approach to evaluate the performance of a system. However, benchmarks for embedded systems have so far been either targeted for a uni-processor environment, e. g., MiBench, or have been commercial, e. g., MultiBench by EEMBC. In this paper, we propose and implement an open source benchmark, ParMiBench, targeted for multiprocessor-based embedded systems. ParMiBench consists of parallel implementations of seven compute intensive algorithms from the uni-processor benchmark suite MiBench. The applications are selected from four domains: Automation and Industry Control, Network, Office, and Security.

关键词： concurrent programming Multiprocessor Systems Performance Evaluation

来源：评论

学校读者我要写书评

暂无评论

Multithreaded transactions in scientific computing: New versions of a computer prograrn for kinematical calculations of RHEED intensity oscillations

引用

COMPUTER PHYSICS COMMUNICATIONS 2006年第10期175卷 678-681页

作者： Brzuszek, Marcin Daniluk, Andrzej Marie Curie Sklodowska Univ Inst Comp Sci Dept Appl Comp Sci PL-20031 Lublin Poland

Writing a concurrent program can be more difficult than writing a sequential program. Programmer needs to think about synchronisation, race conditions and shared variables. Transactions help reduce the inconvenience of using threads. A transaction is anion, which allows programmers to group a sequence of actions on the program into a logical, higher-level computation unit. This paper presents multithreaded versions of the GROWTH program, which allow to calculate the layer coverages during the growth of thin epitaxial films and the corresponding RHEED intensities according to the kinematical approximation. The presented programs also contain graphical user interfaces, which enable displaying program data at run-time. New version program Titles of programs:GROWTHGr, GROWTH06 Catalogue identifier:ADVL_v2_0 Program URL: http://***/summaries/ADVL_v2_0 Program obtainable from:CPC Program Library, Queen??s University of Belfast, N. Ireland Catalogue identifier of previous version:ADVL Does the new version supersede the original program:No Computer for which the new version is designed and others on which it has been tested: Pentium-based PC Operating systems or monitors under which the new version has been tested: Windows 9x, XP, NT programming language used:Object Pascal Memory required to execute with typical data:More than 1 MB Number of bits in a word:64 bits Number of processors used:1 No. of lines in distributed program, including test data, etc.:20 931 Number of bytes in distributed program, including test data, etc.: 1 311 268 Distribution format:*** Nature of physical problem: The programs compute the RHEED intensities during the growth of thin epitaxial structures prepared using the molecular beam epitaxy (MBE). The computations are based on the use of kinematical diffraction theory [P.I. Cohen, G.S. Petrich, P.R. Pukite, G.J. Whaley, A.S. Arrott, Surf. Sci. 216 (1989) 222. [1]]. Method of solution: Epitaxial growth of Fig. 1. Internal structure o

关键词： reflection high-energy electron diffraction (RHEED) molecular beam epitaxy (MBE) non-linear differential equations transactions concurrent programming UML

来源：评论

学校读者我要写书评

暂无评论

CONCLASS - A FRAMEWORK FOR REAL-TIME DISTRIBUTED KNOWLEDGE-BASED PROCESSING

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1994年第6期6卷 909-919页

作者： MAEGAWA, H STANFORD UNIV KNOWLEDGE SYST LABSTANFORDCA 94305

We have developed a problem-solving framework, called ConClass, that is capable of classifying continuous realtime problems dynamically and concurrently on a distributed system. ConClass provides an efficient development environment for describing and decomposing a classification problem and synthesizing solutions. In ConClass, decomposed concurrent subproblems specified by the application developer effectively correspond to the actual distributed hardware elements. This scheme is useful for designing and implementing efficient distributed processing, making it easier to anticipate and evaluate system behavior. The ConClass system provides an object replication feature that prevents any particular object from being overloaded. In order to deal with an indeterminate amount of problem data, ConClass dynamically creates object networks that justify hypothesized solutions, and thus achieves a dynamic load distribution. A number of efficient execution mechanisms that manage a variety of asynchronous aspects of distributed processing have been implemented without using schedulers or synchronization schemes that are liable to develop bottlenecks. We have confirmed the efficiency of parallel distributed processing and load balancing of ConClass with an experimental application.

关键词： ASYNCHRONOUS MESSAGE PASSING CLASSIFICATION PROBLEM SOLVING concurrent programming DISTRIBUTED PROCESSING INFORMATION FUSION KNOWLEDGE-BASED SYSTEM LOAD BALANCING PROBLEM DECOMPOSITION REAL-TIME PROCESSING SIGNAL INTERPRETATION

来源：评论

学校读者我要写书评

暂无评论

An Interleaving Guided Metamorphic Testing Approach for concurrent Programs

引用

ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY 2024年第1期33卷 1-21页

作者： Sun, Chang-Ai Dai, Hepeng Geng, Ning Liu, Huai Chen, Tsong Yueh Wu, Peng Cai, Yan Wang, Jinqiu Univ Sci & Technol Beijing 30 Xueyuan Rd Beijing 100083 Peoples R China Swinburne Univ Technol John St Hawthorn Vic 3122 Australia Chinese Acad Sci State Key Lab Comp Sci Inst Software Beijing 100190 Peoples R China Univ Chinese Acad Sci Beijing 100190 Peoples R China

concurrent programs are normally composed of multiple concurrent threads sharing memory space. These threads are often interleaved, which may lead to some non-determinism in execution results, even for the same program input. This poses huge challenges to the testing of concurrent programs, especially on the test result verification-that is, the prevalent existence of the oracle problem. In this article, we investigate the application of metamorphic testing (MT), a mainstream technique to address the oracle problem, into the testing of concurrent programs. Based on the unique features of interleaved executions in concurrent programming, we propose an extended notion of metamorphic relations, the core part of MT, which are particularly designed for the testing of concurrent programs. A comprehensive testing approach, namely ConMT, is thus developed and a tool is built to automate its implementation on concurrent programs written in Java. Empirical studies have been conducted to evaluate the performance of ConMT, and the experimental results show that in addition to addressing the oracle problem, ConMT outperforms the baseline traditional testing techniques with respect to a higher degree of automation, better bug detection capability, and shorter testing time. It is clear that ConMT can significantly improve the cost-effectiveness for the testing of concurrent programs and thus advances the state of the art in the field. The study also brings novelty into MT, hence promoting the fundamental research of software testing.

关键词： concurrent programming metamorphic testing interleaving executions data race

来源：评论

学校读者我要写书评

暂无评论

CSP-I - AN IMPLEMENTATION OF COMMUNICATING SEQUENTIAL PROCESSES

引用

SOFTWARE-PRACTICE & EXPERIENCE 1988年第6期18卷 545-560页

作者： WRENCH, KL Department of Computer Science Rhodes University Grahamstown 6140 South Africa

Hoare's proposal for a notation for communicating sequential processes has led to the development of a number of concurrent languages based on the concept of message passing. CSP-i is a new language which reflects the design objectives of the original CSP notation more faithfully than most of these other languages. This paper describes the development of the language, as well as an implementation for a single processor, with simulated time-slicing providing pseudo-concurrency.

关键词： concurrent programming Message passing Communicating sequential processes

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of SCOOP programs

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2012年第11期85卷 2519-2530页

作者： Morandi, Benjamin Nanz, Sebastian Meyer, Bertrand ETH Chair Software Engn CH-8092 Zurich Switzerland

To support developers in writing reliable and efficient concurrent programs, novel concurrent programming abstractions have been proposed in recent years. programming with such abstractions requires new analysis tools because the execution semantics often differs considerably from established models. We present a performance analyzer that is based on new metrics for programs written in SCOOP, an object-oriented programming model for concurrency. We discuss how the metrics can be used to discover performance issues, and we use the tool to optimize a concurrent robotic control software. (c) 2012 Elsevier Inc. All rights reserved.

关键词： Performance analysis Performance metric Profiling Tracing concurrent programming SCOOP

来源：评论

学校读者我要写书评

暂无评论

EDISON-N - AN EDISON IMPLEMENTATION FOR A NETWORK OF MICROCOMPUTERS

引用

SOFTWARE-PRACTICE & EXPERIENCE 1988年第4期18卷 349-363页

作者： DUBNICKI, C MADEY, J WYGLADALA, W Institute of Informatics Warsaw University PKiN room 850 00–901 Warsaw Poland

This paper describes an experimental implementation of the Edison programming language for a network of microcomputers based on the Z-80 microprocessor. The resulting Edison-N system allows parallel execution of concu... 详细信息

关键词： Edison concurrent programming Real parallelism Synchronization Education

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：