Skip to main content
select distinct n.content as name, r.content as role, t.nameID as nameID, n.unitID as unitID, n.departmentID as departmentID, n.facultyID as facultyID, n.provinceID as provinceID, n.countryID as countryID from transaction as t, Name as n, Role as r where t.itemID='102914' and and

Analysing and optimizing Snphap using Radix-2 computation and Openmp



เครือข่ายนักวิจัย+ผลงานวิจัย (full screen)


In this paper, the Run time complexity of Snphap, which is a Haplotype inference tool, is extensively examined. The analysis is based on our previous work in terms of profiling and run-time complexity function. To reduce the Run time complexity and enhance its performance, a Radix-2 computation and Openmp multithreading are applied. The optimized results are compared with both original and compiler optimized versions on an AMD A6-3650 Linux machine. Due to the Radix-2 technique, the complexity is drastically reduced. In addition, the theoretical Speedup is consistent with the experimental one. Furthermore, up to 1,303% Speedup is achievable as a result of Openmp multithreading.

Haplotype inference (4 items found) | Run time complexity (2 items found) | Radix-2 (1 items found) | Openmp (17 items found) | Snphap (2 items found) | Application programming interfaces | Computer operating systems | SnphapComplexity functions | Computer science | Multi-threading | Linux machines | Multitasking | Optimization | Radix 2 | API |

ต้นฉบับข้อมูล : scopus