Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Notes > Computer Architecture & Organisation (CAO) > Amdahl’s Law & Its Proof
Amdahl’s Law & Its Proof | Computer Architecture & Organisation (CAO) - Computer Science Engineering (CSE) PDF Download
Introduction
It is named after computer scientist Gene Amdahl( a computer architect from IBM and Amdahl corporation), and was presented at the AFIPS Spring Joint Computer Conference in 1967. It is also known as Amdahl’s argument. It is a formula which gives the theoretical speedup in latency of the execution of a task at a fixed workload that can be expected of a system whose resources are improved. In other words, it is a formula used to find the maximum improvement possible by just improving a particular part of a system. It is often used in parallel computing to predict the theoretical speedup when using multiple processors.
Speedup
Speedup is defined as the ratio of performance for the entire task using the enhancement and performance for the entire task without using the enhancement or speedup can be defined as the ratio of execution time for the entire task without using the enhancement and execution time for the entire task using the enhancement.
If Pe is the performance for entire task using the enhancement when possible, Pw is the performance for entire task without using the enhancement, Ew is the execution time for entire task without using the enhancement and Ee is the execution time for entire task using the enhancement when possible then,
Speedup = Pe/Pw
or
Speedup = Ew/Ee
Amdahl’s law uses two factors to find speedup from some enhancement –
- Fraction enhanced: The fraction of the computation time in the original computer that can be converted to take advantage of the enhancement. For example- if 10 seconds of the execution time of a program that takes 40 seconds in total can use an enhancement , the fraction is 10/40. This obtained value is Fraction Enhanced.
Fraction enhanced is always less than 1. - Speedup enhanced: The improvement gained by the enhanced execution mode; that is, how much faster the task would run if the enhanced mode were used for the entire program. For example – If the enhanced mode takes, say 3 seconds for a portion of the program, while it is 6 seconds in the original mode, the improvement is 6/3. This value is Speedup enhanced.
Speedup Enhanced is always greater than 1.
The overall Speedup is the ratio of the execution time:-
Proof:
Let Speedup be S, old execution time be T, new execution time be T’ , execution time that is taken by portion A(that will be enhanced) is t, execution time that is taken by portion A(after enhancing) is t’, execution time that is taken by portion that won’t be enhanced is tn, Fraction enhanced is f’, Speedup enhanced is S’.
Now from the above equation,
Overall Speedup = 1/(1- Fraction Enhanced+(Fraction Enhanced/Speedup Enhanced))
Hence proved.
The document Amdahl’s Law & Its Proof | Computer Architecture & Organisation (CAO) - Computer Science Engineering (CSE) is a part of the Computer Science Engineering (CSE) Course Computer Architecture & Organisation (CAO).
All you need of Computer Science Engineering (CSE) at this link: Computer Science Engineering (CSE)
|
20 videos|86 docs|48 tests
|
FAQs on Amdahl’s Law & Its Proof - Computer Architecture & Organisation (CAO) - Computer Science Engineering (CSE)
| 1. What is Amdahl's Law and how is it relevant to Computer Science Engineering (CSE)? |  |
Amdahl's Law is a formula that calculates the potential speedup of a computer system when only a portion of it is improved. It is relevant to CSE as it helps in analyzing the performance improvement that can be achieved by optimizing specific parts of a system while considering the overall impact.
| 2. How does Amdahl's Law relate to parallel computing? | |
Amdahl's Law is often used in parallel computing to estimate the potential speedup when executing a program on multiple processors. It helps in understanding the impact of parallelizing different parts of a computation and provides insights into the maximum achievable speedup.
| 3. Can you provide a simple proof of Amdahl's Law? | |
Sure! Let's consider a system where a fraction 'f' of the computation is improved 's' times faster, while the remaining fraction '1-f' remains unchanged. The overall speedup can be calculated using Amdahl's Law as follows:
Speedup = 1 / [(1-f) + (f/s)]
This formula represents the maximum achievable speedup when optimizing only a portion of the system.
| 4. How can Amdahl's Law be applied in real-world scenarios? | |
Amdahl's Law can be applied in various real-world scenarios, such as optimizing software applications, improving the performance of computer architecture, or analyzing the impact of parallelization in distributed systems. It helps in making informed decisions about resource allocation and identifying bottlenecks that limit overall performance.
| 5. What are the limitations of Amdahl's Law? | |
Amdahl's Law assumes that the portion of the computation being improved remains fixed, which may not always be the case in dynamic systems. It also assumes that the improvement in the optimized portion scales linearly with the speedup factor, which may not hold true for all scenarios. Additionally, it does not consider other factors like communication overhead or parallelization efficiency, which can significantly impact real-world performance.
Related Exams
About this Document
|
4.71/5 Rating |
|
Dec 31, 2024 Last updated |
Document Description: Amdahl’s Law & Its Proof for Computer Science Engineering (CSE) 2024 is part of Computer Architecture & Organisation (CAO) preparation.
The notes and questions for Amdahl’s Law & Its Proof have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Amdahl’s Law & Its Proof covers topics
like and Amdahl’s Law & Its Proof Example, for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises and tests below for Amdahl’s Law & Its Proof.
Introduction of Amdahl’s Law & Its Proof in English is available as part of our Computer Architecture & Organisation (CAO)
for Computer Science Engineering (CSE) & Amdahl’s Law & Its Proof in Hindi for Computer Architecture & Organisation (CAO) course.
Download more important topics related with notes, lectures and mock test series for Computer Science Engineering (CSE)
Exam by signing up for free. Computer Science Engineering (CSE): Amdahl’s Law & Its Proof | Computer Architecture & Organisation (CAO) - Computer Science Engineering (CSE)
Description
Full syllabus notes, lecture & questions for Amdahl’s Law & Its Proof | Computer Architecture & Organisation (CAO) - Computer Science Engineering (CSE) - Computer Science Engineering (CSE) | Plus excerises question with solution to help you revise complete syllabus for Computer Architecture & Organisation (CAO) | Best notes, free PDF download
Information about Amdahl’s Law & Its Proof
In this doc you can find the meaning of Amdahl’s Law & Its Proof defined & explained in the simplest way possible. Besides explaining types of
Amdahl’s Law & Its Proof theory, EduRev gives you an ample number of questions to practice Amdahl’s Law & Its Proof tests, examples and also practice Computer Science Engineering (CSE)
tests
|
20 videos|86 docs|48 tests
|
Download as PDF
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
Related Searches
mock tests for examination
,Sample Paper
,ppt
,Semester Notes
,Summary
,practice quizzes
,Exam
,Amdahl’s Law & Its Proof | Computer Architecture & Organisation (CAO) - Computer Science Engineering (CSE)
,Amdahl’s Law & Its Proof | Computer Architecture & Organisation (CAO) - Computer Science Engineering (CSE)
,Previous Year Questions with Solutions
,Important questions
,Amdahl’s Law & Its Proof | Computer Architecture & Organisation (CAO) - Computer Science Engineering (CSE)
,past year papers
,study material
,MCQs
,Extra Questions
,video lectures
,Viva Questions
,shortcuts and tricks
,Free
,Objective type Questions
;
Additional Information about Amdahl’s Law & Its Proof for Computer Science Engineering (CSE) Preparation
Amdahl’s Law & Its Proof Free PDF Download
The Amdahl’s Law & Its Proof is an invaluable resource that delves deep into the core of the Computer Science Engineering (CSE) exam.
These study notes are curated by experts and cover all the essential topics and concepts, making your preparation more efficient and effective.
With the help of these notes, you can grasp complex subjects quickly, revise important points easily,
and reinforce your understanding of key concepts. The study notes are presented in a concise and easy-to-understand manner,
allowing you to optimize your learning process. Whether you're looking for best-recommended books, sample papers, study material,
or toppers' notes, this PDF has got you covered. Download the Amdahl’s Law & Its Proof now and kickstart your journey towards success in the Computer Science Engineering (CSE) exam.
Importance of Amdahl’s Law & Its Proof
The importance of Amdahl’s Law & Its Proof cannot be overstated, especially for Computer Science Engineering (CSE) aspirants.
This document holds the key to success in the Computer Science Engineering (CSE) exam.
It offers a detailed understanding of the concept, providing invaluable insights into the topic.
By knowing the concepts well in advance, students can plan their preparation effectively.
Utilize this indispensable guide for a well-rounded preparation and achieve your desired results.
Amdahl’s Law & Its Proof Notes
Amdahl’s Law & Its Proof Notes offer in-depth insights into the specific topic to help you master it with ease.
This comprehensive document covers all aspects related to Amdahl’s Law & Its Proof.
It includes detailed information about the exam syllabus, recommended books, and study materials for a well-rounded preparation.
Practice papers and question papers enable you to assess your progress effectively.
Additionally, the paper analysis provides valuable tips for tackling the exam strategically.
Access to Toppers' notes gives you an edge in understanding complex concepts.
Whether you're a beginner or aiming for advanced proficiency, Amdahl’s Law & Its Proof Notes on EduRev are your ultimate resource for success.
Amdahl’s Law & Its Proof Computer Science Engineering (CSE) Questions
The "Amdahl’s Law & Its Proof Computer Science Engineering (CSE) Questions" guide is a valuable resource for all aspiring students preparing for the
Computer Science Engineering (CSE) exam. It focuses on providing a wide range of practice questions to help students gauge
their understanding of the exam topics. These questions cover the entire syllabus, ensuring comprehensive preparation.
The guide includes previous years' question papers for students to familiarize themselves with the exam's format and difficulty level.
Additionally, it offers subject-specific question banks, allowing students to focus on weak areas and improve their performance.
Study Amdahl’s Law & Its Proof on the App
Students of Computer Science Engineering (CSE) can study Amdahl’s Law & Its Proof alongwith tests & analysis from the EduRev app,
which will help them while preparing for their exam. Apart from the Amdahl’s Law & Its Proof,
students can also utilize the EduRev App for other study materials such as previous year question papers, syllabus, important questions, etc.
The EduRev App will make your learning easier as you can access it from anywhere you want.
The content of Amdahl’s Law & Its Proof is prepared as per the latest Computer Science Engineering (CSE) syllabus.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup