Performance analysis of periodic and concurrent data structure maintenance strategies for network servers

1989 ◽  
Vol 15 (12) ◽  
pp. 1526-1536 ◽  
Author(s):  
W.H. Bahaa-El-Din ◽  
F.B. Bastani ◽  
J.-E. Teng
Keyword(s):  
Data Structure ◽  
Performance Analysis ◽  
Maintenance Strategies ◽  
Network Servers ◽  
Concurrent 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

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.

scholarly journals Performance Anatomization of Computer Algorithms Based on Iterative and Recursive Methodologies

2020 ◽  
Vol 8 (5) ◽  
pp. 1272-1276
Keyword(s):  
Data Structure ◽  
Performance Analysis ◽  
Computational Efficiency ◽  
Time Complexity ◽  
Research Paper ◽  
Space Complexity ◽  
Computer Algorithms ◽  
Solution Quality ◽  
Long Time

An algorithm is a clear specification of a sequence of instructions which when followed, provides a solution to a given problem. Writing an algorithm, depends upon various parameters, which leads to strong algorithmic performance, in terms of its computational efficiency and solution quality. This research paper presents the different methodologies of writing algorithms of data structure and also provides their performance analysis with respect to time complexity and space complexity. As we know that, for the same problem, we will have different algorithms, written using different approaches. All approaches of algorithms are important and have been an area of focus for a long time but still the question remains the same “which to use when?”, which is the main reason to perform this research. This research provides a detailed study of how algorithms being written using different approaches work and then compares them on the basis of various parameters such as time complexity and space complexity, to reach the conclusion.

Sign in / Sign up

Export Citation Format

Share Document