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

A definition of and linguistic support for partial quiescence

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2008年第8期20卷 969-995页

作者： Man, Billy Yan-Kit Chan, Hiu Ning (Angela) Gallagher, Andrew J. Goundan, Appu S. Keen, Aaron W. Olsson, Ronald A. Univ Calif Davis Dept Comp Sci Davis CA 95616 USA Calif Polytech State Univ San Luis Obispo Dept Comp Sci San Luis Obispo CA 93407 USA

The global quiescence (GQ) of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provide GQ detection as a built-in feature so that programmers do not need to write special synchronization code to detect quiescence. This paper introduces partial quiescence (PQ), which generalizes quiescence detection to a specified part of a distributed computation. PQ is useful, for example, when two independent concurrent computations that both rely on GQ need to be combined into a single program. The paper describes how we have designed and implemented a PQ mechanism within an experimental version of the JR concurrent programming language, and have gained experience with several representative applications. Our early results are promising qualitatively and quantitatively. Copyright (C) 2007 John Wiley & Sons, Ltd.

关键词： concurrent programming language termination detection partial quiescence

来源：评论

学校读者我要写书评

暂无评论

ADAPTING MODULA-2 FOR DISTRIBUTED SYSTEMS

引用

SOFTWARE ENGINEERING JOURNAL 1986年第5期1卷 184-189页

作者： MELLOR, PV DUBERY, JM WHITEHEAD, DG UNIV HULL DEPT ELECTR ENGNHULL HU6 7RXN HUMBERSIDEENGLAND UNIV HULL DEPT COMP SCIHULL HU6 7RXN HUMBERSIDEENGLAND

Modula-2 is a recently developed concurrent programming language designed primarily for implementation on a mono-processor. This paper reports on the changes found necessary, both to the source language and to the support environment, in order to allow the language to be used to program a tightly coupled, homogenous, distributed computing system. Specific areas covered are: the allocation of program code and data to processors, which is kept independent of the source code, allowing flexible re-allocation without re-compilation; the choice of an inter-processor communication mechanism, where the remote procedure call was considered to be the most flexible technique; and the selection of an inter-process communication mechanism, where, despite the distributed nature of the target, the monitor was found most suitable.

关键词： multiprocessing systems interprocess communication software engineering Compilers, interpreters and other processors concurrent programming language interprocessor communication support environment program compilers source language distributed processing remote procedure call distributed systems High level languages Systems analysis and programming Modula compilers Modula-2

来源：评论

学校读者我要写书评

暂无评论

CODESIGN OF COMMUNICATION PROTOCOLS

引用

COMPUTER 1993年第12期26卷 46-52页

作者： WENBAN, AS OLEARY, JW BROWN, GM Sch. of Electr. Eng. Cornell Univ. Ithaca NY

The authors describe a hardware/software codesign system used for translating communication protocol specifications written in Promela, a high-level concurrent programming language, into implementations of custom hardware and software. The authors developed a single front end and two back ends for compiling Promela. The software back end translates a Promela program into C++. This code, along with additional code needed to support external hardware interfaces, can then be compiled into an executable version of the Promela specification. The hardware back end maps each Promela declaration, statement, and expression to a primitive element composed of combinational logic gates and flip-flops. It produces output in the form of a VHDL entity/architecture pair for simulation or an EDIF netlist view for transfer to commercial hardware CAD tools. A simple communication system serves as a design example for the authors' compilation tools. The system consists of a hardware process that creates a reliable channel by implementing the alternating-bit protocol over a pair of unreliable channels and a software process that sends a stream of data over that channel.

关键词： Promela alternating bit protocol codesign process communication protocols concurrent programming language hardware compiler logic design parallel languages program compilers protocols software compiler

来源：评论

学校读者我要写书评

暂无评论

A'UM - A STREAM-BASED concurrent OBJECT-ORIENTED language

引用

NEW GENERATION COMPUTING 1990年第2-3期7卷 127-157页

作者： YOSHIDA, K CHIKAYAMA, T 1. ICOT Research Center Institute for New Generation Computer Technology 1-4-28 Mita Minato-ku 108 Tokyo Japan

This paper presents a computation model and its programming language,A’UM,* as a result of our pursuit of high parallelism and high expressivity for the development of a large scale software. By basing it on streams and integrating it with objects and relations,A’UM realizes an elegant model, natural representation and efficient execution, all at once, that have never been done by any other approaches.

关键词： concurrent programming language Stream Object-oriented

来源：评论

学校读者我要写书评

暂无评论

Towards Performance Evaluation programming 20

Towards Performance Evaluation Programming

引用

20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： Todoran, Eneia Nicolae Tech Univ Cluj Napoca Dept Comp Sci Cluj Napoca Romania

ISBN: (纸本)9781728106250

In recent work we have introduced an experimental concurrent programming language which supports a systematic approach to performance analysis and formal verification correlated with a programming style called performance evaluation programming [19]. For the purpose of formal verification, the ranges of variables must be bounded and concurrent programs are translated into corresponding (finite state) Continuous Time Markov Chains (CTMCs) which are analyzed by using the PRISM tool. Activities in a CTMC model are abstracted by their rates. In the language introduced in [19] an activity is the evaluation of a function expressed in a functional sub-language. The solution presented in [19] supports formal verification in a systematic manner, but not automatically, requiring the programmer to generate certain data for the performance evaluation experiments. In this paper we refine the design of the functional sub-language introduced in [19] by using concepts of functional programming with dependent types. We use dependent types to control the ranges of variables. The solution presented in this paper is devised to support automatic performance evaluation and formal verification of (bounded versions of) concurrent programs.

关键词： concurrent programming language performance evaluation dependent types continuous time Markov chains

来源：评论

学校读者我要写书评

暂无评论

An Approach to Performance Evaluation programming 19

An Approach to Performance Evaluation Programming

引用

19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： Todoran, Eneia Nicolae Tech Univ Cluj Napoca Dept Comp Sci Cluj Napoca Romania

ISBN: (纸本)9781538626269

We present an experimental concurrent programming language L-PEP which supports performance evaluation programming. An L-PEP program is a collection of modules which are executed concurrently. The structure of an L-PEP program is similar to the structure of a Continuous Time Markov Chain (CTMC) model expressed in the PRISM language (of the PRISM probabilistic model checker). However, L-PEP is a programming language, not a model checker. Activities are abstracted in a PRISM CTMC model by their rates. In the language L-PEP an activity is the evaluation of a function (expressed in a functional sub-language of L-PEP) in a certain state of a module. Each L-PEP module contains a number of variables (which describe the possible states of the module) and a list of commands that can specify activities. L-PEP supports variables of both primitive types (booleans and integers) and non-primitive types, e.g., lists. For the purpose of performance evaluation the programmer must bound the ranges of variables. Any value of a non-primitive type is handled according to its complexity (rather than its value). For example, the complexity of a list could be the length of the list, which must also be bounded. It is also the responsibility of the programmer to design each L-PEP function by induction on an appropriate complexity measure which always decreases upon a recursive call. Performance evaluation is supported in L-PEP by constructing a CTMC model from an L-PEP program, and by analyzing the CTMC model using the PRISM tool.

关键词： concurrent programming language performance evaluation continuous time Markov chain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：