A. Abdulrazzaq, N. Rashid, Ayad Hussain Abdulkader Alezzi
{"title":"Parallel processing of hybrid exact string matching algorithm","authors":"A. Abdulrazzaq, N. Rashid, Ayad Hussain Abdulkader Alezzi","doi":"10.1109/ICCSCE.2013.6719959","DOIUrl":null,"url":null,"abstract":"The advancement of computer hardware has opened up new challenges to algorithms experts. One of the challenges is designing new algorithm that exploit the parallel nature of the new architecture of current computer hardware. In this study, we redesign the hybrid exact string matching algorithm named AKRAM on parallel platform with the goal of speeding up the algorithm. The parallel of this algorithm showed optimal results, in parallel time, speed up, efficiency and percentage of performance gain when compared to the sequential version. The result demonstrated that the performance of both parallelized and sequential of AKRAM algorithm was influenced by type of data. The DNA sequence showed the highest performance than other data types after parallelization.","PeriodicalId":319285,"journal":{"name":"2013 IEEE International Conference on Control System, Computing and Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Control System, Computing and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSCE.2013.6719959","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
The advancement of computer hardware has opened up new challenges to algorithms experts. One of the challenges is designing new algorithm that exploit the parallel nature of the new architecture of current computer hardware. In this study, we redesign the hybrid exact string matching algorithm named AKRAM on parallel platform with the goal of speeding up the algorithm. The parallel of this algorithm showed optimal results, in parallel time, speed up, efficiency and percentage of performance gain when compared to the sequential version. The result demonstrated that the performance of both parallelized and sequential of AKRAM algorithm was influenced by type of data. The DNA sequence showed the highest performance than other data types after parallelization.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
