{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:10:47Z","timestamp":1748751047637,"version":"3.41.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271217"},{"type":"electronic","value":"9783319271224"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27122-4_26","type":"book-chapter","created":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T11:27:27Z","timestamp":1447673247000},"page":"373-387","source":"Crossref","is-referenced-by-count":0,"title":["Bitwise Data Parallelism with LLVM: The ICgrep Case Study"],"prefix":"10.1007","author":[{"given":"Robert D.","family":"Cameron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nigel","family":"Medforth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dale","family":"Denis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William N.","family":"Sumner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,16]]},"reference":[{"key":"26_CR1","unstructured":"Asanovic, K., Bodik, R., Catanzaro, B.C., Gebis, J.J., Husbands, P., Keutzer, K., Patterson, D.A., Plishker, W.L., Shalf, J., Williams, S.W., et al.: The landscape of parallel computing research: a view from Berkeley. Technical report UCB\/EECS-2006-183, EECS Department, University of California, Berkeley (2006)"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-23397-5_2","volume-title":"Euro-Par 2011 Parallel Processing","author":"RD Cameron","year":"2011","unstructured":"Cameron, R.D., Amiri, E., Herdy, K.S., Lin, D., Shermer, T.C., Popowich, F.P.: Parallel scanning with bitstream addition: an XML case study. In: Jeannot, E., Namyst, R., Roman, J. (eds.) Euro-Par 2011, Part II. LNCS, vol. 6853, pp. 2\u201313. Springer, Heidelberg (2011)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Cameron, R.D., Shermer, T.C., Shriraman, A., Herdy, K.S., Lin, D., Hull, B.R., Lin, M.: Bitwise data parallelism in regular expression matching. In: PACT, pp. 139\u2013150. ACM, New York (2014)","DOI":"10.1145\/2628071.2628079"},{"key":"26_CR4","unstructured":"Davis, M., Heninger, A.: Unicode technical standard 18, Unicode regular expressions. The Unicode Consortium (2012)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: LLVM: a compilation framework for lifelong program analysis & transformation. In: Code Generation and Optimization 2004, pp. 75\u201386. IEEE (2004)","DOI":"10.1109\/CGO.2004.1281665"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Lin, D., Medforth, N., Herdy, K.S., Shriraman, A., Cameron, R.: Parabix: boosting the efficiency of text processing on commodity processors. In: High Performance Computer Architecture, pp. 1\u201312. IEEE (2012)","DOI":"10.1109\/HPCA.2012.6169041"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"G Myers","year":"1999","unstructured":"Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. ACM 46(3), 395\u2013415 (1999)","journal-title":"J. ACM"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Mytkowicz, T., Musuvathi, M., Schulte, W.: Data-parallel finite-state machines. In: ASPLOS, pp. 529\u2013542. ACM (2014)","DOI":"10.1145\/2541940.2541988"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Salapura, V., Karkhanis, T., Nagpurkar, P., Moreira, J.: Accelerating business analytics applications. In: HPCA, pp. 1\u201310. IEEE (2012)","DOI":"10.1109\/HPCA.2012.6169044"},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10766-010-0147-0","volume":"39","author":"DP Scarpazza","year":"2011","unstructured":"Scarpazza, D.P.: Top-performance tokenization and small-ruleset regular expression matching. Int. J. Parallel Program. 39(1), 3\u201332 (2011)","journal-title":"Int. J. Parallel Program."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"S116","DOI":"10.1016\/j.diin.2013.06.013","volume":"10","author":"J Stewart","year":"2013","unstructured":"Stewart, J., Uckelman, J.: Unicode search of dirty data, or: how i learned to stop worrying and love Unicode technical standard # 18. Digit. Invest. 10, S116\u2013S125 (2013)","journal-title":"Digit. Invest."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Zhao, Z., Wu, B., Shen, X.: Challenging the embarrassingly sequential: parallelizing finite state machine-based computations through principled speculation. In: ASPLOS, pp. 543\u2013558. ACM (2014)","DOI":"10.1145\/2541940.2541989"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Zu, Y., Yang, M., Xu, Z., Wang, L., Tian, X., Peng, K., Dong, Q.: GPU-based NFA implementation for memory efficient high speed regular expression matching. In: PPoPP, pp. 129\u2013140. ACM (2012)","DOI":"10.1145\/2370036.2145833"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27122-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T12:04:59Z","timestamp":1748693099000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27122-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271217","9783319271224"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27122-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}