A Linked-List Data Structure for Advance Reservation Admission Control

2005 ◽  
pp. 901-910 ◽  
Author(s):  
Qing Xiong ◽  
Chanle Wu ◽  
Jianbing Xing ◽  
Libing Wu ◽  
Huyin Zhang
Keyword(s):  
Data Structure ◽  
Admission Control ◽  
Advance Reservation ◽  
Linked List

Verification of Attributes in Linked Lists Using Ant Colony Metaphor

2010 ◽  
pp. 220-228
Author(s):  
Soumya Banerjee ◽  
P. K. Mahanti
Keyword(s):  
Data Structure ◽  
Ant Colony Algorithm ◽  
Predicate Logic ◽  
Device Driver ◽  
Ant Colony ◽  
Linked List ◽  
Exploration Strategy ◽  
Local Propagation ◽  
Learning Parameter ◽  
Linked Lists

The chapter describes the validation of the attributes of linked list using modified pheromone biased model (of Ant colony) under complex application environment mainly for kernel configuration and device driver operations. The proposed approach incorporates the idea of pheromone exploration strategy with small learning parameter associated while traversing a linked list. This process of local propagation on loop and learning on traversal is not available with the conventional validation mechanism of data structure using predicate logic. It has also been observed from simulation that the proposed ant colony algorithm with different pheromone value produces better convergence on linked list.

Pyramid Search: Skip Ring Data Structure-Based New Searching Algorithm

2018 ◽  
Vol 27 (14) ◽  
pp. 1850218
Author(s):  
Mustafa Aksu ◽  
Ali Karcı
Keyword(s):  
Data Structure ◽  
Time Complexity ◽  
Linear Search ◽  
Data Set ◽  
Linked List ◽  
Insertion And Deletion ◽  
Skip List ◽  
Algorithm And Data Structure ◽  
Text Element ◽  
Linked Lists

Our new algorithm and data structure, pyramid search (PS) and skip ring, were created with the help of circular linked list and skip list algorithms and data structures. In circular linked list, operations were performed on a single circular list. Our new data structure consists of circular linked lists formed in layers which were linked in a pyramid way. Time complexity of searching, insertion and deletion algorithms equal to [Formula: see text] (lg[Formula: see text]) in an [Formula: see text]-element skip ring data structure. Therefore, skip ring data structure is employed more effectively ([Formula: see text](lg[Formula: see text])) in circumstances where circular linked lists ([Formula: see text]) are used. The priority is determined based on the searching frequency in PS which was developed in this study. Thus, the time complexity of searching is almost [Formula: see text](1) for [Formula: see text] records data set. In this paper, the applications of searching algorithms like linear search (LS), binary search (BS) and PS were realized and the obtained results were compared. The obtained results demonstrated that the PS algorithm is superior to the BS algorithm.

scholarly journals On the Use of Model Checking for the Bounded and Unbounded Verification  of Nonblocking Concurrent Data Structures

2021 ◽  
Author(s):  
◽  
David Friggens
Keyword(s):  
Data Structure ◽  
Model Checking ◽  
Data Structures ◽  
Concurrent Data Structures ◽  
Verification Method ◽  
Linked List ◽  
Safety Property ◽  
Finite State ◽  
Degree Of Confidence ◽  
High Degree

<p>Concurrent data structure algorithms have traditionally been designed using locks to regulate the behaviour of interacting threads, thus restricting access to parts of the shared memory to only one thread at a time. Since locks can lead to issues of performance and scalability, there has been interest in designing so-called nonblocking algorithms that do not use locks. However, designing and reasoning about concurrent systems is difficult, and is even more so for nonblocking systems, as evidenced by the number of incorrect algorithms in the literature.  This thesis explores how the technique of model checking can aid the testing and verification of nonblocking data structure algorithms. Model checking is an automated verification method for finite state systems, and is able to produce counterexamples when verification fails. For verification, concurrent data structures are considered to be infinite state systems, as there is no bound on the number of interacting threads, the number of elements in the data structure, nor the number of possible distinct data values. Thus, in order to analyse concurrent data structures with model checking, we must either place finite bounds upon them, or employ an abstraction technique that will construct a finite system with the same properties. First, we discuss how nonblocking data structures can be best represented for model checking, and how to specify the properties we are interested in verifying. These properties are the safety property linearisability, and the progress properties wait-freedom, lock-freedom and obstructionfreedom. Second, we investigate using model checking for exhaustive testing, by verifying bounded (and hence finite state) instances of nonblocking data structures, parameterised by the number of threads, the number of distinct data values, and the size of storage memory (e.g. array length, or maximum number of linked list nodes). It is widely held, based on anecdotal evidence, that most bugs occur in small instances. We investigate the smallest bounds needed to falsify a number of incorrect algorithms, which supports this hypothesis. We also investigate verifying a number of correct algorithms for a range of bounds. If an algorithm can be verified for bounds significantly higher than the minimum bounds needed for falsification, then we argue it provides a high degree of confidence in the general correctness of the algorithm. However, with the available hardware we were not able to verify any of the algorithms to high enough bounds to claim such confidence.  Third, we investigate using model checking to verify nonblocking data structures by employing the technique of canonical abstraction to construct finite state representations of the unbounded algorithms. Canonical abstraction represents abstract states as 3-valued logical structures, and allows the initial coarse abstraction to be refined as necessary by adding derived predicates. We introduce several novel derived predicates and show how these allow linearisability to be verified for linked list based nonblocking stack and queue algorithms. This is achieved within the standard canonical abstraction framework, in contrast to recent approaches that have added extra abstraction techniques on top to achieve the same goal.  The finite state systems we construct using canonical abstraction are still relatively large, being exponential in the number of distinct abstract thread objects. We present an alternative application of canonical abstraction, which more coarsely collapses all threads in a state to be represented by a single abstract thread object. In addition, we define further novel derived predicates, and show that these allow linearisability to be verified for the same stack and queue algorithms far more efficiently.</p>

scholarly journals A New Top-Down Context-Free Parsing for Syntactic Pattern Recognition

2022 ◽  
Vol 16 ◽  
pp. 23-27
Author(s):  
Mehrnoosh Bazrafkan
Keyword(s):  
Pattern Recognition ◽  
Data Structure ◽  
Time Complexity ◽  
Theoretic Approach ◽  
Top Down ◽  
Syntactic Pattern Recognition ◽  
Context Free Grammar ◽  
Linked List ◽  
Syntactic Pattern ◽  
Context Free

The numerous different mathematical methods used to solve pattern recognition snags may be assembled into two universal approaches: the decision-theoretic approach and the syntactic(structural) approach. In this paper, at first syntactic pattern recognition method and formal grammars are described and then has been investigated one of the techniques in syntactic pattern recognition called top – down tabular parser known as Earley’s algorithm Earley's tabular parser is one of the methods of context -free grammar parsing for syntactic pattern recognition. Earley's algorithm uses array data structure for implementing, which is the main problem and for this reason takes a lots of time, searching in array and grammar parsing, and wasting lots of memory. In order to solve these problems and most important, the cubic time complexity, in this article, a new algorithm has been introduced, which reduces wasting the memory to zero, with using linked list data structure. Also, with the changes in the implementation and performance of the algorithm, cubic time complexity has transformed into O (n*R) order. Key words: syntactic pattern recognition, tabular parser, context –free grammar, time complexity, linked list data structure.

Sign in / Sign up

Export Citation Format

Share Document