{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T23:03:20Z","timestamp":1777676600488,"version":"3.51.4"},"reference-count":39,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2016,7,28]],"date-time":"2016-07-28T00:00:00Z","timestamp":1469664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2016,8]]},"abstract":"<jats:p>In this article, we describe a new approach to parallelize longest prefix match (LPM) algorithm through bit parallelism, also known as bit-vector approach. This approach makes use of bit-wise computations and leverages bit parallelism. The proposed parallel algorithm will be demonstrated in dictionary-based lossless data compression on general-purpose graphics processing units (GPGPUs). One of the main contributions of this work is redesigning the core part of the data compression algorithm and replacing it with the newly proposed bit-vector LPM solution. Using bit parallelism is a fundamentally new approach for data compression and promising in performance for hybrid CPU-GPU environments. The implementation of the new compression algorithm on GPUs improves the performance of the compression process compared to the previous attempts. Moreover, the bit-vector approach opens new opportunities for improvement and increases the applicability to popular heterogeneous environments.<\/jats:p>","DOI":"10.1177\/1094342015621367","type":"journal-article","created":{"date-parts":[[2015,12,17]],"date-time":"2015-12-17T22:04:40Z","timestamp":1450389880000},"page":"276-289","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["An efficient parallelization of longest prefix match and application on data compression"],"prefix":"10.1177","volume":"30","author":[{"given":"Adnan","family":"Ozsoy","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Hacettepe University, Ankara, Turkey"},{"name":"School of Informatics and Computing, Indiana University Bloomington, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2016,7,28]]},"reference":[{"key":"bibr1-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90091-8"},{"key":"bibr2-1094342015621367","unstructured":"Andreev AE, Scepanovic R (2003) Fast flexible search engine for longest prefix match. US Patent 6,564,211, USA."},{"key":"bibr3-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1145\/135239.135243"},{"key":"bibr4-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14122-5_6"},{"key":"bibr5-1094342015621367","volume-title":"A block-sorting lossless data compression algorithm. Technical Report SRC-RR-124","author":"Burrows M","year":"1994"},{"key":"bibr6-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2012.6402918"},{"key":"bibr7-1094342015621367","first-page":"26","volume":"3","author":"Cloud RL","year":"2011","journal-title":"Inquiro"},{"key":"bibr8-1094342015621367","volume-title":"Text Algorithms","author":"Crochemore M","year":"1994"},{"key":"bibr9-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00182-X"},{"key":"bibr10-1094342015621367","unstructured":"CUDA Dynamic Parallelism Programming Guide (2014) [online]. Available at: http:\/\/docs.nvidia.com\/cuda\/pdf\/CUDA_C_Programming_Guide.pdf (accessed 20 October 2014)."},{"key":"bibr11-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.872576"},{"key":"bibr12-1094342015621367","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920927"},{"key":"bibr13-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851207"},{"key":"bibr14-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1999.830045"},{"key":"bibr15-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"bibr16-1094342015621367","first-page":"1","volume":"10","author":"Hyyro H","year":"2003","journal-title":"Nordic Journal of Computing"},{"key":"bibr17-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2005.1465343"},{"key":"bibr18-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30397-5_8"},{"key":"bibr19-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2000.853719"},{"key":"bibr20-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1145\/1594835.1504181"},{"issue":"3","key":"bibr21-1094342015621367","first-page":"681","volume":"14","author":"Lim H","year":"2012","journal-title":"IEEE Communications Surveys Tutorials"},{"key":"bibr22-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"bibr23-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2011.08.002"},{"key":"bibr24-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316550"},{"key":"bibr25-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1145\/1964179.1964189"},{"key":"bibr26-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2011.52"},{"key":"bibr27-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2013.22"},{"key":"bibr28-1094342015621367","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2578948.2560690","volume-title":"Proceedings of Programming Models and Applications on Multicores and Manycores (PMAM\u201914)","author":"Ozsoy A","year":"2014"},{"key":"bibr29-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2013.06.022"},{"key":"bibr30-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS.2012.16"},{"key":"bibr31-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/InPar.2012.6339599"},{"key":"bibr32-1094342015621367","unstructured":"Pieterse V, Black PE (2014) Longest common substring. Dictionary of Algorithms and Data Structures. Available at: http:\/\/www.nist.gov\/dads\/HTML\/longestCommonSubstring.html (accessed 30 September 2014)."},{"key":"bibr33-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2010.5470770"},{"key":"bibr34-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1145\/322344.322346"},{"key":"bibr35-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1145\/1080695.1069981"},{"key":"bibr36-1094342015621367","first-page":"199","volume-title":"Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation (NSDI\u201913)","author":"Wang Y","year":"2013"},{"key":"bibr37-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1984.1659158"},{"key":"bibr38-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1145\/1851275.1851246"},{"key":"bibr39-1094342015621367","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055714"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342015621367","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1094342015621367","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342015621367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:19:36Z","timestamp":1777450776000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342015621367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,28]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["10.1177\/1094342015621367"],"URL":"https:\/\/doi.org\/10.1177\/1094342015621367","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,28]]}}}