{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:01:26Z","timestamp":1742922086710,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623948"},{"type":"electronic","value":"9783319623955"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-62395-5_33","type":"book-chapter","created":{"date-parts":[[2017,7,6]],"date-time":"2017-07-06T00:52:59Z","timestamp":1499302379000},"page":"480-493","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Refutation of Amdahl\u2019s Law and Its Variants"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1825-495X","authenticated-orcid":false,"given":"Ferenc","family":"D\u00e9vai","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,7]]},"reference":[{"issue":"2","key":"33_CR1","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0304-3975(92)90271-G","volume":"95","author":"SG Akl","year":"1992","unstructured":"Akl, S.G., Cosnard, M., Ferreira, A.G.: Data-movement-intensive problems: two folk theorems in parallel computation revisited. Theor. Comput. Sci. 95(2), 323\u2013337 (1992). doi:10.1016\/0304-3975(92)90271-G","journal-title":"Theor. Comput. Sci."},{"key":"33_CR2","doi-asserted-by":"publisher","unstructured":"Amdahl, G.M.: Validity of the single processor approach to achieving large scale computing capabilities. In: Proceedings of Spring Joint Computer Conference, pp. 483\u2013485. ACM, New York (1967). doi:10.1145\/1465482.1465560","DOI":"10.1145\/1465482.1465560"},{"issue":"2","key":"33_CR3","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1145\/1080695.1069995","volume":"33","author":"M Annavaram","year":"2005","unstructured":"Annavaram, M., Grochowski, E., Shen, J.: Mitigating Amdahl\u2019s law through EPI throttling. SIGARCH Comput. Archit. News 33(2), 298\u2013309 (2005). http:\/\/doi.acm.org\/10.1145\/1080695.1069995","journal-title":"SIGARCH Comput. Archit. News"},{"issue":"04","key":"33_CR4","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1142\/S0218195993000282","volume":"03","author":"MJ Atallah","year":"1993","unstructured":"Atallah, M.J., Callahan, P.B., Goodrich, M.T.: P-complete geometric problems. Int. J. Comput. Geom. Appl. 03(04), 443\u2013462 (1993). doi:10.1142\/S0218195993000282","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Borkar, S.: Thousand core chips: a technology perspective. In: Proceedings of 44th Annual Design Automation Conference, DAC 2007, pp. 746\u2013749. ACM, New York (2007). http:\/\/doi.acm.org\/10.1145\/1278480.1278667","DOI":"10.1109\/DAC.2007.375263"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-44679-6_7","volume-title":"Computing and Combinatorics","author":"CD Castanho","year":"2001","unstructured":"Castanho, C.D., Chen, W., Wada, K., Fujiwara, A.: Parallelizability of some P-complete geometric problems in the EREW-PRAM. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 59\u201363. Springer, Heidelberg (2001). doi:10.1007\/3-540-44679-6_7"},{"key":"33_CR7","doi-asserted-by":"publisher","unstructured":"Cook, S.A., Dwork, C.: Bounds on the time for parallel RAM\u2019s to compute simple functions. In: Proceedings of 14th Annual ACM Symposium on Theory of Computing, STOC 1982, pp. 231\u2013233. ACM, New York (1982). doi:10.1137\/0215006","DOI":"10.1137\/0215006"},{"issue":"1","key":"33_CR8","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/2976758","volume":"60","author":"PJ Denning","year":"2017","unstructured":"Denning, P.J., Lewis, T.G.: Exponential laws of computing growth. Commun. ACM 60(1), 54\u201365 (2017). http:\/\/doi.acm.org\/10.1145\/2976758","journal-title":"Commun. ACM"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-21931-3_2","volume-title":"Computational Science and Its Applications - ICCSA 2011","author":"F D\u00e9vai","year":"2011","unstructured":"D\u00e9vai, F.: An optimal hidden-surface algorithm and its parallelization. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011. LNCS, vol. 6784, pp. 17\u201329. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-21931-3_2"},{"issue":"4","key":"33_CR10","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/3056859","volume":"60","author":"F D\u00e9vai","year":"2017","unstructured":"D\u00e9vai, F.: Gustafson\u2019s law contradicts theory results. (Letter to the Editor). Commun. ACM 60(4), 8\u20139 (2017). http:\/\/doi.acm.org\/10.1145\/3056859","journal-title":"Commun. ACM"},{"issue":"2","key":"33_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0022-0000(85)90011-X","volume":"30","author":"PW Dymond","year":"1985","unstructured":"Dymond, P.W., Tompa, M.: Speedups of deterministic machines by synchronous parallel machines. J. Comput. Syst. Sci. 30(2), 149\u2013161 (1985). doi:10.1145\/800061.808763","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"33_CR12","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/08072646X","volume":"41","author":"F Ellen","year":"2012","unstructured":"Ellen, F., Hendler, D., Shavit, N.: On the inherent sequentiality of concurrent objects. SIAM J. Comput. 41(3), 519\u2013536 (2012). doi:10.1137\/08072646X","journal-title":"SIAM J. Comput."},{"issue":"2","key":"33_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/2408776.2408797","volume":"56","author":"H Esmaeilzadeh","year":"2013","unstructured":"Esmaeilzadeh, H., et al.: Power challenges may end the multicore era. Commun. ACM 56(2), 93\u2013102 (2013). http:\/\/doi.acm.org\/10.1145\/2408776.2408797","journal-title":"Commun. ACM"},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1145\/1816038.1816011","volume":"38","author":"S Eyerman","year":"2010","unstructured":"Eyerman, S., Eeckhout, L.: Modeling critical sections in Amdahl\u2019s law and its implications for multicore design. SIGARCH Comput. Archit. News 38(3), 362\u2013370 (2010). http:\/\/doi.acm.org\/10.1145\/1816038.1816011","journal-title":"SIGARCH Comput. Archit. News"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Fich, F.E., Meyer auf der Heide, F., Ragde, P., Wigderson, A.: One, two, three ... infinity: lower bounds for parallel computation. In: Proceedings of 17th Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 48\u201358. ACM, New York (1985). http:\/\/doi.acm.org\/10.1145\/22145.22151","DOI":"10.1145\/22145.22151"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Fich, F.E., Hendler, D., Shavit, N.: Linear lower bounds on real-world implementations of concurrent objects. In: Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005, pp. 165\u2013173 (2005). http:\/\/dx.doi.org\/10.1109\/SFCS.2005.47","DOI":"10.1109\/SFCS.2005.47"},{"key":"33_CR17","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-Completeness Theory","author":"R Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press Inc., New York (1995)"},{"issue":"5","key":"33_CR18","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1145\/42411.42415","volume":"31","author":"JL Gustafson","year":"1988","unstructured":"Gustafson, J.L.: Reevaluating Amdahl\u2019s law. Commun. ACM 31(5), 532\u2013533 (1988). doi:10.1145\/42411.42415","journal-title":"Commun. ACM"},{"key":"33_CR19","volume-title":"Computer Architecture: A Quantitative Approach","author":"JL Hennessy","year":"2011","unstructured":"Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach, 5th edn. Morgan Kaufmann Publishers Inc., San Francisco (2011)","edition":"5"},{"key":"33_CR20","volume-title":"The Art of Multiprocessor Programming, Revised Reprint","author":"M Herlihy","year":"2012","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming, Revised Reprint, 1st edn. Morgan Kaufmann Publishers Inc., San Francisco (2012)","edition":"1"},{"issue":"7","key":"33_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MC.2008.209","volume":"41","author":"MD Hill","year":"2008","unstructured":"Hill, M.D., Marty, M.R.: Amdahl\u2019s law in the multicore era. Computer 41(7), 33\u201338 (2008). doi:10.1109\/MC.2008.209","journal-title":"Computer"},{"issue":"2","key":"33_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2234336.2234338","volume":"40","author":"B Juurlink","year":"2012","unstructured":"Juurlink, B., Meenderinck, C.H.: Amdahl\u2019s law for predicting the future of multicores considered harmful. SIGARCH Comput. Archit. News 40(2), 1\u20139 (2012). doi:10.1145\/2234336.2234338","journal-title":"SIGARCH Comput. Archit. News"},{"issue":"1","key":"33_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/356683.356686","volume":"9","author":"DJ Kuck","year":"1977","unstructured":"Kuck, D.J.: A survey of parallel machine organization and programming. ACM Comput. Surv. 9(1), 29\u201359 (1977). http:\/\/doi.acm.org\/10.1145\/356683.356686","journal-title":"ACM Comput. Surv."},{"issue":"11","key":"33_CR24","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MC.2005.379","volume":"38","author":"R Kumar","year":"2005","unstructured":"Kumar, R., Tullsen, D.M., Jouppi, N.P., Ranganathan, P.: Heterogeneous chip multiprocessors. Computer 38(11), 32\u201338 (2005). doi:10.1109\/MC.2005.379","journal-title":"Computer"},{"issue":"8","key":"33_CR25","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Commun. ACM 17(8), 453\u2013455 (1974). http:\/\/doi.acm.org\/10.1145\/361082.361093","journal-title":"Commun. ACM"},{"key":"33_CR26","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1145\/130956.130960","volume":"23","author":"F Luccio","year":"1992","unstructured":"Luccio, F., Pagli, L.: The p-shovelers problem: (computing with time-varying data). SIGACT News 23, 72\u201375 (1992). doi:10.1145\/130956.130960","journal-title":"SIGACT News"},{"issue":"1","key":"33_CR27","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1137\/S0097539794265402","volume":"26","author":"L Mak","year":"1997","unstructured":"Mak, L.: Parallelism always helps. SIAM J. Comput. 26(1), 153\u2013172 (1997). doi:10.1137\/S0097539794265402","journal-title":"SIAM J. Comput."},{"key":"33_CR28","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/27625.27627","volume":"6","author":"M McKenna","year":"1987","unstructured":"McKenna, M.: Worst-case optimal hidden-surface removal. ACM Trans. Graph. 6, 19\u201328 (1987). doi:10.1145\/27625.27627","journal-title":"ACM Trans. Graph."},{"issue":"3","key":"33_CR29","first-page":"45:1","volume":"48","author":"S Mittal","year":"1987","unstructured":"Mittal, S.: A survey of techniques for architecting and managing asymmetric multicore processors. ACM Comput. Surv. 48(3), 45:1\u201345:38 (1987). http:\/\/doi.acm.org\/10.1145\/2856125","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"33_CR30","doi-asserted-by":"publisher","first-page":"57:1","DOI":"10.1145\/2845084","volume":"12","author":"A Morad","year":"2016","unstructured":"Morad, A., Yavits, L., Kvatinsky, S., Ginosar, R.: Resistive GP-SIMD processing-in-memory. ACM Trans. Archit. Code Optim. 12(4), 57:1\u201357:22 (2016). http:\/\/doi.acm.org\/10.1145\/2845084","journal-title":"ACM Trans. Archit. Code Optim."},{"key":"33_CR31","unstructured":"Patterson, D., Hennessy, J.: Computer Organization and Design: The Hardware\/Software Interface. The Morgan Kaufmann Series in Computer Architecture and Design, ARM\u00aeedn. Elsevier Science, Amsterdam (2016)"},{"issue":"3","key":"33_CR32","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/971701.50214","volume":"17","author":"DA Patterson","year":"1988","unstructured":"Patterson, D.A., et al.: A case for redundant arrays of inexpensive disks (RAID). SIGMOD Rec. 17(3), 109\u2013116 (1988). doi:10.1145\/971701.50214","journal-title":"SIGMOD Rec."},{"issue":"2","key":"33_CR33","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10766-006-0028-8","volume":"35","author":"JM Paul","year":"2007","unstructured":"Paul, J.M., Meyer, B.H.: Amdahl\u2019s law revisited for single chip systems. Int. J. Parallel Program. 35(2), 101\u2013123 (2007). http:\/\/dx.doi.org\/10.1007\/s10766-006-0028-8","journal-title":"Int. J. Parallel Program."},{"key":"33_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BFb0015436","volume-title":"Algorithms and Computations","author":"FP Preparata","year":"1995","unstructured":"Preparata, F.P.: Should Amdahl\u2019s law be repealed? (abstract). In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, p. 311. Springer, Heidelberg (1995). doi:10.1007\/BFb0015436"},{"issue":"5","key":"33_CR35","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","volume":"20","author":"JH Reif","year":"1985","unstructured":"Reif, J.H.: Depth-first search is inherently sequential. Inf. Process. Lett. 20(5), 229\u2013234 (1985). doi:10.1016\/0020-0190(85)90024-9","journal-title":"Inf. Process. Lett."},{"key":"33_CR36","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Vassilvitskii, S., Wang, J.R.: Shuffles and circuits: (on lower bounds for modern parallel computation). In: Proceedings of 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, pp. 1\u201312. ACM, New York (2016). http:\/\/doi.acm.org\/10.1145\/2935764.2935799","DOI":"10.1145\/2935764.2935799"},{"key":"33_CR37","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1897852.1897873","volume":"54","author":"N Shavit","year":"2011","unstructured":"Shavit, N.: Data structures in the multicore age. Commun. ACM 54, 76\u201384 (2011). http:\/\/doi.acm.org\/10.1145\/1897852.1897873","journal-title":"Commun. ACM"},{"issue":"3","key":"33_CR38","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/1508284.1508274","volume":"44","author":"MA Suleman","year":"2009","unstructured":"Suleman, M.A., Mutlu, O., Qureshi, M.K., Patt, Y.N.: Accelerating critical section execution with asymmetric multi-core architectures. SIGPLAN Not. 44(3), 253\u2013264 (2009). http:\/\/doi.acm.org\/10.1145\/1508284.1508274","journal-title":"SIGPLAN Not."},{"issue":"2","key":"33_CR39","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.jpdc.2009.05.002","volume":"70","author":"XH Sun","year":"2010","unstructured":"Sun, X.H., Chen, Y.: Reevaluating Amdahl\u2019s law in the multicore era. J. Parallel Distrib. Comput. 70(2), 183\u2013188 (2010). doi:10.1016\/j.jpdc.2009.05.002","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"33_CR40","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"LG Valiant","year":"1975","unstructured":"Valiant, L.G.: Parallelism in comparison problems. SIAM J. Comput. 4(3), 348\u2013355 (1975). http:\/\/dx.doi.org\/10.1137\/0204030","journal-title":"SIAM J. Comput."},{"issue":"8","key":"33_CR41","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103\u2013111 (1990). http:\/\/doi.acm.org\/10.1145\/79173.79181","journal-title":"Commun. ACM"},{"issue":"12","key":"33_CR42","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MC.2008.494","volume":"41","author":"DH Woo","year":"2008","unstructured":"Woo, D.H., Lee, H.H.: Extending Amdahl\u2019s law for energy-efficient computing in the many-core era. Computer 41(12), 24\u201331 (2008). doi:10.1109\/MC.2008.494","journal-title":"Computer"},{"issue":"1","key":"33_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.parco.2013.11.001","volume":"40","author":"L Yavits","year":"2014","unstructured":"Yavits, L., Morad, A., Ginosar, R.: The effect of communication and synchronization on Amdahl\u2019s law in multicore systems. Parallel Comput. 40(1), 1\u201316 (2014). http:\/\/dx.doi.org\/10.1016\/j.parco.2013.11.001","journal-title":"Parallel Comput."},{"issue":"6","key":"33_CR44","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/TC.2015.2458865","volume":"65","author":"L Yavits","year":"2016","unstructured":"Yavits, L., Morad, A., Ginosar, R.: The effect of temperature on Amdahl law in 3D multicore era. IEEE Trans. Comput. 65(6), 2010\u20132013 (2016). http:\/\/dx.doi.org\/10.1109\/TC.2015.2458865","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62395-5_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:57:35Z","timestamp":1710327455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62395-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623948","9783319623955"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62395-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"7 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}