Recent questions tagged amdahls-law / GATE Overflow for GATE CSE

0 votes

0 answers

1

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}$ ' processors is given by : $\mathrm{S} \leq \mathrm{f}+(1-\mathrm{f}) / \mathrm{p}$ ... $\mathrm{S} \leq 1 /[1-\mathrm{f}+\mathrm{f} / \mathrm{p}]$

Amdahl's law states that the maximum speedup $\text{S}$ achievable by a parallel computer with ' $\mathrm{p}$ ' processors is given by :$\mathrm{S} \leq \mathrm{f}+(1-\ma...

admin

103 views

admin asked Jan 6

0 votes

1 answer

2

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 make MY program 5 time...

Sara86568

1.0k views

Sara86568 asked Jun 21, 2022

0 votes

2 answers

3

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 the maximum speed-up that can be achieved by using $N$ ... $\dfrac{1}{(1-P)+\frac{P}{N}} \\$ $\dfrac{1}{P+\frac{(1-P)}{N}}$

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 para...

go_editor

3.8k views

go_editor asked Jul 31, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true