Recent research has placed emphasis on the need for support for concurrency in the context of programming for the World-Wide Web (W3). Frameworks like WebL, LogicWeb, and Jinny make concurrency a key component of their W3 support. In this work we analyze the concurrent capabilities of CLP(WEB), a W3-oriented logic-based concurrent framework. CLP(WEB) offers two forms of concurrency, or-concurre...

The upcoming many-core architectures require software developers to exploit concurrency to utilize available computational power. Today’s high-level language virtual machines (VMs), which are a cornerstone of software development, do not provide sufficient abstraction for concurrency concepts. We analyze concrete and abstract concurrency models and identify the challenges they impose for VMs. T...

Real-time database system must meet time constraints in addition to the integrity constraints. Concurrency control is one of the main issues in the studies of real-time database systems. Traditional concurrency control methods use serializability as the correctness criterion when transactions are executed concurrently. However, strict serializability as the correctness criterion is not always s...

This study proposes DC-ROLL, a new approach to concurrency control in a distributed environment based on the Request Order Linked List (ROLL) [P91] and the Datacycle architecture [H+87]. DC-ROLL allows for more flexibility in levels of concurrency and avoids certain performance bottlenecks of the traditional two-phase locking. Unlike the original Datacycle architecture where the entire database...

We introduce posets with interfaces (iposets) and generalise their standard serial composition to a new gluing composition. In the partial order semantics of concurrency, allow modelling events that extend in time across components. Alternatively, taking decompositional view, cutting through events, while may only cut edges poset. show iposets under form category, which generalises monoid up is...

We present a monadic denotational semantics for higher-order programming language with shared-state concurrency, i.e. global-state in the presence of interleaving concurrency. Central to our approach is use Plotkin and Power’s algebraic effect methodology: designing an equational theory that captures intended semantics, proving representation theorem it. Hyland et al.’s resumptions extends non-...

Various concurrency control algorithms have been proposed for use in distributed database systems. But, the number of algorithms available for the distributed concurrency control, come into one of three basic classes: locking algorithms, Timestamp algorithms and optimistic (or certification) algorithms. In this paper we are presenting a Distributed Transaction Processing Model and an approach f...

When developing concurrent software, a proper engineering practice is to choose a good level of abstraction for expressing concurrency control. Ideally, this level should provide platform-independent abstractions but, as the platform concurrency behaviour cannot be ignored, this abstraction level must also be able to cope with it and exhibit the influence of different possible behaviours. We st...