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

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 an abstraction, 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 summary Titles of programs: GROWTHGr, GROWTH06 Catalogue identifier: ADVL_v2_0 Program summary 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 gr

关键词： 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

来源：评论

学校读者我要写书评

暂无评论

TM²C: a software transactional memory for many-cores

引用

DISTRIBUTED COMPUTING 2018年第5期31卷 367-388页

作者： Gramoli, Vincent Guerraoui, Rachid Trigonakis, Vasileios Oracle Labs Zurich Switzerland Univ Sydney NICTA Bldg J12 Sydney NSW 2006 Australia Univ Sydney Concurrent Syst Res Grp Bldg J12 Sydney NSW 2006 Australia Ecole Polytech Fed Lausanne ICT LPD Stn 14 CH-1015 Lausanne Switzerland

Transactional memory is an appealing paradigm for concurrent systems. Many software implementations of the paradigm were proposed in the past two decades for both shared memory multi-core systems and clusters of distributed machines. Chip manufacturers have however started producing many-core architectures, with low network-on-chip communication latencies and limited support for cache coherence, rendering existing transactional-memory implementations inapplicable. This paper presents , the first software transactional memory protocol for many-core systems, hence featuring transactions that are both distributed and leverage shared memory. exploits fast messages over network-on-chip to make accesses to shared data coherent. In particular, it allows visible read accesses to detect conflicts eagerly and incorporates the first distributed contention manager that guarantees the commit of all transactions. We evaluate on Intel, AMD and Tilera architectures, ranging from common multi-cores to experimental many-cores. We build upon new message-passing protocols, based on both software and hardware, which are interesting in their own right. Our results on various benchmarks, including realistic banking and MapReduce applications, show that scales well regardless of the underlying platform.

关键词： Transactional memory Many-cores concurrent programming Contention management

来源：评论

学校读者我要写书评

暂无评论

ON-THE-FLY GARBAGE COLLECTION FOR SEVERAL MUTATORS

引用

DISTRIBUTED COMPUTING 1992年第4期5卷 187-199页

作者： JONKER, JE Department of Mathematics and Computing Science University of Groningen Groningen The Netherlands

An algorithm is given for on-the-fly garbage collection in the presence of several mutators. It uses two colours and is a generalization of Ben-Ari's algorithm (1984). The correctness proof is based on the lexical orderings of several tuples of state space functions. It is shown that in a certain sense the algorithm is optimal. Three variations of the algorithm are given and proved correct. In the case that there is only one mutator one of these variations closely resembles a well-known incorrect algorithm.

关键词： concurrent programming CORRECTNESS GARBAGE COLLECTION

来源：评论

学校读者我要写书评

暂无评论

Synchronization as a Special Case of Access Control

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2009年第C期241卷 113-133页

作者： Puntigam, Franz Vienna Univ Technol Inst Comp Languages Vienna Austria

Synchronization ensures exclusive shared-variable access at runtime, and static access control mechanisms give similar guarantees at compilation time. Usually we treat these language concepts as separate. In this work we propose to integrate synchronization into access control in a Java-like language: Shared-variable access depends on the availability of tokens (as a form of access control), and the compiler generates code for locking to gain the needed tokens (synchronization). We get more freedom in expressing synchronization at appropriate points in a program and weaker influence of concurrency on the program structure.

关键词： Synchronization access control concurrent programming object-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Support for implementation of evolutionary concurrent systems

引用

INTERNATIONAL JOURNAL OF PARALLEL programming 2001年第4期29卷 401-431页

作者： Pandey, R Browne, JC Univ Calif Davis Dept Comp Sci Parallel & Dist Comp Lab Davis CA 95616 USA Univ Texas Dept Comp Sci Austin TX 78702 USA

concurrent programs that embed specifications of synchronizations in the body of their component are difficult to extend and modify. Small changes in a concurrent program, particularly changes in the interactions among components, may require re-implementation of a large number of components. Even specifications of components cannot be reused easily. This paper presents a concurrent program composition mechanism in which both specification and implementation of computations and interactions are completely separated. Separation of specifications and implementations facilitates extensions and modifications of programs by allowing one to separately change the implementations of computations and interactions. It also supports their reusability. The paper also describes the design and implementation of a concurrent object-oriented programming language based on this model, including a compiler for the language, and reports on the execution behavior of programs written in the language.

关键词： software evolution concurrent programming object-oriented programming inheritance genericity

来源：评论

学校读者我要写书评

暂无评论

AN INCREMENTAL GARBAGE COLLECTION ALGORITHM FOR MULTI-MUTATOR SYSTEMS

引用

DISTRIBUTED COMPUTING 1988年第1期3卷 41-50页

作者： PIXLEY, C MCC (VLSI CAD Program) Austin USA

An elementary correctness proof for Ben-Ari's algorithm (1984) for incremental garbage collection is given. We give a new algorithm for systems in which there are multiple mutators and a proof of its correctness, which is a minor modification of the previous proof. Finally, we remark upon a way to implement these algorithms that may increase their performance on certain architectures.

关键词： concurrent programming Correctness proofs Garbage collection Multiprocessing Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Multithreaded transactions in scientific computing. The Growth06_v2 program

引用

COMPUTER PHYSICS COMMUNICATIONS 2009年第7期180卷 1219-1220页

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

Note: The figures mentioned above are contained in the program distribution file Writing a concurrent program can be more difficult than writing a sequential program. Programmer needs to think about synchronization, race conditions and shared variables. Transactions help reduce the inconvenience of using threads. A transaction is an abstraction, which allows programmers to group a sequence of actions on the program into a logical, higher-level computation unit. This paper presents a new version of the GROWTHGr and GROWTH06 programs. New version program summary Program title: GROWTH06_v2 Catalogue identifier: ADVL_v2_1 Program summary URL: http://***/sunimaries/ADVL_v2_*** Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://***/licence/*** No. of lines in distributed program, including test data, etc.: 65 255 No. of bytes in distributed program, including test data, etc.: 865 985 Distribution format: *** programming language: Object Pascal Computer: Pentium-based PC Operating system: Windows 9x, XP, NT, Vista RAM: more than 1 MB Classification: 4.3, 7.2, 6.2. 8, 14 Catalogue identifier ofprevious version: ADVL_v2_0 Journal reference of previous version: Comput. Phys. Comm. 175 (2006) 678 Does the new version supersede the previous version?: Yes Nature of 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. Solution method: Epitaxial growth of thin films is modelled by a set of non-linear differential equations [1]. The Runge-Kutta method with adaptive stepsize control was used for solving initial value problem for non-linear differential equations [2]. Reasons for new version: According to the users' suggestions functionality of the program has been improved. Moreover, new use c

关键词： Reflection high-energy electron diffraction (RHEED) Non-linear differential equations Transactions concurrent programming UML Hybrid diagrams

来源：评论

学校读者我要写书评

暂无评论

A non-blocking buffer mechanism for real-time event message communication

引用

REAL-TIME SYSTEMS 2006年第3期32卷 197-211页

作者： Kim, KHK Univ Calif Irvine Irvine CA 92697 USA

It is desirable to facilitate data communications among concurrent computation threads without incurring non-essential synchronizations in real-time computing systems. An interaction mechanism, called the non-blocking writer (NBW) mechanism and invented by Kopetz, is useful in facilitating state message communication from a producer to a consumer thread in real-time applications. A more widely applicable practical interaction mechanism called the non-blocking buffer (NBB) is presented here. The NBB mechanism can be viewed as a significant extension of the NBW mechanism. The NBB mechanism facilitates communication of event messages from a producer to a consumer without causing any party to experience blocking. Therefore, its application scope includes all conceivable producer-consumer situations. The NBB mechanism is not a replacement of but rather a companion to the NBW mechanism since the latter facilitates the most efficient state message communication. The application of NBBs in building middleware supporting real-time objects is discussed as a demonstration of the utility of the NBB mechanism.

关键词： concurrent programming distributed computing thread synchronization blocking real time NBW buffer NBB monitor object TMO middleware TMOSM producer consumer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：