Shared more. Cited more. Safe forever.
    • advanced search
    • submit works
    • about
    • help
    • contact us
    • login
    View Item 
    •   MOspace Home
    • University of Missouri-Kansas City
    • School of Graduate Studies (UMKC)
    • Theses and Dissertations (UMKC)
    • Theses (UMKC)
    • 2020 Theses (UMKC)
    • 2020 UMKC Theses - Freely Available Online
    • View Item
    •   MOspace Home
    • University of Missouri-Kansas City
    • School of Graduate Studies (UMKC)
    • Theses and Dissertations (UMKC)
    • Theses (UMKC)
    • 2020 Theses (UMKC)
    • 2020 UMKC Theses - Freely Available Online
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.
    advanced searchsubmit worksabouthelpcontact us

    Browse

    All of MOspaceCommunities & CollectionsDate IssuedAuthor/ContributorTitleSubjectIdentifierThesis DepartmentThesis AdvisorThesis SemesterThis CollectionDate IssuedAuthor/ContributorTitleSubjectIdentifierThesis DepartmentThesis AdvisorThesis Semester

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular AuthorsStatistics by Referrer

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

    Goyal, Nikita
    View/Open
    [PDF] An Arbitrary CRCW PRAM Algorithm for Sorting Integers Into a LinkedList and Chaining on a Trie (502.3Kb)
    Date
    2020
    Metadata
    [+] Show full item record
    Abstract
    The research work comprises of 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” using nlogm processors and if we use nt processors, then it can be sorted in O(loglogm/logt) time by converting Arbitrary CRCW PRAM model to Priority CRCW PRAM model. Part two is Chaining on a Trie. This research paper solves the problem of chaining on a Trie by providing more efficient complexity. This Algorithm takes “constant time” using n(logm+1) processors to chain the nodes on a Trie for n input integers on the Arbitrary CRCW PRAM model.
    Table of Contents
    Introduction -- Sort integers into a linked list -- Chaining on a Trie --Conclusion
    URI
    https://hdl.handle.net/10355/73685
    Degree
    M.S. (Master of Science)
    Thesis Department
    Computer Science (UMKC)
    Collections
    • 2020 UMKC Theses - Freely Available Online
    • Computer Science and Electrical Engineering Electronic Theses and Dissertations (UMKC)

    Send Feedback
    hosted by University of Missouri Library Systems
     

     


    Send Feedback
    hosted by University of Missouri Library Systems