scholarly journals A simple proof system for lock-free concurrency

10.29007/n3nk ◽  
2018 ◽  
Author(s):  
Luís Caires ◽  
Carla Ferreira ◽  
António Ravara
Keyword(s):  
Data Structure ◽  
Distributed Systems ◽  
Simple Proof ◽  
Proof System ◽  
Global State ◽  
Shared Resources ◽  
Conditional Model ◽  
Low Level ◽  
Concurrent Algorithms ◽  
Concurrent Data Structure

Concurrent algorithms classically relied on locks to guarantee the absence of interference when accessing shared resources. The massive use of distributed systems and of new multi-core architectures makes this approach unfeasible, and novel techniques are needed. Lock-Free algorithms have thus gained momentum. We define a core imperative calculus, equipped with concurrency and low level lock-free synchronization primitives, based on the Load-Link/Store-Conditional model. We propose a Hoare-Separation-style system to prove correct lock-free algorithms implemented in this language. Judgements distinguish local from global state, transfering knowledge between the worlds in the rules for loading and copying variables. We present a simple yet illustrative example of a proof for a concurrent data structure.

An innovative linear unsupervised space adjustment by keeping low-level spatial data structure

2018 ◽  
Vol 59 (2) ◽  
pp. 437-464 ◽  
Author(s):  
Samad Nejatian ◽  
Vahideh Rezaie ◽  
Hamid Parvin ◽  
Mohamadamin Pirbonyeh ◽  
Karamolah Bagherifard ◽  
...  
Keyword(s):  
Data Structure ◽  
Spatial Data ◽  
Low Level ◽  
Spatial Data Structure

How to implement any concurrent data structure for modern servers

2017 ◽  
Vol 51 (1) ◽  
pp. 24-32 ◽  
Author(s):  
Irina Calciu ◽  
Siddhartha Sen ◽  
Mahesh Balakrishnan ◽  
Marcos K. Aguilera
Keyword(s):  
Data Structure ◽  
Concurrent Data Structure

FUNCTIONAL PEARL Functional chart parsing of context-free grammars

2004 ◽  
Vol 14 (6) ◽  
pp. 669-680
Author(s):  
PETER LJUNGLÖF
Keyword(s):  
Data Structure ◽  
Time Complexity ◽  
Inference Rules ◽  
Global State ◽  
Bottom Up ◽  
Space And Time ◽  
Chart Parsing ◽  
The Many ◽  
Context Free ◽  
Context Free Grammars

This paper implements a simple and elegant version of bottom-up Kilbury chart parsing (Kilbury, 1985; Wirén, 1992). This is one of the many chart parsing variants, which are all based on the data structure of charts. The chart parsing process uses inference rules to add new edges to the chart, and parsing is complete when no further edges can be added. One novel aspect of this implementation is that it doesn't have to rely on a global state for the implementation of the chart. This makes the code clean, elegant and declarative, while still having the same space and time complexity as the standard imperative implementations.

Token Based Mutual Exclusion in Peer-to-Peer Systems

2012 ◽  
pp. 214-228 ◽  
Author(s):  
Mayank Singh ◽  
Shashikala Tapaswi
Keyword(s):  
Distributed Systems ◽  
Message Passing ◽  
Mutual Exclusion ◽  
Hash Table ◽  
Peer To Peer ◽  
Distributed Hash Table ◽  
Shared Resources ◽  
Peer To Peer Systems ◽  
Mutual Exclusion Algorithm ◽  
Message Overhead

Mutual exclusion is one of the well-studied fundamental primitives in distributed systems, and a number of vital solutions have been proposed to achieve the same. However, the emerging Peer to Peer systems bring forward several challenges to protect consistent and concurrent access to shared resources, as classical peer-to-peer systems, like Napster, Gnutella, et cetera, have been mainly used for sharing files with read only permission. In this chapter, the authors propose a quorum based mutual exclusion algorithm that can be used over any Peer to Peer Distributed Hash Table (DHT). The proposed approach can be seen as extension to traditional Sigma protocol for mutual exclusion in Peer to Peer systems. The basic idea is to reduce message overhead with use of smart nodes present in each quorum set and message passing between the current owners of resource with next resource requester nodes.

scholarly journals Global State Estimates for Distributed Systems

2011 ◽  
pp. 198-212 ◽  
Author(s):  
Gabriel Kalyon ◽  
Tristan Le Gall ◽  
Hervé Marchand ◽  
Thierry Massart
Keyword(s):  
Distributed Systems ◽  
Global State

scholarly journals Low-Overhead Minimum-Method Global Snapshot Compilation Protocol for Deterministic Mobile Computing Systems

2021 ◽  
Vol 9 (8) ◽  
pp. 1069-1072
Keyword(s):  
Distributed Systems ◽  
Fault Tolerance ◽  
Mobile Computing ◽  
Distributed Applications ◽  
Battery Life ◽  
Global State ◽  
Mobile Environment ◽  
Computing Systems ◽  
The Cost

CGS-accumulation (Consistent Global State Accumulation) is one of the commonly used method to provide fault tolerance in distributed systems so that the system can operate even if one or more components have failed. However, mobile computing systems are constrained by low bandwidth, mobility, lack of stable storage, frequent disconnections and limited battery life. Hence CGS- accumulation etiquettes which have lesser reinstatement- points are favored in mobile environment. In this paper, we propose a minimum-method coordinated CGS-accumulation etiquette for deterministic distributed applications on mobile computing systems. We eliminate useless reinstatement-points as well as blocking of methods during reinstatement-points at the cost of logging anti- messages of very few messages during CGS-accumulation. We also try to minimize the loss of CGS-accumulation effort when any method miscarries to capture its reinstatement-point in an instigation. In this way, we take care of excessive disappointments during CGS-accumulation. We make logging of anti-messages of very few messages only during CGS-accumulation. We also strive to minimize loss of CGS-accumulation effort.

Sign in / Sign up

Export Citation Format

Share Document