{"id":{"repo_id":"umkc","oai_identifier":"oai:mospace.umsystem.edu:10355/90143"},"canonical_url":"https://search.dev.ndltd.org/etd/umkc/oai:mospace.umsystem.edu:10355/90143","repository":{"repo_id":"umkc","name":"University of Missouri - Kansas City","base_url":"https://mospace.umsystem.edu/oai/request"},"display":{"title":"Sorting Real Numbers into a Linked List on the PRAM Model","abstract":"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 complexity. We have examined on how to sort the real numbers in the linked list using n^3, n^2 processors which has the time complexity of constant time and O(loglogn) time respectively. We have done good research in that area to come up with an algorithm to sort n real numbers into the linked list using n^2 processors in constant time. In second part, we talk about the time processor trade off for sorting the real numbers in the linked list.","abstract_html":"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 complexity. We have examined on how to sort the real numbers in the linked list using n^3, n^2 processors which has the time complexity of constant time and O(loglogn) time respectively. We have done good research in that area to come up with an algorithm to sort n real numbers into the linked list using n^2 processors in constant time. In second part, we talk about the time processor trade off for sorting the real numbers in the linked list.","abstract_has_math":false,"creators":["Kasani, Pruthvi"],"institution":"University of Missouri--Kansas City","degree_name":"M.S. (Master of Science)","degree_level":"Thesis","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Han, Yijie, 1959-"],"committee_chairs":[],"committee_members":[],"year":2021,"date_issued":"2021","date_published":"2021","updated_at":"2026-07-24T05:18:34Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10355/90143","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Han, Yijie, 1959-"]},{"key":"dc:creator","label":"Author","values":["Kasani, Pruthvi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2022-05-10T16:10:08Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2022-05-10T16:10:08Z"]},{"key":"dc:date.issued","label":"Date","values":["2021"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S. (Master of Science)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Missouri--Kansas City","Computer Science (UMKC)"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10355/90143"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Title from PDF of title page, viewed June 2, 2022","Thesis advisor: Yijie Han","Vita","Includes bibliographical references (pages 10-11)","Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2022"]},{"key":"dc:description.abstract","label":"Abstract","values":["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 complexity. We have examined on how to sort the real numbers in the linked list using n^3, n^2 processors which has the time complexity of constant time and O(loglogn) time respectively. We have done good research in that area to come up with an algorithm to sort n real numbers into the linked list using n^2 processors in constant time. In second part, we talk about the time processor trade off for sorting the real numbers in the linked list."]},{"key":"dc:title","label":"Title","values":["Sorting Real Numbers into a Linked List on the PRAM Model"]}]}],"canonical_facts":{"dc:contributor.advisor":["Han, Yijie, 1959-"],"dc:creator":["Kasani, Pruthvi"],"dc:date.accessioned":["2022-05-10T16:10:08Z"],"dc:date.available":["2022-05-10T16:10:08Z"],"dc:date.issued":["2021"],"dc:description":["Title from PDF of title page, viewed June 2, 2022","Thesis advisor: Yijie Han","Vita","Includes bibliographical references (pages 10-11)","Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2022"],"dc:description.abstract":["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 complexity. We have examined on how to sort the real numbers in the linked list using n^3, n^2 processors which has the time complexity of constant time and O(loglogn) time respectively. We have done good research in that area to come up with an algorithm to sort n real numbers into the linked list using n^2 processors in constant time. In second part, we talk about the time processor trade off for sorting the real numbers in the linked list."],"dc:identifier.uri":["https://hdl.handle.net/10355/90143"],"dc:title":["Sorting Real Numbers into a Linked List on the PRAM Model"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S. (Master of Science)"],"thesis:institution_name":["University of Missouri--Kansas City","Computer Science (UMKC)"]},"updated_at":"2026-07-24T05:18:34Z"}