Amdahl's law and speedup in concurrent and parallel processing explained with example

preview_player
Показать описание
#Amdahl's #law #concurrent #parallel #processing #speedup #explained #with #example #karanjetlilive #it #lectures#programming
Рекомендации по теме
Комментарии
Автор

Thanks a lot Karen. While reading books it's always confusing, you've narrated the basics very well, great.

viji
Автор

Thank you Sir that was so clear! Just a small mistake in 10:15 T= s + p/n instead of T=(s+p)/n! Thank you

aybrl
Автор

Consider me wildly impressed ^^
I've seen few share of videos, but yours wins !!
Tbh, I was so immersed I didn't even realize it was 20min long haha. Looking forward for more.
Respect :)

ramitb
Автор

This video really clear for Amdahl's law. I'm really Big Thank you for your explained.

warispark
Автор

excellent explanation of the concept. understood what is amdahls law used for only after seeing your video. thank you !!!

satheeshsengottaiyan
Автор

I can't believe how simple you've made this seem! I have a test in two weeks and could not understand Amdahl's law from my professor's lectures, but you made it seem so easy to understand. I cannot thank you enough <3

Acodeful
Автор

Thank you for the video! It was very helpful I subscribed! Though I am confused how you just substituted S = (1 - P) into T(n), since T(n) is equal to (S + P)/n. Why did it become T(n) = (1 - P) + P/n instead of (1 - P)/n + P/n. For the last example shouldn't serial be .01.

maryliu
Автор

Thank you. This was a better explanation than my German university gives me.

marcot.
Автор

You have explained very well. Thank you very much! You are the best. This video alone is enough.

DaddyMi
Автор

Loved the lecture simple and straight to the point 😊

vernon
Автор

Thank you so much for this informative video!!!

hectorium
Автор

THANKS KARAN JI .IT WILL VERY HELPFULL FOR ME AS A PROFESSOR

subhashchintalapudi
Автор

God Bless you sir. This was really well explained and very useful.

crabjuice
Автор

when we substitute (1-p for s) shouldn't we divided both parties over(n) because there is a plus sign between them not a multiplication sign, why we only divided p over n, thanks.

ishraq
Автор

Thanks To my teacher. And with my best wishes.

fatmaoushah
Автор

Love you Karan jetli, I feel like paying thousands in University to learn is just a waste of time money and resources, you are amazing

bitcoinwala
Автор

Many thanks for putting it plainly! I understood the concepts, as parallelizable code is sped up via throwing hardware at it and serial code is sped up via improved algorithms, but my book describes "n" (number of processors) in the least intuitive way possible. It was so poorly written that I didn't know that "n" simply referred to number of processors...

Thank you very much! God Bless

johnfouts
Автор

You are amazing. Very good video, helped me clear up a lot of misunderstanding.

bicboi
Автор

Tq so much sir😇this topic is my seminar portion✨i fully understand this vidoe👍🏻you'r the best sir💙

angelm
Автор

Very good explanation in a very easy way. Just a little improvement. Time for n processors should be s+p/n

mrsajidhussain