{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:52:45Z","timestamp":1740099165982,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":73,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662580387"},{"type":"electronic","value":"9783662580394"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-662-58039-4_5","type":"book-chapter","created":{"date-parts":[[2018,9,16]],"date-time":"2018-09-16T06:39:40Z","timestamp":1537079980000},"page":"79-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"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":"F.","family":"D\u00e9vai","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,16]]},"reference":[{"issue":"2","key":"5_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)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Alexandrov, A., et al.: MapReduce and PACT\u2014comparing data parallel programming models. In: H\u00e4rder, T., Lehner, W., Mitschang, B., Sch\u00f6ning, H., Schwarz, H. (eds.) Datenbanksysteme f\u00fcr Business, Technologie und Web (BTW), 14. Fachtagung des GI-Fachbereichs \u201cDatenbanken und Informationssysteme\u201d (DBIS), 2.-4.3.2011 in Kaiserslautern, Germany. LNI, vol. 180, pp. 25\u201344. GI (2011). http:\/\/subs.emis.de\/LNI\/Proceedings\/Proceedings180\/article10.html","key":"5_CR2"},{"unstructured":"Alikoski, H.A.: \u00dcber das Sylvestersche Vierpunktproblem. Suomalainen Tiedeakatemia (1938)","key":"5_CR3"},{"doi-asserted-by":"crossref","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)","key":"5_CR4","DOI":"10.1145\/1465482.1465560"},{"key":"5_CR5","volume-title":"Interactive Computer Graphics: A Top-Down Approach Using OpenGL","author":"E Angel","year":"2009","unstructured":"Angel, E.: Interactive Computer Graphics: A Top-Down Approach Using OpenGL, 5th edn. Addison-Wesley Co., Inc., Pearson Education, Boston (2009)","edition":"5"},{"issue":"2","key":"5_CR6","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). https:\/\/doi.org\/10.1145\/1080695.1069995","journal-title":"SIGARCH Comput. Archit. News"},{"issue":"04","key":"5_CR7","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)","journal-title":"Int. J. Comput. Geom. Appl."},{"doi-asserted-by":"publisher","unstructured":"Borkar, S.: Thousand core chips: a technology perspective. In: Proceedings of the 44th Annual Design Automation Conference, DAC 2007, pp. 746\u2013749. ACM, New York (2007). https:\/\/doi.org\/10.1145\/1278480.1278667","key":"5_CR8","DOI":"10.1145\/1278480.1278667"},{"key":"5_CR9","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, 67\u201377 (2011). https:\/\/doi.org\/10.1145\/1941487.1941507","journal-title":"Commun. ACM"},{"unstructured":"Borkar, S.Y.: Personal communication (2017)","key":"5_CR10"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/1365490.1365499","volume":"6","author":"C Boyd","year":"2008","unstructured":"Boyd, C.: Data-parallel computing. Queue 6(2), 30\u201339 (2008). https:\/\/doi.org\/10.1145\/1365490.1365499","journal-title":"Queue"},{"doi-asserted-by":"crossref","unstructured":"Cai, G., Hu, W., Liu, G., Li, Q., Wang, X., Dong, W.: An effective speedup metric considering I\/O constraint in large-scale parallel computer systems. In: 19th International Conference on Advanced Communication Technology (ICACT), pp. 816\u2013822, February 2017","key":"5_CR12","DOI":"10.23919\/ICACT.2017.7890231"},{"key":"5_CR13","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). https:\/\/doi.org\/10.1007\/3-540-44679-6_7"},{"doi-asserted-by":"crossref","unstructured":"Cook, S.A., Dwork, C.: Bounds on the time for parallel RAM\u2019s to compute simple functions. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982, pp. 231\u2013233. ACM, New York (1982)","key":"5_CR14","DOI":"10.1145\/800070.802196"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","volume":"7","author":"SA Cook","year":"1973","unstructured":"Cook, S.A., Reckhow, R.A.: Time bounded random access machines. J. Comput. Syst. Sci. 7(4), 354\u2013375 (1973)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"issue":"1","key":"5_CR17","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). https:\/\/doi.org\/10.1145\/2976758","journal-title":"Commun. ACM"},{"key":"5_CR18","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). https:\/\/doi.org\/10.1007\/978-3-642-21931-3_2"},{"issue":"4","key":"5_CR19","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/3056859","volume":"60","author":"CACM Staff","year":"2017","unstructured":"D\u00e9vai, F.: Gustafson\u2019s law contradicts theory results (Letter to the Editor). Commun. ACM 60(4), 8\u20139 (2017). https:\/\/doi.org\/10.1145\/3056859","journal-title":"Communications of the ACM"},{"issue":"2","key":"5_CR20","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)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"5_CR21","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)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/2408776.2408797","volume":"56","author":"H Esmaeilzadeh","year":"2013","unstructured":"Esmaeilzadeh, H., Blem, E., Amant, R.S., Sankaralingam, K., Burger, D.: Power challenges may end the multicore era. Commun. ACM 56(2), 93\u2013102 (2013). https:\/\/doi.org\/10.1145\/2408776.2408797","journal-title":"Commun. ACM"},{"issue":"3","key":"5_CR23","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). https:\/\/doi.org\/10.1145\/1816038.1816011","journal-title":"SIGARCH Comput. Archit. News"},{"doi-asserted-by":"publisher","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 the 17th Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 48\u201358. ACM, New York (1985). https:\/\/doi.org\/10.1145\/22145.22151","key":"5_CR24","DOI":"10.1145\/22145.22151"},{"unstructured":"Fich, F.E., Meyer auf der Heide, F., Wigderson, A.: Lower bounds for parallel random access machines with unbounded shared memory. Adv. Comput. Res. Parallel Distrib. Comput. 4, 1\u201316 (1987)","key":"5_CR25"},{"doi-asserted-by":"publisher","unstructured":"Fich, F.E., Hendler, D., Shavit, N.: Linear lower bounds on real-world implementations of concurrent objects. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005, pp. 165\u2013173. IEEE Computer Society, Washington, DC (2005). https:\/\/doi.org\/10.1109\/SFCS.2005.47","key":"5_CR26","DOI":"10.1109\/SFCS.2005.47"},{"issue":"3","key":"5_CR27","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1142\/S0129054110007325","volume":"21","author":"M Forsell","year":"2010","unstructured":"Forsell, M.: On the performance and cost of some PRAM models on CMP hardware. Int. J. Found. Comput. Sci. 21(3), 387\u2013404 (2010). https:\/\/doi.org\/10.1142\/S0129054110007325","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"5_CR28","doi-asserted-by":"publisher","first-page":"21","DOI":"10.15803\/ijnc.1.1_21","volume":"1","author":"Martti Forsell","year":"2011","unstructured":"Forsell, M.: A PRAM-NUMA model of computation for addressing low-TLP workloads. Int. J. Netw. Comput. 1(1), 21\u201335 (2011). http:\/\/www.ijnc.org\/index.php\/ijnc\/article\/view\/11","journal-title":"International Journal of Networking and Computing"},{"doi-asserted-by":"crossref","unstructured":"Fortune, S., Wyllie, J.: Parallelism in random access machines. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 114\u2013118. ACM, New York (1978)","key":"5_CR29","DOI":"10.1145\/800133.804339"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-45591-4_14","volume-title":"Parallel and Distributed Processing","author":"A Fujiwara","year":"2000","unstructured":"Fujiwara, A., Inoue, M., Masuzawa, T.: Parallelizability of some P-complete problems. In: Rolim, J. (ed.) IPDPS 2000. LNCS, vol. 1800, pp. 116\u2013122. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45591-4_14"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TPDS.2017.2754376","volume":"29","author":"F Ghanim","year":"2018","unstructured":"Ghanim, F., Vishkin, U., Barua, R.: Easy PRAM-based high-performance parallel programming with ICE. IEEE Trans. Parallel Distrib. Syst. 29, 377\u2013390 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR32","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":"5_CR33","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)","journal-title":"Commun. ACM"},{"key":"5_CR34","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"},{"unstructured":"Hennessy, J.L.: Personal communication (2017)","key":"5_CR35"},{"key":"5_CR36","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":"5_CR37","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)","journal-title":"Computer"},{"issue":"12","key":"5_CR38","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1145\/7902.7903","volume":"29","author":"WD Hillis","year":"1986","unstructured":"Hillis, W.D., Steele Jr., G.L.: Data parallel algorithms. Commun. ACM 29(12), 1170\u20131183 (1986)","journal-title":"Commun. ACM"},{"issue":"2","key":"5_CR39","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)","journal-title":"SIGARCH Comput. Archit. News"},{"unstructured":"Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: Proeedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 938\u2013948. Society for Industrial and Applied Mathematics, Philadelphia (2010). http:\/\/dl.acm.org\/citation.cfm?id=1873601.1873677","key":"5_CR40"},{"issue":"5","key":"5_CR41","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1145\/78607.78614","volume":"33","author":"AH Karp","year":"1990","unstructured":"Karp, A.H., Flatt, H.P.: Measuring parallel processor performance. Commun. ACM 33(5), 539\u2013543 (1990). https:\/\/doi.org\/10.1145\/78607.78614","journal-title":"Commun. ACM"},{"key":"5_CR42","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1016\/B978-0-444-88071-0.50022-9","volume-title":"Algorithms and Complexity","author":"Richard M. KARP","year":"1990","unstructured":"Karp, R.M., Ramachandran, V.: Parallel algorithms for shared-memory machines. In: Handbook of Theoretical Computer Science, vol. A, pp. 869\u2013941. MIT Press, Cambridge (1990). http:\/\/portal.acm.org\/citation.cfm?id=114872.114889"},{"issue":"2","key":"5_CR43","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","volume":"14","author":"L Kucera","year":"1982","unstructured":"Kucera, L.: Parallel computation and conflicts in memory access. Inf. Process. Lett. 14(2), 93\u201396 (1982). https:\/\/doi.org\/10.1016\/0020-0190(82)90093-X","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"5_CR44","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). https:\/\/doi.org\/10.1145\/356683.356686","journal-title":"ACM Comput. Surv."},{"issue":"11","key":"5_CR45","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)","journal-title":"Computer"},{"issue":"8","key":"5_CR46","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). https:\/\/doi.org\/10.1145\/361082.361093","journal-title":"Commun. ACM"},{"key":"5_CR47","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)","journal-title":"SIGACT News"},{"issue":"2","key":"5_CR48","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1109\/MC.2007.59","volume":"40","author":"David Luebke","year":"2007","unstructured":"Luebke, D., Humphreys, G.: How GPUs work. Computer 40, 96\u2013100 (2007). http:\/\/dl.acm.org\/citation.cfm?id=1251557.1251701","journal-title":"Computer"},{"issue":"1","key":"5_CR49","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)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"5_CR50","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1007\/s10766-016-0453-2","volume":"45","author":"Ami Marowka","year":"2016","unstructured":"Marowka, A.: Energy-aware modeling of scaled heterogeneous systems. Int. J. Parallel Program. 45, 1\u201320 (2017)","journal-title":"International Journal of Parallel Programming"},{"key":"5_CR51","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)","journal-title":"ACM Trans. Graph."},{"issue":"3","key":"5_CR52","doi-asserted-by":"publisher","first-page":"45:1","DOI":"10.1145\/2856125","volume":"48","author":"S Mittal","year":"2016","unstructured":"Mittal, S.: A survey of techniques for architecting and managing asymmetric multicore processors. ACM Comput. Surv. 48(3), 45:1\u201345:38 (2016). https:\/\/doi.org\/10.1145\/2856125","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"5_CR53","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). https:\/\/doi.org\/10.1145\/2845084","journal-title":"ACM Trans. Archit. Code Optim."},{"issue":"2","key":"5_CR54","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1365490.1365500","volume":"6","author":"J Nickolls","year":"2008","unstructured":"Nickolls, J., Buck, I., Garland, M., Skadron, K.: Scalable parallel programming with CUDA. Queue 6(2), 40\u201353 (2008). https:\/\/doi.org\/10.1145\/1365490.1365500","journal-title":"Queue"},{"unstructured":"Patterson, D., Hennessy, J.: Computer Organization and Design: The Hardware\/Software Interface. The Morgan Kaufmann Series in Computer Architecture and Design. Elsevier Science, $$ARM^{\\textregistered }$$ARM\u00ae edn. (2016)","key":"5_CR55"},{"doi-asserted-by":"crossref","unstructured":"Patterson, D.A.: Personal communication (2017)","key":"5_CR56","DOI":"10.1016\/B978-0-12-809324-5.06502-0"},{"issue":"3","key":"5_CR57","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/971701.50214","volume":"17","author":"DA Patterson","year":"1988","unstructured":"Patterson, D.A., Gibson, G., Katz, R.H.: A case for redundant arrays of inexpensive disks (RAID). SIGMOD Rec. 17(3), 109\u2013116 (1988)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"5_CR58","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). https:\/\/doi.org\/10.1007\/s10766-006-0028-8","journal-title":"Int. J. Parallel Program."},{"unstructured":"Philip, J.: The area of a random triangle in a square. Technical report TRITA MAT 10 MA 01, Royal Institute of Technology (2010). http:\/\/www.math.kth.se\/~johanph\/squaref.pdf","key":"5_CR59"},{"key":"5_CR60","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? In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 311\u2013311. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0015436"},{"issue":"5","key":"5_CR61","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)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"publisher","unstructured":"Roughgarden, T., Vassilvitskii, S., Wang, J.R.: Shuffles and circuits: (on lower bounds for modern parallel computation). In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, pp. 1\u201312. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2935764.2935799","key":"5_CR62","DOI":"10.1145\/2935764.2935799"},{"key":"5_CR63","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). https:\/\/doi.org\/10.1145\/1897852.1897873","journal-title":"Commun. ACM"},{"issue":"3","key":"5_CR64","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). https:\/\/doi.org\/10.1145\/1508284.1508274","journal-title":"SIGPLAN Not."},{"issue":"2","key":"5_CR65","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)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"5_CR66","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). https:\/\/doi.org\/10.1137\/0204030","journal-title":"SIAM J. Comput."},{"issue":"8","key":"5_CR67","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). https:\/\/doi.org\/10.1145\/79173.79181","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Vishkin, U.: A PRAM-on-chip vision (invited abstract). In: Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE 2000), p. 260. IEEE Computer Society, Washington, DC (2000). http:\/\/portal.acm.org\/citation.cfm?id=829519.830820","key":"5_CR68","DOI":"10.1109\/SPIRE.2000.878204"},{"issue":"5","key":"5_CR69","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/TC.1986.1676783","volume":"35","author":"JS Vitter","year":"1986","unstructured":"Vitter, J.S., Simons, R.A.: New classes for parallel complexity: a study of unification and other complete problems for P. IEEE Trans. Comput. 35(5), 403\u2013418 (1986). https:\/\/doi.org\/10.1109\/TC.1986.1676783","journal-title":"IEEE Trans. Comput."},{"key":"5_CR70","volume-title":"Hadoop: The Definitive Guide","author":"T White","year":"2012","unstructured":"White, T.: Hadoop: The Definitive Guide. O\u2019Reilly Media Inc., Sebastopol (2012)"},{"issue":"12","key":"5_CR71","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)","journal-title":"Computer"},{"issue":"1","key":"5_CR72","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). https:\/\/doi.org\/10.1016\/j.parco.2013.11.001","journal-title":"Parallel Comput."},{"issue":"6","key":"5_CR73","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). https:\/\/doi.org\/10.1109\/TC.2015.2458865","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Science XXXIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-58039-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T14:02:42Z","timestamp":1662040962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-58039-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783662580387","9783662580394"],"references-count":73,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-58039-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}