Computer systems have many components. Designing a highly efficient algorithm requires carefully examining the intersection of the algorithm design space and modern computer architecture. The design of algorithms for simultaneous execution on multi-core CPUs and graphics processing units (GPUs) is becoming increasingly important, particularly as the world’s fastest supercomputers rely on GPUs to obtain high computational throughput. The GPU contains thousands of cores that can rapidly carry out computation and have very high on-card memory bandwidth. Working with Prof. Gowanlock, Zane Fink and Jordan Wright developed a parallel multiway merge algorithm, which is fundamental to the field of databases and other application areas. The team showed that significant performance gains can be achieved over CPU-only approaches by splitting the work between multiple CPU cores and the GPU. The team is currently studying other hybrid CPU\/GPU algorithms. More information can be found in their paper cited below.<\/p>\n
Bibliographic information:<\/strong> Computer systems have many components. Designing a highly efficient algorithm requires carefully examining the intersection of the algorithm design space and modern computer architecture. The design of algorithms for simultaneous execution on multi-core CPUs and graphics processing units (GPUs) is becoming increasingly important, particularly as the world’s fastest supercomputers rely on GPUs to obtain high […]<\/p>\n","protected":false},"author":390,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_relevanssi_hide_post":"","_relevanssi_hide_content":"","_relevanssi_pin_for_all":"","_relevanssi_pin_keywords":"","_relevanssi_unpin_keywords":"","_relevanssi_related_keywords":"","_relevanssi_related_include_ids":"","_relevanssi_related_exclude_ids":"","_relevanssi_related_no_append":"","_relevanssi_related_not_related":"","_relevanssi_related_posts":"","_relevanssi_noindex_reason":"","_oasis_is_in_workflow":0,"_oasis_original":0,"_oasis_task_priority":"","footnotes":""},"categories":[13,14],"tags":[],"class_list":["post-3855","post","type-post","status-publish","format-standard","hentry","category-scholarly","category-student-related"],"_links":{"self":[{"href":"https:\/\/in.nau.edu\/school-informatics-computing-cyber-systems\/wp-json\/wp\/v2\/posts\/3855","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/in.nau.edu\/school-informatics-computing-cyber-systems\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/in.nau.edu\/school-informatics-computing-cyber-systems\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/in.nau.edu\/school-informatics-computing-cyber-systems\/wp-json\/wp\/v2\/users\/390"}],"replies":[{"embeddable":true,"href":"https:\/\/in.nau.edu\/school-informatics-computing-cyber-systems\/wp-json\/wp\/v2\/comments?post=3855"}],"version-history":[{"count":0,"href":"https:\/\/in.nau.edu\/school-informatics-computing-cyber-systems\/wp-json\/wp\/v2\/posts\/3855\/revisions"}],"wp:attachment":[{"href":"https:\/\/in.nau.edu\/school-informatics-computing-cyber-systems\/wp-json\/wp\/v2\/media?parent=3855"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/in.nau.edu\/school-informatics-computing-cyber-systems\/wp-json\/wp\/v2\/categories?post=3855"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/in.nau.edu\/school-informatics-computing-cyber-systems\/wp-json\/wp\/v2\/tags?post=3855"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nMichael Gowanlock, Ben Karsin, Zane Fink, and Jordan Wright. 2019. Accelerating the Unacceleratable: Hybrid CPU\/GPU Algorithms for Memory-Bound Database Primitives. In Proceedings of the 15th International Workshop on Data Management on New Hardware (DaMoN’19). ACM, New York, NY, USA, Article 7, 11 pages. DOI: https:\/\/doi.org\/10.1145\/3329785.3329926<\/p>\n","protected":false},"excerpt":{"rendered":"