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 “"PRAM MODEL"”.

  1. Some Optimally Adaptive Parallel Graph Algorithms on EREW PRAM Model

    … science, since graphs offer useful tools to model many real-world situations. The commercial availability of parallel computers have led to the development of efficient parallel graph algorithms. Using an exclusive-read and exclusive-write (EREW) parallel random access machine (PRAM) as the …

    ucf Repository record for Some Optimally Adaptive Parallel Graph Algorithms on EREW PRAM Model (opens in a new tab)

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

    … 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 complexity. We have …

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

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

    … two parts. Part one 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” …

    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)

  4. Complexity issues in general purpose parallel computing

    … processors.</p> <p>We consider the <em>Block PRAM model</em> of Aggarwal, Chandra and Snir, a synchronous model of parallel computation in which the processors commu- nicate by accessing a shared memory. In the Block PRAM model, there is a time cost for each access by a processor to a block of …

    oxford Repository record for Complexity issues in general purpose parallel computing (opens in a new tab)

  5. Optimal Oblivious RAM and Its Extensions

    … any program in the Random-Access Machine (RAM) model into a functionally equivalent RAM program whose memory accesses are provably ``unintelligible''. That is, for any ORAM-compiled program, the sequence of accesses must be either computationally indistinguishable or identically distributed; …

    cornell Repository record for Optimal Oblivious RAM and Its Extensions (opens in a new tab)

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

    … time using nt processors on the Priority CRCW PRAM model.

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

  7. Topics in combinatorial and computational geometry

    … a deterministic parallel algorithm for the EREW PRAM model that runs in time $O({\rm log}\sp2\ n)$ and uses work $O(n\ {\rm log}\ n)$ for a problem of size n (for ball intersection this is also the first optimal deterministic and sequential algorithm, using the Dobkin-Kirkpatrick decomposition, …

    uiuc Repository record for Topics in combinatorial and computational geometry (opens in a new tab)

  8. Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts

    … using the CREW Parallel Random Access Machine (PRAM) model. Experimental results indicate that on both CPU and GPU architectures, the B-tree layout provides the best query performance. However, when considering the total time to permute the data using our algorithms and to perform a series of …

    hawaii Repository record for Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts (opens in a new tab)

  9. Performance of the Ultra-Wide Word Model

    The Ultra-wide word model of computation (UWRAM) is an extension of the Word-RAM model which has an ALU that can operate on w^2 bits at a time, where w is the size in bits of a cell in memory. The purpose of this thesis is to explore the applicability of the UWRAM model, particularly when compared …

    waterloo Repository record for Performance of the Ultra-Wide Word Model (opens in a new tab)

  10. Adapting non-numeric, parallel algorithms for diverse models of computation

    <p>The simplicity of the PRAM model avoids communication latency, memory lim-itations and other difficult issues. Efforts have been made to develop more real-istic models, especially with respect to communication, yet the restriction of finite memory space on computer architectures remains …

    utk-theses Repository record for Adapting non-numeric, parallel algorithms for diverse models of computation (opens in a new tab)

  11. On the shortest path and minimum spanning tree problems

    … time and work. Our algorithm is for the EREW PRAM model. A parallel, expected linear-work minimum spanning tree algorithm using only a polylogarithmic number of random bits. An O(mn log α ) bound on the comparison-addition complexity of all-pairs shortest paths. This is within a tiny log α …

    texas Repository record for On the shortest path and minimum spanning tree problems (opens in a new tab)

  12. ΧΕΙΡΟΤΕΡΗ ΚΑΙ ΜΕΣΗ ΣΥΜΠΕΡΙΦΟΡΑ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΓΙΑ ΠΡΟΒΛΗΜΑΤΑ ΓΡΑΦΩΝ

    IN THIS THESIS FAST, OPTIMAL AND/OR EFFICIENT PARALLEL ALGORITHMS ARE DEVELOPEDFOR MANY IMPORTANT GRAPH PROBLEMS WHICH IMPROVE SIGNIFICANTLY THE COMPLEXITIESOF THE BEST PREVIOUS KNOWN PARALLEL ALGORITHMS ON THE SAME PROBLEMS. MORE PRECISELY WE INVESTIGATE, (I) THE WORST-CASE PARALLEL COMPLEXITY …

    greece Repository record for ΧΕΙΡΟΤΕΡΗ ΚΑΙ ΜΕΣΗ ΣΥΜΠΕΡΙΦΟΡΑ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΓΙΑ ΠΡΟΒΛΗΜΑΤΑ ΓΡΑΦΩΝ (opens in a new tab)

  13. Efficient parallel algorithms and data structures for discrete-event simulation

    Discrete-event simulation, which is a major tool for analysis, prediction, and training, has been demanding increasingly high computational resources. It has continued to defy an efficient parallel solution. A long-st anding serial bottleneck in parallelizing event-driven simulation ,va.s the …

    ucf Repository record for Efficient parallel algorithms and data structures for discrete-event simulation (opens in a new tab)