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

CACHE COHERENCE REQUIREMENTS FOR INTERPROCESS RENDEZVOUS

INTERNATIONAL JOURNAL OF PARALLEL programming 1990年第1期19卷 31-51页

作者： CLAPP, RM MUDGE, TN WINSOR, DC UNIV MICHIGAN DEPT ELECT ENGN & COMP SCIADV COMP ARCHITECTURE LABANN ARBORMI 48109

Multiprocessors in which a shared bus is used by the processor to communicate with common memory are an emerging class of machines where there is a need to support parallel programming languages. A language construct that is found in a number of parallel programming languages to support synchronization and communication in the interprocess rendezvous. Shared-bus multiprocessor require a protocol to keep the date in their caches coherent. There are two major categories of these protocols: invalidation and write-boadcast. This paper examines the requirements for cache coherence protocols to support efficient interprocessor rendezvous. The approach taken is to examine the memory referencing patterns to the run-time data structures during rendezvous execution. The appropriate coherence protocol is shown to be a function of the processor scheduling strategy used by the run-time system at synchronzation points during the rendezvous. When processes migrate freely as a result of the scheduling strategy, invalidation protocols are found to be more efficient. When migration is restricted by the scheduler, write-broadcast protocols are more efficient.

关键词： Cache coherence concurrent programming languages process migration rendezvous run-time systems

来源：评论

学校读者我要写书评

暂无评论

LANGUAGE FEATURES FOR ACCESS-CONTROL

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1983年第1期9卷 16-25页

作者： ANCILOTTI, P BOARI, M LIJTMAER, N UNIV BOLOGNA IST AUTOMATI-40136 BOLOGNAITALY

The properties of a capability-based protection mechanism to be incorporated in a language for concurrent programming are presented. The protection mechanism is first abstractly characterized in terms of a protection model; the components of the protection mechanism, that is, the objects, subjects, and protection rules which govern the accessing to the objects by the subjects, are defined.

关键词： Static And Dynamic Resource Allocation Capabilities Compile Time Access Control concurrent programming languages Protection Mechanism

来源：评论

学校读者我要写书评

暂无评论

Observational Semantics for a concurrent Lambda Calculus with Reference Cells and Futures

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第SPEC. ISS.期173卷 313-337页

作者： Niehren, Joachim Sabel, David Schmidt-Schau, Manfred Schwinghammer, Jan INRIA Futurs Mostrare Project Lille France Goethe Univ Frankfurt Frankfurt Germany Univ Saarland Programming Syst Lab Saarbrucken Germany

We present an observational semantics for lambda(fut), a concurrent lambda-calculus with reference cells and futures. The calculus lambda(fut) models the operational semantics of the concurrent higher-order programming language Alice ML. Our result is a powerful notion of equivalence that is the coarsest nontrivial congruence distinguishing observably different processes. It justifies a maximal set of correct program transformations, and it includes all of lambda(fut)'s deterministic reduction rules, in particular, call-by-value beta-reduction.

关键词： concurrent programming languages lambda calculus semantics

来源：评论

学校读者我要写书评

暂无评论

The programming Language concurrent Pascal

引用

IEEE Transactions on Software Engineering 1975年第2期SE-1卷 199-207页

作者： Hansen, Per Brinch Department of InformatIOn SCIence California Institute of Technology Pasadena Calif. 91125 United States

The paper describes a new programming language for structured programming of computer operating systems. It extends the sequential programming language Pascal with concurrent programming tools called processes and monitors. Section I explains these concepts informally by means of pictures illustrating a hierarchical design of a simple spooling system. Section II uses the same example to introduce the language notation. The main contribution of concurrent Pascal is to extend the monitor concept with an-ex-plicit hierarchy Of access’ rights to shared data structures that can be stated in the program text and checked by a compiler. Copyright © 1975 by The Institute of Electrical and Electronics Engineers, Inc.

关键词： Abstract data types access rights classes concurrent processes concurrent programming languages hierarchical operating systems monitors scheduling structured multiprogramming

来源：评论

学校读者我要写书评

暂无评论

USING SR FOR DISCRETE EVENT SIMULATION - A STUDY IN concurrent programming

引用

SOFTWARE-PRACTICE & EXPERIENCE 1990年第12期20卷 1187-1208页

作者： OLSSON, RA Division of Computer Science University of California Davis CA 95616 U.S.A.

This paper demonstrates the use of the SR concurrent programming language for discrete event simulation. SR provides a rich collection of synchronization mechanisms, whose use can lead to programs that are simpler and more efficient than those constrained to employ only one synchronization mechanism. Several SR solutions to a simulation problem are presented and contrasted with an Ada solution to the same problem. The paper also introduces a technique that exploits asynchronous message passing to program concise solutions to several problems involving lists. In the context of the simulation problem, this technique is used to manage the event list and the list of blocked processes. The technique can also be applied to several other concurrent programming problems. The results of this paper should be of interest both to programmers using concurrent programming languages and to language designers.

关键词： concurrent programming concurrent programming languages Synchronization mechanisms Asynchronous message passing Rendezvous Discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

Compiler to interpreter: experiences with a distributed programming language

引用

SOFTWARE-PRACTICE & EXPERIENCE 2001年第9期31卷 893-909页

作者： Gebala, RM McNamee, CM Olsson, RA Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Calif State Univ Sacramento Dept Comp Sci Sacramento CA 95819 USA

One interpretive approach for handling concurrency is to provide an interpreter instance for each executing language-level process. Such an approach has mainly been applied to concurrent implementations of logic and functional languages. This paper describes the use of this approach in constructing an interpreter for an imperative, distributed programming language from an existing compiler and run-time support system (RTS), Primary design goals were to exploit the existing compiler to the extent possible as well as to have minimal impact on the RTS used to support concurrency. We have been successful in meeting these goals. Additionally, performance results show our interpreter's execution times compare favorably to the times required for compilation, linkage, and execution of small programs or programs with a significant number of calls to the RTS;on such programs, our interpreter's performance also compares favorably to that of the standard Java implementation. However, for larger programs and programs with fewer calls to the underlying RTS, the conventional compiler-based implementation outperforms the interpreter implementation. For many distributed programs in which network costs dominate, the performances of the two implementations differ little. Copyright (C) 2001 John Wiley & Sons, Ltd.

关键词： interpreters concurrent programming languages concurrent programming language implementation process communication and synchronization

来源：评论

学校读者我要写书评

暂无评论

Strong types for coordinating active objects

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2001年第4期13卷 293-326页

作者： Puntigam, F Vienna Univ Technol Inst Comp Sprachen A-1040 Vienna Austria

An object type is usually regarded as a contract between an object and each of its clients. However, in concurrent (and sometimes also in sequential) systems it is more useful to regard a type as a contract between an object and the set of all clients: when the object acts as a shared resource, the clients must be coordinated before sending messages to the object. Process types of active objects specify constraints on the ordering of messages. Static type checking ensures proper coordination of clients so that objects receive messages only in acceptable orderings. As presented in this article, the process type system is based on a simple computation model where active objects communicate via asynchronous message passing. Copyright (C) 2001 John Wiley & Sons, Ltd.

关键词： type systems concurrent programming languages active objects

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE OF MULTI-TASKING AND SYNCHRONIZATION MECHANISMS IN THE programming LANGUAGE SR

引用

SOFTWARE-PRACTICE & EXPERIENCE 1988年第9期18卷 879-895页

作者： ATKINS, MS OLSSON, RA UNIV CALIF DAVIS DIV COMP SCIDAVISCA 95616

High-level language primitives for concurrent programming exist in languages such as Ada and Modula-2. However, each of these languages provides only a single means for specifying multitasking and synchronization, essential in the implementation of concurrent systems. The SR language provides several mechanisms for specifying multi-tasking and synchronization, so it can be used to explore the performance of various communication techniques. This paper presents performance results for SR's multi-tasking and synchronization mechanisms and discusses the effects of the generated code, the run-time support and the hardware on these results. These results are compared with those for similar mechanisms in other languages, leading to some general conclusions about the performance of process communication primitives. These performance results can be used by programmers to make design choices that allow systems programs written in high-level languages to meet real-time performance specifications.

关键词： Synchronization mechanisms Multi-tasking concurrent programming languages Performance Run-time support

来源：评论

学校读者我要写书评

暂无评论

RJ: a Java package providing JR-like concurrent programming

引用

SOFTWARE-PRACTICE & EXPERIENCE 2016年第5期46卷 685-708页

作者： Olsson, Ronald A. Williamson, Todd Univ Calif Davis Dept Comp Sci One Shields Ave Davis CA 95616 USA

The JR concurrent programming language extends Java with a richer concurrency model, by adding several new types and statements. JR provides dynamic remote virtual machine creation, dynamic remote object creation, remote method invocation, dynamic process creation, rendezvous, asynchronous message passing, semaphores, concurrent invocation, and shared variables. This paper presents RJ, a package for Java that provides JR-like features. The paper gives an overview of RJ and its key features;describes the implications of RJ's design, including how RJ provides additional, useful flexibility;discusses the implementation of RJ;and gives qualitative and quantitative evaluations of our work with respect to feasibility and usability, experimentation, migration, and performance. RJ has been successful in meeting these goals and in providing insight into the trade-offs between using a concurrent programming language versus using the equivalent concurrent package. Our work has yielded a few surprises in dealing with some concurrent programming language features, in understanding the run-time performances of JR versus RJ programs, and in obtaining some additional, useful flexibility for concurrent programming applications. Copyright (c) 2015 John Wiley & Sons, Ltd.

关键词： concurrency concurrent programming languages concurrent programming packages package design package implementation JR programming language

来源：评论

学校读者我要写书评

暂无评论

THE DISTRIBUTED-programming LANGUAGE SR - MECHANISMS, DESIGN AND IMPLEMENTATION

引用

SOFTWARE-PRACTICE & EXPERIENCE 1982年第8期12卷 719-753页

作者： ANDREWS, GR Department of Computer Science The University of Arizona Tucson Arizona 85721 U.S.A.

SR is a new language for programming software containing many processes that execute in parallel. The language allows an entire software system that controls a potentially large collection of processors to be programmed as an integrated set of software modules. The key language mechanisms are resources, operations and input statements. The language supports separate compilation, type abstraction, and dynamic communication links; it also contains novel treatments of arrays and procedures. This paper gives an overview of the language mechanisms, discusses some of the major design decisions and describes one implementation.

关键词： concurrent programming languages Distributed programming Distributed systems Process synchronization Data types

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：