Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged amdahls-law
153
views
1
answers
0
votes
UGC NET CSE | June 2008 | Part 2 | Question: 46
Amdahl's law states that the maximum speedup $\text{S}$ achievable by a parallel computer with ' $\mathrm{p}$ ... }]$\mathrm{S} \leq 1 /[1-\mathrm{f}+\mathrm{f} / \mathrm{p}]$
admin
153
views
admin
asked
Jan 6
CO and Architecture
ugcnetcse-june2008-paper2
co-and-architecture
amdahls-law
speedup
+
–
1.1k
views
1
answers
0
votes
Program runs in 100s . Multiplies 80 % of program . Designer M can improve speedup of multiply operations . Now , I am a user and I need to make MY program 5 times faster . How much speedup of multiply instructions should M achieve to allow me to reach my overall speedup goal ?
The program runs in 100s. Multiplies 80 % of the program. Designer M can improve the speedup of multiply operations. Now, I am a user and I need to ... of multiply instructions should M achieve to allow me to reach my overall speedup goal?
Sara86568
1.1k
views
Sara86568
asked
Jun 21, 2022
CO and Architecture
co-and-architecture
amdahls-law
speedup
+
–
3.9k
views
2
answers
0
votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 46
In the case of parallelization, Amdahl's law states that if $P$ is the proportion of a program that can be made parallel and $(1-P)$ is the proportion that cannot be parallelized, then ... P)+\frac{P}{N}} \\$\dfrac{1}{P+\frac{(1-P)}{N}}$
go_editor
3.9k
views
go_editor
asked
Jul 31, 2016
CO and Architecture
ugcnetcse-june2015-paper2
parallel-processing
amdahls-law
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register