Regular semantics

Regular semantics

Regular semantics is a term which describes the guarantees provided by a data register shared by several processors in a parallel machine or in a network of computers working together.

Overview

Definition

Regular semantics are defined formally in Lamport's "On Interprocess Communication" Distributed Computing 1, 2 (1986), 77-101. (Also appeared as SRC Research Report 8).

Differences

Regular semantics are defined for a variable with a single writer but multiple readers. These semantics are stronger than safe semantics but weaker than atomic semantics: they guarantee that there is a total order to the write operations which is consistent with real-time and that read operations return either the value of the last completed write or that of one of the writes which are concurrent with the read.

ee also

* Atomic semantics
* Safe semantics


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Safe semantics — In computing and computer networking, safe semantics describes the guarantees provided by a data register shared by several processors in a parallel machine or in a network of computers working together.Safe semantics are defined formally in… …   Wikipedia

  • Atomic semantics — is a term which describes the guarantees provided by a data register shared by several processors in a parallel machine or in a network of computers working together.Atomic semantics are defined for a variable with a single writer but multiple… …   Wikipedia

  • Formal semantics of programming languages — In theoretical computer science, formal semantics is the field concerned with the rigorous mathematical study of the meaning of programming languages and models of computation. The formal semantics of a language is given by a mathematical model… …   Wikipedia

  • Omega-regular language — The ω regular languages are a class of ω languages which generalize the definition of regular languages to infinite words. Büchi showed in 1962 that ω regular languages are precisely the ones definable in a particular monadic second order logic… …   Wikipedia

  • Python syntax and semantics — The syntax of the Python programming language is the set of rules that defines how a Python program will be written and interpreted (by both the runtime system and by human readers). Python was designed to be a highly readable language. It aims… …   Wikipedia

  • linguistics — /ling gwis tiks/, n. (used with a sing. v.) the science of language, including phonetics, phonology, morphology, syntax, semantics, pragmatics, and historical linguistics. [1850 55; see LINGUISTIC, ICS] * * * Study of the nature and structure of… …   Universalium

  • Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing …   Wikipedia

  • HEBREW GRAMMAR — The following entry is divided into two sections: an Introduction for the non specialist and (II) a detailed survey. [i] HEBREW GRAMMAR: AN INTRODUCTION There are four main phases in the history of the Hebrew language: the biblical or classical,… …   Encyclopedia of Judaism

  • Formal grammar — In formal semantics, computer science and linguistics, a formal grammar (also called formation rules) is a precise description of a formal language ndash; that is, of a set of strings over some alphabet. In other words, a grammar describes which… …   Wikipedia

  • C++0x — is the planned new standard for the C++ programming language. It is intended to replace the existing C++ standard, ISO/IEC 14882, which was published in 1998 and updated in 2003. These predecessors are informally known as C++98 and C++03. The new …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”