{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T16:40:02Z","timestamp":1749055202829,"version":"3.41.0"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319436586"},{"type":"electronic","value":"9783319436593"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","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":[[2016]]},"DOI":"10.1007\/978-3-319-43659-3_40","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T02:54:01Z","timestamp":1470624841000},"page":"545-557","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multicore vs Manycore: The Energy Cost of Concurrency"],"prefix":"10.1007","author":[{"given":"Martin","family":"Groen","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"issue":"2","key":"40_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/2408776.2408797","volume":"56","author":"H Esmaeilzadeh","year":"2013","unstructured":"Esmaeilzadeh, H., Blem, E., St. Amant, R., Sankaralingam, K., Burger, D.: Power challenges may end the multicore era. Commun. ACM 56(2), 93\u2013102 (2013)","journal-title":"Commun. ACM"},{"issue":"5","key":"40_CR2","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/JSSC.1974.1050511","volume":"9","author":"RH Dennard","year":"1974","unstructured":"Dennard, R.H., Rideout, V., Bassous, E., Leblanc, A.: Design of ion-implanted mosfet\u2019s with very small physical dimensions. IEEE J. Solid-State Circ. 9(5), 256\u2013268 (1974)","journal-title":"IEEE J. Solid-State Circ."},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Esmaeilzadeh, H., Blem, E. St. Amant, R., Sankaralingam, K., Burger, D.: Dark silicon and the end of multicore scaling. In: ISCA, pp. 365\u2013376, June 2011","DOI":"10.1145\/2024723.2000108"},{"issue":"5","key":"40_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1941487.1941507","volume":"54","author":"S Borkar","year":"2011","unstructured":"Borkar, S., Chien, A.A.: The future of microprocessors. Commun. ACM 54(5), 67\u201377 (2011)","journal-title":"Commun. ACM"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Borkar, S.: Thousand core chips: a technology perspective. In: DAC, pp. 746\u2013749 (2007)","DOI":"10.1145\/1278480.1278667"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Andersen, D.G., Franklin, J., Kaminsky, M., Phanishayee, A., Tan, L., Vasudevan, V.: Fawn: A fast array of wimpy nodes. In: SOSP, pp. 1\u201314 (2009)","DOI":"10.1145\/1629575.1629577"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Berezecki, M., Frachtenberg, E., Paleczny, M., Steele, K.: Many-core key-value store. In: IGCC, pp. 1\u20138, July 2011","DOI":"10.1109\/IGCC.2011.6008565"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Gramoli, V.: More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms. In: PPoPP, pp. 1\u201310 (2015)","DOI":"10.1145\/2858788.2688501"},{"key":"40_CR9","unstructured":"Intel: Measuring power processor: TDP vs. ACP Intel White paper (2011)"},{"issue":"12","key":"40_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MC.2007.443","volume":"40","author":"LA Barroso","year":"2007","unstructured":"Barroso, L.A., Holzle, U.: The case for energy-proportional computing. Computer 40(12), 33\u201337 (2007)","journal-title":"Computer"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Rotem, E., Naveh, A., Rajwan, D., Ananthakrishnan, A., Weissmann, E.: Power management architecture of the 2nd generation intel core microarchitecture, formerly codenamed sandy bridge. In: HotChips (2011)","DOI":"10.1109\/HOTCHIPS.2011.7477510"},{"key":"40_CR12","unstructured":"Tilera: UG410 - TILExtreme-Gx Platform User\u2019s Guide Release 1.1 Doc. N. UG410, May 2013"},{"key":"40_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-72951-8_11","volume-title":"Structural Information and Communication Complexity","author":"MP Herlihy","year":"2007","unstructured":"Herlihy, M.P., Lev, Y., Luchangco, V., Shavit, N.N.: A simple optimistic skiplist algorithm. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 124\u2013138. Springer, Heidelberg (2007)"},{"key":"40_CR14","volume-title":"A skip list for multicore","author":"I Dick","year":"2016","unstructured":"Dick, I., Fekete, A., Gramoli, V.: A skip list for multicore. Concurrency and Computation, Practice and Experience (2016)"},{"key":"40_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-04355-0_12","volume-title":"Distributed Computing","author":"P Felber","year":"2009","unstructured":"Felber, P., Gramoli, V., Guerraoui, R.: Elastic transactions. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 93\u2013107. Springer, Heidelberg (2009)"},{"key":"40_CR16","unstructured":"Fraser, K.: Practical lock-freedom. Ph.D. Thesis, University of Cambridge (2004)"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Raynal, M.: No hot spot non-blocking skip list. In: ICDCS, pp. 196\u2013205 (2013)","DOI":"10.1109\/ICDCS.2013.42"},{"issue":"4","key":"40_CR18","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1142\/S0129626407003125","volume":"17","author":"S Hellor","year":"2007","unstructured":"Hellor, S., Herlihy, M., Luchangco, V., Moir, M., Scherer, W.N., Shavit, N.: A lazy concurrent list-based set algorithm. Parallel Process. Lett. 17(4), 411\u2013424 (2007)","journal-title":"Parallel Process. Lett."},{"key":"40_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45414-4_21","volume-title":"Distributed Computing","author":"TL Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 300\u2013314. Springer, Heidelberg (2001)"},{"key":"40_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-3-662-44202-9_8","volume-title":"ECOOP 2014 \u2013 Object-Oriented Programming","author":"V Gramoli","year":"2014","unstructured":"Gramoli, V., Guerraoui, R.: Reusable concurrent data types. In: Jones, R. (ed.) ECOOP 2014. LNCS, vol. 8586, pp. 182\u2013206. Springer, Heidelberg (2014)"},{"key":"40_CR21","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco (2008)"},{"key":"40_CR22","doi-asserted-by":"crossref","unstructured":"Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: SPAA, pp. 73\u201382. ACM, New York (2002)","DOI":"10.1145\/564870.564881"},{"key":"40_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-642-40047-6_25","volume-title":"Euro-Par 2013 Parallel Processing","author":"T Crain","year":"2013","unstructured":"Crain, T., Gramoli, V., Raynal, M.: A contention-friendly binary search tree. In: Wolf, F., Mohr, B., an Mey, D. (eds.) Euro-Par 2013. LNCS, vol. 8097, pp. 229\u2013240. Springer, Heidelberg (2013)"},{"key":"40_CR24","doi-asserted-by":"crossref","unstructured":"Minh, C.C., Chung, J., Kozyrakis, C., Olukotun, K.: Stamp: Stanford transactional applications for multi-processing. In: IISWC, pp. 35\u201346. IEEE (2008)","DOI":"10.1109\/IISWC.2008.4636089"},{"key":"40_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-04355-0_12","volume-title":"Distributed Computing","author":"P Felber","year":"2009","unstructured":"Felber, P., Gramoli, V., Guerraoui, R.: Elastic transactions. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 93\u2013107. Springer, Heidelberg (2009)"},{"key":"40_CR26","unstructured":"Intel: Intel 64 and IA-32 architectures software developers manual - vol. 2A: Instruction set reference, A\u2013M (2007)"},{"key":"40_CR27","doi-asserted-by":"crossref","unstructured":"Crain, T., Gramoli, V., Raynal, M.: A speculation-friendly binary search tree. In: PPoPP, pp. 161\u2013170 (2012)","DOI":"10.1145\/2370036.2145837"},{"issue":"7","key":"40_CR28","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1145\/2209249.2209272","volume":"55","author":"H Esmaeilzadeh","year":"2012","unstructured":"Esmaeilzadeh, H., Cao, T., Yang, X., Blackburn, S.M., McKinley, K.S.: Looking back and looking forward: Power, performance, and upheaval. Commun. ACM 55(7), 105\u2013114 (2012)","journal-title":"Commun. ACM"},{"issue":"3","key":"40_CR29","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2425676.2425691","volume":"19","author":"JW Choi","year":"2013","unstructured":"Choi, J.W., Vuduc, R.W.: How much (execution) time and energy does my algorithm cost? XRDS 19(3), 49\u201351 (2013)","journal-title":"XRDS"},{"key":"40_CR30","doi-asserted-by":"crossref","unstructured":"Demmel, J., Gearhart, A., Lipshitz, B., Schwartz, O.: Perfect strong scaling using no additional energy. In: IPDPS, pp. 649\u2013660 (2013)","DOI":"10.1109\/IPDPS.2013.32"},{"key":"40_CR31","doi-asserted-by":"crossref","unstructured":"Haider, S.K., Hasenplaugh, W., Alistarh, D.: Lease\/release: architectural support for scaling contended data structures. In: PPoPP (2016)","DOI":"10.1145\/2851141.2851155"},{"key":"40_CR32","doi-asserted-by":"crossref","unstructured":"Ramapantulu, L., Loghin, D., Teo, Y.M.: An approach for energy efficient execution of hybrid parallel programs. In: IPDPS, pp. 1000\u20131009, May 2015","DOI":"10.1109\/IPDPS.2015.71"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2016: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43659-3_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T15:58:04Z","timestamp":1749052684000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43659-3_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319436586","9783319436593"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43659-3_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/europar2016.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}