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 13 of 13 for “"Sorting (Electronic computers)"”.

  1. PSUsort: A Parallel External Sort for a Shared Memory Multiprocessor System

    … The main goal of the thesis is to develop a sorting package that is scale able and efficient. No prior knowledge of the nature, source or size of the data is assumed for this work. A dynamic load-balancing architecture is used with no static allocation of tasks to processes. The package …

    portland-state Repository record for PSUsort: A Parallel External Sort for a Shared Memory Multiprocessor System (opens in a new tab)

  2. Implementation of parallel sorting algorithms on a transputer network

    <p>Many sorting algorithms, such as the bubble sort and the binary tree selection sort, are n-squared algorithms and take O (n2) time to sort n values. These can be easily parallelized; the resulting sorts are called the odd-even transposition sort and the parallel tree selection sort, …

    njit Repository record for Implementation of parallel sorting algorithms on a transputer network (opens in a new tab)

  3. Smart Memory: An Inexact Content-Addressable Memory

    … match feature, this CAM also provides efficient sorting and set operations. The accumulated searching time is shortened when compared to regular CAM and RAM. The inexact CAM in this thesis is designed using mixed analog/digital design in a 2~ CMOS technology.

    portland-state Repository record for Smart Memory: An Inexact Content-Addressable Memory (opens in a new tab)

  4. Methodology for Accurate Speedup Prediction

    … our methodology. Several variations of the sorting algorithm (such as problem size greater than or equal to the system size, unlimited or limited buffer size) suitable for a wide range of problem sizes are implemented in two parallel environments and the speedups for them are measured and …

    portland-state Repository record for Methodology for Accurate Speedup Prediction (opens in a new tab)

  5. 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)

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

    … time with n processors. Part two is on sorting integers into a linked list. There are various best algorithms for sorting integers. The current research work applies the recent important results of sorting integers in Ω(logn/loglogn) time. This algorithm takes “constant time” to sort …

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

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

    … is using an Arbitrary 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 …

    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)

  8. Implementation of algorithms for sorting by strip swaps using alternating cycle graphs

    … refinement of their cycle graph algorithm for sorting by strip swaps. The main contribution of this thesis is the development of a solution that successfully handles the various scenarios of sorting by strip swaps on which the cycle graph algorithm of Roy et al. did not succeed. In order to …

    unf Repository record for Implementation of algorithms for sorting by strip swaps using alternating cycle graphs (opens in a new tab) Download PDF for Implementation of algorithms for sorting by strip swaps using alternating cycle graphs (opens in a new tab)

  9. A VSI Pipeline Sorting Algorithm Design and Implementation

    Hardware based sorting techniques date back to the late 1800s when Herman Hollerith, an employee of the census Bureau developed the first tabulating and sorting machine. [Knuth] The machine was developed to meet the needs census statistics gathering. At that time up to 49 cards a minute could be …

    ucf Repository record for A VSI Pipeline Sorting Algorithm Design and Implementation (opens in a new tab)

  10. Sorting by Strip Moves and Strip Swaps

    … problems related to the familiar problem of sorting, namely transforming arbitrary permutations to the identity permutation. The term permutation is used for an arbitrary arrangement of the integers 1, 2,···, n, and the term identity permutation for the arrangement of 1, 2,···, n in …

    unf Repository record for Sorting by Strip Moves and Strip Swaps (opens in a new tab) Download PDF for Sorting by Strip Moves and Strip Swaps (opens in a new tab)

  11. Implementation and Performance Comparison of Some Heuristic Algorithms for Block Sorting

    … optimization problem known as Block Sorting. The motivation for the study of this problem comes from applications such as computational biology and optical character recognition. While existing Block Sorting research has been theoretically focused on the development and analysis of …

    unf Repository record for Implementation and Performance Comparison of Some Heuristic Algorithms for Block Sorting (opens in a new tab) Download PDF for Implementation and Performance Comparison of Some Heuristic Algorithms for Block Sorting (opens in a new tab)