Trace Semantics and Algebraic Laws for Total Store Order Memory Model

Modern multiprocessors deploy a variety of weak memory models(WMMs).Total Store Order(TSO)is a widely-used weak memory model in SPARC implementations and x86 architecture.It omits the store-load constraint by allowing each core to employ a write buffer.In this paper,we apply Unifying Theories of Programming(abbreviated as UTP)in investigating the trace semantics for TSO,acting in the denotational semantics style.A trace is expressed as a sequence of snapshots,which records the changes in registers,write buffers and the shared memory.All the valid execution results containing reorderings can be described after kicking out those that do not satisfy program order and modification order.This paper also presents a set of algebraic laws for TSO.We study the concept of head normal form,and every program can be expressed in the head normal form of the guarded choice which is able to model the execution of a program with reorderings.Then the linearizability of the TSO model is supported.Furthermore,we consider the linking between trace semantics and algebraic semantics.The linking is achieved through deriving trace semantics from algebraic semantics,and the derivation strategy under the TSO model is provided.

Alternative Approaches of Convolution within Network Calculus

Network Calculus is a powerful mathematical theory for the performance evaluation of communication systems;among others it allows to determine worst-case performance measures. This is why it is often used to appoint Quality of Service guarantees in packet-switched systems like the internet. The main mathematical operation within this deterministic queuing theory is the min- plus convolution of two functions. For example the convolution of the arrival and service curve of a system which reflects the data’s departure. Considering Quality of Service measures and performance evaluation, the convolution operation plays a considerable important role, similar to classical system theory. Up to the present day, in many cases it is not practical and simple to perform this operation. In this article we describe approaches to simplify the min-plus convolution and, accordingly, facilitate the corresponding calculations.

Formal Inferring the Law of Conservation of Energy from Assuming A-Priori-ness of Knowledge in a Formal Axiomatic Epistemology System Sigma

The research purpose is invention (construction) of a formal logical inference of the Law of Conservation of Energy within a logically formalized axiomatic epistemology-and-axiology theory Sigma from a precisely defined assumption of a-priori-ness of knowledge. For realizing this aim, the following work has been done: 1) a two-valued algebraic system of formal axiology has been defined precisely and applied to proper-philosophy of physics, namely, to an almost unknown (not-recognized) formal-axiological aspect of the physical law of conservation of energy;2) the formal axiomatic epistemology-and-axiology theory Sigma has been defined precisely and applied to proper-physics for realizing the above-indicated purpose. Thus, a discrete mathematical model of relationship between philosophy of physics and universal epistemology united with formal axiology has been constructed. Results: 1) By accurate computing relevant compositions of evaluation-functions within the discrete mathematical model, it is demonstrated that a formal-axiological analog of the great conservation law of proper physics is a formal-axiological law of two-valued algebra of metaphysics. (A precise algorithmic definition of the unhabitual (not-well-known) notion “formal-axiological law of algebra of metaphysics” is given.) 2) The hitherto never published significantly new nontrivial scientific result of investigation presented in this article is a formal logical inference of the law of conservation of energy within the formal axiomatic theory Sigma from conjunction of the formal-axiological analog of the law of conservation of energy and the assumption of a-priori-ness of knowledge.