dc.contributor.advisor | Han, Yijie, 1959- | |
dc.contributor.author | Goyal, Nikita | |
dc.date.issued | 2020 | |
dc.date.submitted | 2020 Spring | |
dc.description | Title from PDF of title page viewed June 1, 2020 | |
dc.description | Thesis advisor: Yijie Han | |
dc.description | Vita | |
dc.description | Includes bibliographical references (pages 22-23) | |
dc.description | Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2020 | |
dc.description.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. | |
dc.description.tableofcontents | Introduction -- Sort integers into a linked list -- Chaining on a Trie --Conclusion | |
dc.format.extent | vii, 24 pages | |
dc.identifier.uri | https://hdl.handle.net/10355/73685 | |
dc.subject.lcsh | Sorting (Electronic computers) | |
dc.subject.lcsh | Phase change memory | |
dc.subject.lcsh | Algorithms | |
dc.subject.other | Thesis -- University of Missouri--Kansas City -- Computer science | |
dc.title | An Arbitrary CRCW PRAM Algorithm for Sorting Integers Into a LinkedList and Chaining on a Trie | |
thesis.degree.discipline | Computer Science (UMKC) | |
thesis.degree.grantor | University of Missouri--Kansas City | |
thesis.degree.level | Masters | |
thesis.degree.name | M.S. (Master of Science) | |