{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T17:03:23Z","timestamp":1726074203448},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030432287"},{"type":"electronic","value":"9783030432294"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43229-4_33","type":"book-chapter","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:03:53Z","timestamp":1584576233000},"page":"385-395","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SIMD-node Transformations for Non-blocking Data Structures"],"prefix":"10.1007","author":[{"given":"Joel","family":"Fuentes","sequence":"first","affiliation":[]},{"given":"Wei-yu","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Guei-yuan","family":"Lueh","sequence":"additional","affiliation":[]},{"given":"Arturo","family":"Garza","sequence":"additional","affiliation":[]},{"given":"Isaac D.","family":"Scherson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,19]]},"reference":[{"issue":"4","key":"33_CR1","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/s10766-014-0308-7","volume":"43","author":"S Feldman","year":"2015","unstructured":"Feldman, S., Laborde, P., Dechev, D.: A wait-free multi-word compare-and-swap operation. Int. J. Parallel Program. 43(4), 572\u2013596 (2015)","journal-title":"Int. J. Parallel Program."},{"issue":"12","key":"33_CR2","doi-asserted-by":"publisher","first-page":"1901","DOI":"10.1109\/PROC.1966.5273","volume":"54","author":"MJ Flynn","year":"1966","unstructured":"Flynn, M.J.: Very high-speed computing systems. Proc. IEEE 54(12), 1901\u20131909 (1966)","journal-title":"Proc. IEEE"},{"key":"33_CR3","unstructured":"Fuentes, J.: Towards methods to exploit concurrent data structures on heterogeneous CPU\/iGPU processors. Ph.D. thesis, UC Irvine (2019)"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Fuentes, J., Chen, W.Y., Lueh, G.Y., Scherson, I.D.: A lock-free skiplist for integrated graphics processing units. In: 2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), pp. 36\u201346. IEEE (2019)","DOI":"10.1109\/IPDPSW.2019.00015"},{"key":"33_CR5","unstructured":"Fuentes, J., Scherson, I.D.: Using integrated processor graphics to accelerate concurrent data and index structures (2018)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-36108-1_18","volume-title":"Distributed Computing","author":"TL Harris","year":"2002","unstructured":"Harris, T.L., Fraser, K., Pratt, I.A.: A practical multi-word compare-and-swap operation. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 265\u2013279. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-36108-1_18"},{"key":"33_CR7","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, Burlington (2011)"},{"issue":"3","key":"33_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. (TOPLAS) 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"33_CR9","unstructured":"Intel Corporation: C-for-metal compiler (2018). \nhttps:\/\/github.com\/intel\/cm-compiler"},{"key":"33_CR10","unstructured":"Junkins, S.: The compute architecture of Intel\u00ae Processor Graphics Gen9. Intel whitepaper v1 (2015)"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Kim, C., et al.: Fast: fast architecture sensitive tree search on modern CPUs and GPUs. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, pp. 339\u2013350. ACM (2010)","DOI":"10.1145\/1807167.1807206"},{"issue":"6","key":"33_CR12","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. ACM 33(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Ren, B., Agrawal, G., Larus, J.R., Mytkowicz, T., Poutanen, T., Schulte, W.: SIMD parallelization of applications that traverse irregular data structures. In: Proceedings of the 2013 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO), pp. 1\u201310. IEEE (2013)","DOI":"10.1109\/CGO.2013.6494989"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Schlegel, B., Gemulla, R., Lehner, W.: K-ary search on modern processors. In: Proceedings of the Fifth International Workshop on Data Management on New Hardware, pp. 52\u201360. ACM (2009)","DOI":"10.1145\/1565694.1565705"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/11516798_18","volume-title":"Principles of Distributed Systems","author":"H Sundell","year":"2005","unstructured":"Sundell, H., Tsigas, P.: Lock-free and practical doubly linked list-based deques using single-word compare-and-swap. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 240\u2013255. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11516798_18"},{"key":"33_CR16","unstructured":"Zeuch, S., Huber, F., Freytag, J.C.: Adapting tree structures for processing with SIMD instructions (2014)"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43229-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:09:59Z","timestamp":1584576599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43229-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030432287","9783030432294"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43229-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ppam.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}