Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 54 for “"linked list"”.

  1. Searching in a Sorted Linked List and Sort Integers into a Linked List

    … is about Searching for an integer in a sorted Linked list. A tree is constructed in O(nloglogm/p+loglogm) time with p processors based on the trie with all the given integers. Additional nodes (O(nloglogm) of them) are added to the tree. After the tree is constructed, for any given integer we …

    umkc Repository record for Searching in a Sorted Linked List and Sort Integers into a Linked List (opens in a new tab)

  2. Sorting Real Numbers into a Linked List on the PRAM Model

    We study the sorting of real numbers into a linked list on the PRAM (Parallel Random Access Machine) model. The research work consists of two parts. First part talks about the various techniques involved in sorting the real numbers on the linked list in terms of number of processors and time …

    umkc Repository record for Sorting Real Numbers into a Linked List on the PRAM Model (opens in a new tab)

  3. Hardware linked-list using FPGAs and optical central stage impairments in a sectored packet switch with an optical core (demonstrator)

    … and simulation of a System-on-Chip (SoC) linked-list memory manager implemented in a Field-Programmable Gate Array (FPGA) that is a building block of a common shared-memory switch that forms an electronic sector. If the core optical central stage is very far from the input and output …

    ottawa-retro Repository record for Hardware linked-list using FPGAs and optical central stage impairments in a sectored packet switch with an optical core (demonstrator) (opens in a new tab)

  4. Constant Time Sorting and Searching

    To study the sorting of real numbers into a linked list on Parallel Random Access Machine model. To show that input array of n real numbers can be sorted into a linked list in constant time using n²/logᶜn processors for any positive constant c. The searching problem studied is locating the interval …

    umkc Repository record for Constant Time Sorting and Searching (opens in a new tab)

  5. The Stylist: a Pascal program for analyzing prose style

    The Stylist is a Waterloo Pascal program that analyzes the style of English prose. A "style checker", The Stylist pertains to Computational Stylistics and Computer Assisted Composition Instruction (CACI). The Stylist creates an affective model of the text based upon the following characteristic of …

    nps Repository record for The Stylist: a Pascal program for analyzing prose style (opens in a new tab)

  6. Non-Blocking Data Structures Handling Multiple Changes Atomically

    … our approach to two data structures, doubly-linked lists and Patricia tries. In our implementations, only update operations perform CAS instructions; operations other than updates perform only reads of shared memory. Our doubly-linked list implements a novel specification that is designed to …

    york Repository record for Non-Blocking Data Structures Handling Multiple Changes Atomically (opens in a new tab)

  7. Concurrent Non-blocking Skip List Using Multi-word Compare and Swap Operation

    … a non-blocking lock-free implementation of skip list data structure using multi word compare and swap (CASN) operation. This operation is designed to work on arbitrary number of memory locations as a single atomic step. We discuss the implementation details of CASN operation which only utilizes …

    unlv Repository record for Concurrent Non-blocking Skip List Using Multi-word Compare and Swap Operation (opens in a new tab) Download PDF for Concurrent Non-blocking Skip List Using Multi-word Compare and Swap Operation (opens in a new tab)

  8. Efficient state space exploration for parallel test generation

    … test candidates for binary tree, doubly linked list, and sorted singly linked list, from their respective predicates.

    texas Repository record for Efficient state space exploration for parallel test generation (opens in a new tab)

  9. A data structure for interactive graphic manipulation of logic diagrams

    … graphics system. The use of sequential list, hashing, binary tree, and linked list data structures are evaluated, and the data structure is formulated, which includes a combination of linked lists, binary trees, and sequential lists. An illustrative example is presented, along with …

    vt Repository record for A data structure for interactive graphic manipulation of logic diagrams (opens in a new tab)

  10. Implementing Multiple-Linked Lists in the Minicomputer-Microcomputer String Processor, C. String

    … report will demonstrate how to implement a basic linked-list data structure in RAM for C. STRING. The result of this implementation is Memory Allocation or Data Management which obtains or releases memory space as required in C. STRING. The basic concepts of data structures such as strings, lists …

    ucf Repository record for Implementing Multiple-Linked Lists in the Minicomputer-Microcomputer String Processor, C. String (opens in a new tab)

  11. An rp-adaptivity scheme for the finite element analysis of linear elliptic problems

    … optimization design variable. A series of tiered linked list data structure representations are developed for storing and manipulating the model information. The Zienkiewicz-Zhu error estimator is utilized for determining localized error. A modified superconvergent patch recovery technique is …

    rice Repository record for An rp-adaptivity scheme for the finite element analysis of linear elliptic problems (opens in a new tab)

  12. Gromit An In-Memory Graph Database

    … and encodes semantic information in property lists of the vertices and edges. Gromit uses a vertex-edge graph model and represent both vertices and edges as entities of the graph. Edges are stored in a doubly linked list manner in main memory. We implement breadth-first traversal and …

    waterloo Repository record for Gromit An In-Memory Graph Database (opens in a new tab)

  13. Comparison and analysis of some algorithms for implementing priority queues

    … implemented by using heap, k-ary tree, single linked-list, leftist tree, linked tree, AVL-tree, 2-3 tree, and fixed priority property. Required storage for each method was obtained and the worst case time analysis was done in terms of the number of key comparison and key exchanges during the …

    nps Repository record for Comparison and analysis of some algorithms for implementing priority queues (opens in a new tab)

  14. Recoverable Mutual Exclusion in Detectable Lock-Based Data Structures

    … DULL, a Detectable Unrolled Lock-based Linked List, designed for persistent memory environments. DULL distinguishes itself as the fastest detectable lock-based linked list and the first to achieve strict-linearizability. The implementation of DULL utilizes volatile RME locks to address …

    waterloo Repository record for Recoverable Mutual Exclusion in Detectable Lock-Based Data Structures (opens in a new tab)

  15. An Arbitrary CRCW PRAM Algorithm for Sorting Integers Into a LinkedList and Chaining on a Trie

    … CRCW PRAM algorithm for sorting integers into a linked list. There are various algorithms and techniques to sort the integers in LinkedList. Arbitrary CRCW PRAM model, being the weakest model is able to sort n integers in a LinkedList in “constant time” using nlogm processors and if we use nt …

    umkc Repository record for An Arbitrary CRCW PRAM Algorithm for Sorting Integers Into a LinkedList and Chaining on a Trie (opens in a new tab)

  16. Track Persistence in Wireless Sensor Networks

    … a centralized problem. The second algorithm, a linked list-like algorithm, builds a dynamic data structure as the object traverses the network, and rebuilds the object history distributively upon demand. We conduct worst case analysis upon both of these algorithms. Finally, we implement a …

    queens Repository record for Track Persistence in Wireless Sensor Networks (opens in a new tab)

  17. An algorithm for fast route lookup and update

    … simulation results. A trie based scheme, called Linked List Cascade Addressable Trie (LLCAT) is presented. The strength of LLCAT comes from the fact that it is easy to be implemented in hardware, and also routing table update operations are performed incrementally requiring very few memory …

    njit Repository record for An algorithm for fast route lookup and update (opens in a new tab)

  18. Efficient String Representation in Erlang/OTP

    A string in Erlang is implemented as a linked list of integers. This leads to a large memory overhead on modern hardware (64 bits) causing each character to take 16 bytes, especially compared to the natural representation where each character takes 1 byte. In this report we show and compare …

    chalmers Repository record for Efficient String Representation in Erlang/OTP (opens in a new tab)

Page 1 of 3