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

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 JOYCE IMPLEMENTATION

引用

SOFTWARE-PRACTICE & EXPERIENCE 1987年第4期17卷 267-276页

作者： HANSEN, PB Computer Science Department University of Copenhagen Universitetsparken 1 Copenhagen Denmark

Joyce is a programming language for distributed systems based on CSP and Pascal. A Joyce program defines concurrent agents which communicate through unbuffered channels. This paper describes a surprisingly simple sing... 详细信息

关键词： programming languages concurrent programming Communicating agents Language implementation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Prototyping concurrent Systems with Agents and Artifacts: Framework and Core Calculus

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2008年第4期194卷 111-132页

作者： Ricci, Alessandro Viroli, Mirko Cimadamore, Maurizio Univ Bologna Alma Mater Studiorum DEIS Via Venezia 52 I-47023 Cesena Italy

More and more aspects of concurrency and concurrent programming are becoming part of mainstream programming and software engineering, due to several factors such as the widespread availability of multi-core / parallel architectures and Internet-based systems. Besides the typical fine-grained support currently provided, however, we seek in this paper for an higher-level approach. We present simpA, a library-based extension of Java which provides programmers with agent and artifact abstractions on top of the basic OO layer, as a means to organise and structure concurrent applications. To pave the way towards identifying a true language extension for simpA, we define a core calculus of agents and artifacts, by suitabling mixing techniques coming from object-orientation and concurrency theory.

关键词： multiprogramming agents and artifacts Multiagent systems concurrent programming core calculi

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A MULTIPROCESSOR IMPLEMENTATION OF JOYCE

引用

SOFTWARE-PRACTICE & EXPERIENCE 1989年第6期19卷 579-592页

作者： HANSEN, PB School of Computer and Information Science Syracuse University Syracuse New York 13244 U.S.A.

Joyce is a programming language for parallel computers based on CSP and Pascal. A Joyce program defines concurrent agents which communicate through unbuffered channels. This paper describes a multiprocessor implementa... 详细信息

关键词： programming languages concurrent programming Communicating agents Multiprocessors Language implementation Joyce

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

PARALLEL GAME-TREE SEARCH

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1985年第4期7卷 442-452页

作者： MARSLAND, TA POPOWICH, F Department of Computer Science University of Alberta Edmonton Alta. Canada

The design issues affecting a parallel implementation of the alpha-beta search algorithm are discussed with emphasis on a tree decomposition scheme that is intended for use on well ordered trees. In particular, the principal variation splitting method has been implemented, and experimental results are presented which show how such refinements as progressive deepening, narrow window searching, and the use of memory tables affect the performance of multiprocessor based chess playing programs. When dealing with parallel processing systems, communication delays are perhaps the greatest source of lost time. Therefore, an implementation of our tree decomposition based algorithm is presented, one that operates with a modest amount of message passing within a network of processors. Since our system has low search overhead, the principal basis for comparison is the communication overhead, which in turn is shown to have two components.","doi":"10.1109/TPAMI.1985.4767683","publicationTitle":"IEEE Transactions on Pattern Analysis and Machine Intelligence","startPage":"442","endPage":"452","rightsLink":"http://***/AppDispatchServlet?publisherName=ieee&publication=0162-8828&title=Parallel+Game-Tree+Search&isbn=&publicationDate=July+1985&author=T.+A.+Marsland&ContentID=10.1109/TPAMI.1985.4767683&orderBeanReset=true&startPage=442&endPage=452&volumeNum=PAMI-7&issueNum=4","displayPublicationTitle":"IEEE Transactions on Pattern Analysis and Machine Intelligence","pdfPath":"/iel5/34/4767672/***","keywords":[{"type":"IEEE Keywords","kwd":["Parallel processing","Message passing","Tree graphs","Algorithm design and analysis","Delay systems","Delay effects","Decision trees","Parallel algorithms","Councils","Computer science"]},{"type":"Author Keywords ","kwd":["tree decomposition","Alpha-beta search","chess programs","concurrent programming","graph and tree search strategies","message passing multiprocessors"]}],"allowComments":false,"pubLink":"/xpl/***?

关键词： Parallel processing Message passing Tree graphs Algorithm design and analysis Delay systems Delay effects Decision trees Parallel algorithms Councils Computer science Author Keywords tree decomposition Alpha-beta search chess programs concurrent programming graph and tree search strategies message passing multiprocessors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：