{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T15:40:38Z","timestamp":1648654838341},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,6,18]],"date-time":"2015-06-18T00:00:00Z","timestamp":1434585600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s10586-015-0466-4","type":"journal-article","created":{"date-parts":[[2015,6,17]],"date-time":"2015-06-17T05:22:11Z","timestamp":1434518531000},"page":"1087-1098","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["High performance parallelization of Boyer\u2013Moore algorithm on many-core accelerators"],"prefix":"10.1007","volume":"18","author":[{"given":"Yosang","family":"Jeong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myungho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dukyun","family":"Nam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jik-Soo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soonwook","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,18]]},"reference":[{"issue":"10","key":"466_CR1","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"RS Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"issue":"5","key":"466_CR2","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1137\/S0097539791195543","volume":"23","author":"Richard Cole","year":"1994","unstructured":"Cole, Richard: Tight bounds on the complexity of the Boyer\u2013Moore string matching algorithm. SIAM J. Comput. 23(5), 1075\u20131091 (1994)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"466_CR3","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"Leonardo Dagum","year":"1998","unstructured":"Dagum, Leonardo, Menon, Ramesh: OpenMP: an industry standard API for shared memory programming. Comput. Sci. Eng. IEEE 5(1), 46\u201355 (1998)","journal-title":"Comput. Sci. Eng. IEEE"},{"issue":"9","key":"466_CR4","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/359146.359148","volume":"22","author":"Zvi Galil","year":"1979","unstructured":"Galil, Zvi: On improving the worst case running time of the Boyer\u2013Moore string matching algorithm. Commun. ACM 22(9), 505\u2013508 (1979)","journal-title":"Commun. ACM"},{"key":"466_CR5","first-page":"45","volume":"2","author":"Mark Harris","year":"2007","unstructured":"Harris, Mark: Optimizing parallel reduction in CUDA. NVIDIA Dev. Technol. 2, 45 (2007)","journal-title":"NVIDIA Dev. Technol."},{"key":"466_CR6","volume-title":"Intel Xeon Phi Coprocessor High Performance Programming, Newnes","author":"J Jeffers","year":"2013","unstructured":"Jeffers, J., Reinders, J.: Intel Xeon Phi Coprocessor High Performance Programming, Newnes. Elsevier, Amsterdam (2013)"},{"key":"466_CR7","doi-asserted-by":"crossref","unstructured":"Kouzinopoulos, Charalampos S., Konstantinos G., Margaritis. String matching on a multicore GPU using CUDA informatics, 2009. PCI\u201909. 13th Panhellenic conference on IEEE 2009","DOI":"10.1109\/PCI.2009.47"},{"issue":"1","key":"466_CR8","first-page":"11","volume":"6","author":"DT Marr","year":"2002","unstructured":"Marr, D.T., et al.: Hyper-threading technology architecture and microarchitecture. Intel Technol. J. 6(1), 11 (2002)","journal-title":"Intel Technol. J."},{"key":"466_CR9","unstructured":"NVIDIA.: CUDA Best Practices Guide: NVIDIA CUDA C Programming Best Practices Guide CUDA Toolkit 5.0, Oct. 2012"},{"key":"466_CR10","unstructured":"NVIDIA.: NVIDIA\u2019s next generation CUDA compute architecture: Kepler GK110 white paper. http:\/\/www.nvidia.com\/contents\/PDF\/kepler\/NVIDIA-Kepler-GK110-Architecture-Whitepaper.pdf (2011). Accessed Nov 2011"},{"issue":"1","key":"466_CR11","first-page":"25","volume":"13","author":"CS Rao","year":"2013","unstructured":"Rao, C.S., Raju, K.B., Raju, V.S.: Parallel string matching with multi core processors-A comparative study for gene sequences. Glob. J. Comput. Sci. Technol. 13(1), 25\u201341 (2013)","journal-title":"Glob. J. Comput. Sci. Technol."},{"issue":"3","key":"466_CR12","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/MCSE.2010.69","volume":"12","author":"John E Stone","year":"2010","unstructured":"Stone, John E., Gohara, David, Shi, Guochun: OpenCL: a parallel programming standard for heterogeneous computing systems. Comput. Sci. Eng. 12(3), 66 (2010)","journal-title":"Comput. Sci. Eng."},{"key":"466_CR13","unstructured":"The OpenACC application programming interface version 1.0. http:\/\/www.openacc.org\/sites\/default\/files\/OpenACC.1.0_0.pdf (2011). Accessed Nov 2011"},{"key":"466_CR14","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1016\/S1876-6102(14)00454-8","volume":"13","author":"J Zhou","year":"2011","unstructured":"Zhou, J., et al.: Implementation of string match algorithm BMH on GPU using CUDA. Energy Procedia 13, 1853\u20131861 (2011)","journal-title":"Energy Procedia"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-015-0466-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-015-0466-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-015-0466-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T03:39:12Z","timestamp":1566877152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-015-0466-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,18]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["466"],"URL":"https:\/\/doi.org\/10.1007\/s10586-015-0466-4","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,18]]}}}