{"id":1065,"date":"2025-04-15T13:46:27","date_gmt":"2025-04-15T17:46:27","guid":{"rendered":"https:\/\/kushaltimsina.com\/blog\/?p=1065"},"modified":"2025-04-15T17:54:54","modified_gmt":"2025-04-15T21:54:54","slug":"amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism","status":"publish","type":"post","link":"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/","title":{"rendered":"Amdahl&#8217;s Law and The Maximum Theoretical Speedup Achievable By Parallelism"},"content":{"rendered":"\n<p>We&#8217;ve been learning about theoretical parallelism in my concepts of parallel and distributed systems class, and I found this concept of a maximum theoretical speedup to be fascinating. <\/p>\n\n\n\n<p>So, I decided to write an article on it.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>What is Amdahl&#8217;s Law?<\/strong><\/h2>\n\n\n\n<p>Any program can be divided into two parts:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Parallel<\/strong> &#8211; This is the portion of the program that can be run simultaneously<\/li>\n\n\n\n<li><strong>Sequential<\/strong> &#8211; This is the portion of a program that has to be run sequentially (line by line)<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Restaurant Analogy<\/strong><\/h3>\n\n\n\n<p>Imagine you run a restaurant with one person cooking.<\/p>\n\n\n\n<p>So, you are the owner, and you have one chef.<\/p>\n\n\n\n<p>That chef works pretty hard.<\/p>\n\n\n\n<p>But, what if you multiply that chef by 10? <\/p>\n\n\n\n<p>So, you borrow my clone machine and now you&#8217;ve got 10 chefs cooking in <strong>parallel<\/strong>.<\/p>\n\n\n\n<p>It would be a lot faster than just having one person cooking, wouldn&#8217;t it?<\/p>\n\n\n\n<p>You&#8217;d expect to get 10x more dishes cooked, due to the 10x more people, right?<\/p>\n\n\n\n<p>We call that &#8220;10x more&#8221; the <strong>speedup<\/strong>.<\/p>\n\n\n\n<p>The speedup is essentially the answer to the question of: &#8220;If we add more chefs, how much faster will we get food made?&#8221;<\/p>\n\n\n\n<p>* Note that in reality, having 10x more chefs does not necessarily imply that we&#8217;ll get 10x more output. This is because in reality, things happen and these 10 more chefs will have to communicate with one another (having only 1 chef didn&#8217;t require this communication), spend time getting ingredients, and all sorts of other things that can happen when you have a room with 10 chefs making dishes.<\/p>\n\n\n\n<p>But, it will definitely be faster to have 10 more chefs than to have just 1.<\/p>\n\n\n\n<p>What if we had 100 chefs?<\/p>\n\n\n\n<p>What if we had 1000?<\/p>\n\n\n\n<p>Well, as you add more and more chefs, at some point, adding any more won&#8217;t help as much, due to the law of diminishing marginal utility.<\/p>\n\n\n\n<p>That is, 1,000 chefs in a room may have to communicate with each other (imagine how inefficient it would be)!<\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Maximum Theoretical Parallelism in Computer Science<\/strong><\/h3>\n\n\n\n<p>Now, instead of chefs, let&#8217;s say that we have a program, where 50% of it can be parallelized and 50% must remain sequential.<\/p>\n\n\n\n<p>This means that 50% of the program can run concurrently, via multithreading.<\/p>\n\n\n\n<p>Remember how we were able to add 10x more chefs? That&#8217;s similar to saying &#8220;we can run 50% of the program (the parallelized portion) at the same time in 10 different processors.&#8221;<\/p>\n\n\n\n<p>But what if we had 100 different processors? What if we had 1,000?<\/p>\n\n\n\n<p>Just like the chefs, adding more processors will help, but it will create additional <strong>overhead<\/strong>.<\/p>\n\n\n\n<p>Just as the chefs have to communicate with each other, the program might have to communicate with many threads. <\/p>\n\n\n\n<p>This communication introduces overhead, which makes the program run slower.<\/p>\n\n\n\n<p>One question is &#8220;theoretically, just how many more processors can we add until we can&#8217;t speed the program up anymore?&#8221;<\/p>\n\n\n\n<p>To answer this question, I introduce to you Amdahl&#8217;s Law.<\/p>\n\n\n\n<p>In the context of parallelism in computer science, Amdahl&#8217;s Law states that there is a <strong>maximum theoretical speedup<\/strong>.<\/p>\n\n\n\n<p>Now, how much we can speedup our program depends on <span class=\"wp-katex-eq\" data-display=\"false\"> p <\/span>, the number of processors. <\/p>\n\n\n\n<p>Having 100 processors run our program will yield a faster result than just having 2.<\/p>\n\n\n\n<p>Mathematically,<\/p>\n\n\n\n<span class=\"wp-katex-eq katex-display\" data-display=\"true\">\\displaystyle\\psi = \\frac{1}{f + \\frac{(1-f)}{p}} <\/span>\n\n\n\n<p>Where: <span class=\"wp-katex-eq\" data-display=\"false\">\\psi<\/span> is the maximum theoretical speedup<\/p>\n\n\n\n<p><span class=\"wp-katex-eq\" data-display=\"false\"> f <\/span> is the proportion of the program that must remain sequential.<\/p>\n\n\n\n<p><span class=\"wp-katex-eq\" data-display=\"false\"> 1-f <\/span> is the proportion of the program that can be <strong>parallelized<\/strong>.<\/p>\n\n\n\n<p>In our program from before, we said that 50% can be parallelized and 50% must remain sequential.<\/p>\n\n\n\n<p>Thus, according to Amdahl&#8217;s Law, we have:<\/p>\n\n\n\n<span class=\"wp-katex-eq\" data-display=\"false\">\\psi = \\displaystyle\\frac{1}{f + \\frac{(1-f)}{p}} =\\frac{1}{f + \\frac{(1-0.5)}{p}} <\/span>\n\n\n\n<p>Say we have <span class=\"wp-katex-eq\" data-display=\"false\"> p = 2 <\/span> processors.<\/p>\n\n\n\n<p>Then, <\/p>\n\n\n\n<span class=\"wp-katex-eq\" data-display=\"false\">\\psi = \\displaystyle\\frac{1}{f + \\frac{(1-f)}{p}} =\\frac{1}{0.5 + \\frac{(1-0.5)}{2}} = \\frac{4}{3} <\/span>\n\n\n\n<p>This is around 1.33x.<\/p>\n\n\n\n<p>This means that, if we have a program where <span class=\"wp-katex-eq\" data-display=\"false\"> 0.5=50% <\/span> can be parallelized, the <strong>maximum theoretical speedup<\/strong> we can with <span class=\"wp-katex-eq\" data-display=\"false\"> p = 2 <\/span> processors that we have is 1.33x. <\/p>\n\n\n\n<p>In simple words, if we applied parallelism into 50% of our code, with 2 processors, it will be at most 133% faster.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Implications of Amdahl&#8217;s Law<\/strong><\/h2>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Amdahl&#8217;s Law with 50% parallelism<\/strong><\/h3>\n\n\n\n<p>Now, let&#8217;s try to use Amdahl&#8217;s Law and some single variable calculus to understand this law a bit better.<\/p>\n\n\n\n<span class=\"wp-katex-eq\" data-display=\"false\">\\psi = \\displaystyle\\frac{1}{f + \\frac{(1-f)}{p}} <\/span>\n\n\n\n<p>Let&#8217;s continue with the proportion of sequential code, <span class=\"wp-katex-eq\" data-display=\"false\"> f = 0.5 <\/span>.<\/p>\n\n\n\n<p>But what if we try to increase the number of processors, <span class=\"wp-katex-eq\" data-display=\"false\"> p <\/span>?<\/p>\n\n\n\n<p>With <span class=\"wp-katex-eq\" data-display=\"false\"> p = 2 <\/span>, we had <span class=\"wp-katex-eq\" data-display=\"false\">\\psi <\/span> roughly equal to 1.33.<\/p>\n\n\n\n<p>What if we let p = 10? <\/p>\n\n\n\n<p>With <strong>10<\/strong> processors running parallel on 50% of our code, the maximum theoretical speedup is:<\/p>\n\n\n\n<p><\/p>\n\n\n\n<span class=\"wp-katex-eq\" data-display=\"false\">\\psi = \\displaystyle\\frac{1}{f + \\frac{(1-f)}{p}} =\\frac{1}{0.5 + \\frac{(1-0.5)}{10}} \\approx 1.81 <\/span>\n\n\n\n<p>What if <span class=\"wp-katex-eq\" data-display=\"false\"> p = 100<\/span>?<\/p>\n\n\n\n<p>With <strong>100<\/strong> processors running parallel on 50% of our code, the maximum theoretical speedup is:<\/p>\n\n\n\n<span class=\"wp-katex-eq\" data-display=\"false\">\\psi = \\displaystyle\\frac{1}{f + \\frac{(1-f)}{p}} =\\frac{1}{0.5 + \\frac{(1-0.5)}{100}} \\approx 1.98 <\/span>\n\n\n\n<p>With <strong>1000<\/strong> processors running parallel on 50% of our code, the maximum theoretical speedup is:<\/p>\n\n\n\n<span class=\"wp-katex-eq\" data-display=\"false\">\\psi = \\displaystyle\\frac{1}{f + \\frac{(1-f)}{p}} =\\frac{1}{0.5 + \\frac{(1-0.5)}{1000}} \\approx 1.99 <\/span>\n\n\n\n<p>Clearly, <\/p>\n\n\n\n<span class=\"wp-katex-eq\" data-display=\"false\"> \\displaystyle\\lim_{p\\to\\infty} \\psi = 2 <\/span>\n\n\n\n<p>That means that, theoretically, if we let the number of processors, <span class=\"wp-katex-eq\" data-display=\"false\"> p <\/span> approach <span class=\"wp-katex-eq\" data-display=\"false\"> \\infty <\/span>, the maximum theoretical speed up, according to Amdahl&#8217;s Law, is 2. <\/p>\n\n\n\n<p>In other words, even if we had an infinite number of processors, we could theoretically increase the speed of our program by 2x. <\/p>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Increasing the Parallel Portion<\/strong><\/h3>\n\n\n\n<p>Now, what if we were to increase the part of our code that could be run in parallel?<\/p>\n\n\n\n<p>Let&#8217;s say that the proportion of sequential code, <span class=\"wp-katex-eq\" data-display=\"false\"> f = 0.1 <\/span>, and therefore <span class=\"wp-katex-eq\" data-display=\"false\"> f = 0.9 <\/span>.<\/p>\n\n\n\n<p>Thus, 10% of the code can run sequentially, but 90% of it can run in parallel.<\/p>\n\n\n\n<p>With <span class=\"wp-katex-eq\" data-display=\"false\"> p = 2 <\/span> processors&#8230;<\/p>\n\n\n\n<span class=\"wp-katex-eq\" data-display=\"false\">\\psi = \\displaystyle\\frac{1}{f + \\frac{(1-f)}{p}} =\\frac{1}{0.1 + \\frac{(1-0.1)}{2}} \\approx 6.66 <\/span>\n\n\n\n<p>Wow!<\/p>\n\n\n\n<p>That means that, with 2 processors, if 90% of the code is parallelized, we can speed up our program by 6.66x!<\/p>\n\n\n\n<p>Previously, with 2 processors and 50% parallelism, our speedup was only 1.33.<\/p>\n\n\n\n<p>With <strong>1000<\/strong> processors running parallel on 90% of our code, the maximum theoretical speedup is:<\/p>\n\n\n\n<span class=\"wp-katex-eq\" data-display=\"false\">\\psi =\\displaystyle \\frac{1}{f + \\frac{(1-f)}{p}} =\\frac{1}{0.1 + \\frac{(1-0.1)}{1000}} \\approx 9.99 <\/span>\n\n\n\n<p>As you can see, <\/p>\n\n\n\n<span class=\"wp-katex-eq\" data-display=\"false\"> \\displaystyle\\lim_{p\\to\\infty} \\psi = 10 <\/span>\n\n\n\n<h3 class=\"wp-block-heading\"><strong>Key Takeaways of Amdahal&#8217;s Law<\/strong><\/h3>\n\n\n\n<p>Thus, Amdahl&#8217;s Law teaches us that increasing the proportion of code that may be parallelized results in a higher maximum theoretical speedup than trying to cram more processors <span class=\"wp-katex-eq\" data-display=\"false\"> p <\/span>.<\/p>\n\n\n\n<p>In other words, making your program more parallel compatible is much better than trying to cram in more processors.<\/p>\n\n\n\n<p>Thanks for reading!<\/p>\n","protected":false},"excerpt":{"rendered":"<p>We&#8217;ve been learning about theoretical parallelism in my concepts of parallel and distributed systems class, and I found this concept of a maximum theoretical speedup to be fascinating. So, I decided to write an article on it. What is Amdahl&#8217;s Law? Any program can be divided into two parts: Restaurant Analogy Imagine you run a [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[13],"tags":[10],"class_list":["post-1065","post","type-post","status-publish","format-standard","hentry","category-computer-science","tag-computer-science"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v24.0 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Amdahl&#039;s Law and The Maximum Theoretical Speedup Achievable By Parallelism - Kushal Writes<\/title>\n<meta name=\"description\" content=\"We&#039;ve been learning about theoretical parallelism in my concepts of parallel and distributed systems class, and I learned about Amdahl&#039;s Law.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Amdahl&#039;s Law and The Maximum Theoretical Speedup Achievable By Parallelism - Kushal Writes\" \/>\n<meta property=\"og:description\" content=\"We&#039;ve been learning about theoretical parallelism in my concepts of parallel and distributed systems class, and I learned about Amdahl&#039;s Law.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/\" \/>\n<meta property=\"og:site_name\" content=\"Kushal Writes\" \/>\n<meta property=\"article:published_time\" content=\"2025-04-15T17:46:27+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-04-15T21:54:54+00:00\" \/>\n<meta name=\"author\" content=\"kushal\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"kushal\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"5 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/\"},\"author\":{\"name\":\"kushal\",\"@id\":\"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/9ae64ce30587c804d89b1eef21ba5d2f\"},\"headline\":\"Amdahl&#8217;s Law and The Maximum Theoretical Speedup Achievable By Parallelism\",\"datePublished\":\"2025-04-15T17:46:27+00:00\",\"dateModified\":\"2025-04-15T21:54:54+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/\"},\"wordCount\":1153,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/9ae64ce30587c804d89b1eef21ba5d2f\"},\"keywords\":[\"computer science\"],\"articleSection\":[\"Computer Science\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/\",\"url\":\"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/\",\"name\":\"Amdahl's Law and The Maximum Theoretical Speedup Achievable By Parallelism - Kushal Writes\",\"isPartOf\":{\"@id\":\"https:\/\/kushaltimsina.com\/blog\/#website\"},\"datePublished\":\"2025-04-15T17:46:27+00:00\",\"dateModified\":\"2025-04-15T21:54:54+00:00\",\"description\":\"We've been learning about theoretical parallelism in my concepts of parallel and distributed systems class, and I learned about Amdahl's Law.\",\"breadcrumb\":{\"@id\":\"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/kushaltimsina.com\/blog\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Amdahl&#8217;s Law and The Maximum Theoretical Speedup Achievable By Parallelism\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/kushaltimsina.com\/blog\/#website\",\"url\":\"https:\/\/kushaltimsina.com\/blog\/\",\"name\":\"Kushal Timsina\",\"description\":\"\",\"publisher\":{\"@id\":\"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/9ae64ce30587c804d89b1eef21ba5d2f\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/kushaltimsina.com\/blog\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/9ae64ce30587c804d89b1eef21ba5d2f\",\"name\":\"kushal\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/kushaltimsina.com\/blog\/wp-content\/uploads\/2024\/11\/tempImage75F1Sw-edited.jpg\",\"contentUrl\":\"https:\/\/kushaltimsina.com\/blog\/wp-content\/uploads\/2024\/11\/tempImage75F1Sw-edited.jpg\",\"width\":1274,\"height\":849,\"caption\":\"kushal\"},\"logo\":{\"@id\":\"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/image\/\"},\"description\":\"Kushal Timsina has been developing Roblox games since 2016, played 40,000,000+ times, teaches Roblox scripting on YouTube to 1,000,000+ views, and is the author of the Beginner's Guide to Roblox Scripting book.\",\"sameAs\":[\"https:\/\/kushaltimsina.com\/blog\"],\"url\":\"https:\/\/kushaltimsina.com\/blog\/author\/kushal\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Amdahl's Law and The Maximum Theoretical Speedup Achievable By Parallelism - Kushal Writes","description":"We've been learning about theoretical parallelism in my concepts of parallel and distributed systems class, and I learned about Amdahl's Law.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/","og_locale":"en_US","og_type":"article","og_title":"Amdahl's Law and The Maximum Theoretical Speedup Achievable By Parallelism - Kushal Writes","og_description":"We've been learning about theoretical parallelism in my concepts of parallel and distributed systems class, and I learned about Amdahl's Law.","og_url":"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/","og_site_name":"Kushal Writes","article_published_time":"2025-04-15T17:46:27+00:00","article_modified_time":"2025-04-15T21:54:54+00:00","author":"kushal","twitter_card":"summary_large_image","twitter_misc":{"Written by":"kushal","Est. reading time":"5 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/#article","isPartOf":{"@id":"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/"},"author":{"name":"kushal","@id":"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/9ae64ce30587c804d89b1eef21ba5d2f"},"headline":"Amdahl&#8217;s Law and The Maximum Theoretical Speedup Achievable By Parallelism","datePublished":"2025-04-15T17:46:27+00:00","dateModified":"2025-04-15T21:54:54+00:00","mainEntityOfPage":{"@id":"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/"},"wordCount":1153,"commentCount":0,"publisher":{"@id":"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/9ae64ce30587c804d89b1eef21ba5d2f"},"keywords":["computer science"],"articleSection":["Computer Science"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/","url":"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/","name":"Amdahl's Law and The Maximum Theoretical Speedup Achievable By Parallelism - Kushal Writes","isPartOf":{"@id":"https:\/\/kushaltimsina.com\/blog\/#website"},"datePublished":"2025-04-15T17:46:27+00:00","dateModified":"2025-04-15T21:54:54+00:00","description":"We've been learning about theoretical parallelism in my concepts of parallel and distributed systems class, and I learned about Amdahl's Law.","breadcrumb":{"@id":"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/kushaltimsina.com\/blog\/2025\/04\/15\/amdahls-law-and-the-maximum-theoretical-speedup-achievable-by-parallelism\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/kushaltimsina.com\/blog\/"},{"@type":"ListItem","position":2,"name":"Amdahl&#8217;s Law and The Maximum Theoretical Speedup Achievable By Parallelism"}]},{"@type":"WebSite","@id":"https:\/\/kushaltimsina.com\/blog\/#website","url":"https:\/\/kushaltimsina.com\/blog\/","name":"Kushal Timsina","description":"","publisher":{"@id":"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/9ae64ce30587c804d89b1eef21ba5d2f"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/kushaltimsina.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":["Person","Organization"],"@id":"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/9ae64ce30587c804d89b1eef21ba5d2f","name":"kushal","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/image\/","url":"https:\/\/kushaltimsina.com\/blog\/wp-content\/uploads\/2024\/11\/tempImage75F1Sw-edited.jpg","contentUrl":"https:\/\/kushaltimsina.com\/blog\/wp-content\/uploads\/2024\/11\/tempImage75F1Sw-edited.jpg","width":1274,"height":849,"caption":"kushal"},"logo":{"@id":"https:\/\/kushaltimsina.com\/blog\/#\/schema\/person\/image\/"},"description":"Kushal Timsina has been developing Roblox games since 2016, played 40,000,000+ times, teaches Roblox scripting on YouTube to 1,000,000+ views, and is the author of the Beginner's Guide to Roblox Scripting book.","sameAs":["https:\/\/kushaltimsina.com\/blog"],"url":"https:\/\/kushaltimsina.com\/blog\/author\/kushal\/"}]}},"_links":{"self":[{"href":"https:\/\/kushaltimsina.com\/blog\/wp-json\/wp\/v2\/posts\/1065","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kushaltimsina.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kushaltimsina.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kushaltimsina.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/kushaltimsina.com\/blog\/wp-json\/wp\/v2\/comments?post=1065"}],"version-history":[{"count":14,"href":"https:\/\/kushaltimsina.com\/blog\/wp-json\/wp\/v2\/posts\/1065\/revisions"}],"predecessor-version":[{"id":1079,"href":"https:\/\/kushaltimsina.com\/blog\/wp-json\/wp\/v2\/posts\/1065\/revisions\/1079"}],"wp:attachment":[{"href":"https:\/\/kushaltimsina.com\/blog\/wp-json\/wp\/v2\/media?parent=1065"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kushaltimsina.com\/blog\/wp-json\/wp\/v2\/categories?post=1065"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kushaltimsina.com\/blog\/wp-json\/wp\/v2\/tags?post=1065"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}