Recent questions tagged data-dependences

0 votes

1 answer

1

Data Hazards
Find the data hazards(RAW,WAW,WAR) in the given instructions

asked Nov 17 in CO & Architecture by Vishnathan (343 points) | 28 views

0 votes

1 answer

2

Sum of Data dependencies
$I_1 : MUL \ \ \ \ \ R_1, R_2, R_3$ // $R_1 \leftarrow R_2 \times R_3$ $I_2 : ADD \ \ \ \ \ R_4, R_4, R_1$ $I_3 : MUL \ \ \ \ \ R_1, R_5, R_6$ $I_2 : SUB \ \ \ \ \ R_4, R_4, R_1$ Sum of RAW, WAR and WAW dependencies is _____.

asked Oct 23 in CO & Architecture by Mk Utkarsh Boss (29.6k points) | 41 views

0 votes

1 answer

3

Pipeline : Number of RAW dependencies
Consider the below instructions executed on a 5 stage(IF,ID,EX,MA,WB) RISC pipeline with operand forwarding. I1: ADD R0,R1,R2 (R0=R1+R2) I2: SUB R3,R0,R2 I3:MUL R4,R3,R0 I4:DIV R5,R4,R0 How many RAW dependencies?

asked Oct 23 in CO & Architecture by Mk Utkarsh Boss (29.6k points) | 110 views

0 votes

1 answer

4

Data dependancies
Anti- dependency will not ALWAYS create stall because we can use register renaming to remove stall. Please confirm below statement: Anti-dependency MAY create stall (True/False)

asked Sep 23 in CO & Architecture by Suneel Padala (107 points) | 13 views

+2 votes

1 answer

5

COA: Number of RAW hazards
Consider the following Instruction sequence I1: ADD R1,R2,R1 I2: LW R2,0(R1) I3: LW R1,4(R1) I4: OR R3,R1,R2 And assume following five stage pipeline with following stages: IF,ID,EXE,MEM,WB The no of RAW hazards in the above Instruction sequence is? (A) 3 (B) 2 (C) 4 (D) 1 Note:- I think there are 2 RAW hazards, b/w I1 & I2 and I3&I4.

asked Jan 20 in CO & Architecture by Vijay Thakur Boss (17.2k points) | 174 views

0 votes

0 answers

6

RAW, WAR, WAW hazards
J1: R1 = 100 J2: R1 = R2 + R4 J3: R2 = R4 + 25 J4: R4 = R1 + R3 J5: R1 = R1 + 30 Give the no of RAW, WAR and WAW hazards

asked Dec 3, 2017 in CO & Architecture by Tuhin Dutta Loyal (8.4k points) | 267 views

+2 votes

1 answer

7

WAR amd WAW dependency
R4 <- R1 + R4 R4 <- R2 + R4 R4 <- R3 + R5 Number of WAR and WAW dependencies?

asked Nov 4, 2017 in CO & Architecture by Rajesh R Active (1.6k points) | 96 views

0 votes

0 answers

8

Database #1NF
R(ABCDE) { A,BC,CD} are candidate key of relation R after 1 NF design which one is possible multi valued attributes before 1 NF design ???

asked Oct 27, 2017 in Databases by air1ankit Active (4.1k points) | 77 views

+3 votes

1 answer

9

Number of WAR
Number of WAR dependencies possible R1 <- R3 + R2 R3 <- R3 + R5 R3 <- R2 + R3 Is it 2 or 3?

asked Oct 26, 2017 in CO & Architecture by Rajesh R Active (1.6k points) | 77 views

0 votes

1 answer

10

Database
1- R(ABCD) FD'S ARE {AB->C ,C->D,D->EA ,DE->F,EF->B} 2-R(ABCD) FDS ARE { A->BC, CD->E, B->D,E-A} 3- R(ABCD) {AB-> CD,C->B,D->C} Find the candidate key ??? For above questions and please explain too.

asked Oct 17, 2017 in Databases by air1ankit Active (4.1k points) | 81 views

0 votes

0 answers

11

Calculate sum of (WAR, RAW and WAW) dependencies instructions.

asked Sep 28, 2017 in CO & Architecture by sunil sarode Active (1.4k points) | 268 views

+1 vote

0 answers

12

Random
If asked to count the number of RAW dependencies, do we consider only adjacent instructions or both adjacent and non-adjacent? Please explain in detail.

asked Sep 28, 2017 in CO & Architecture by Warlock lord Active (3.4k points) | 29 views

+1 vote

1 answer

13

database
For relation R=(L, M, N, O, P), the following dependencies hold: M→O, NO→P, P→Land L→MN R is decomposed into R1 = (L, M, N, P) and R2 = (M, O).What is the highest normal form satisfied by the above decomposition? My doubt is For R1 it is in 2NF and R2 it is in BCNF .But ,dependency preserving also violates .So whts the highest normal form ?

asked Jul 25, 2017 in Databases by set2018 Loyal (8.2k points) | 104 views

0 votes

1 answer

14

no of raw dependencies

asked Jan 19, 2017 in CO & Architecture by vaishali jhalani Loyal (5.9k points) | 108 views

0 votes

1 answer

15

ace database test series
Answer given is 4 tables: (Employee), (Monitors), (Project, Sponsors) and (Department). Is this answer right?

asked Nov 24, 2016 in Databases by Purple Active (3.5k points) | 83 views

+14 votes

3 answers

16

pipeline_hazard
no of RAW,WAR and WAW ?

asked Nov 23, 2016 in CO & Architecture by Debashish Deka Veteran (57.6k points) | 2.8k views

+1 vote

0 answers

17

Why there is no RAW conflict in follwing code ? Explain

asked Jan 20, 2016 in CO & Architecture by pC Boss (22.5k points) | 186 views

+1 vote

1 answer

18

pipelining - without operand forwarding

asked Dec 24, 2015 in CO & Architecture by Himanshu1 Boss (15.7k points) | 508 views

+4 votes

7 answers

19

number of WAR dependencies

asked Dec 8, 2015 in CO & Architecture by Deepak Sharma 1 (167 points) | 1.4k views

+2 votes

1 answer

20

RAW dependencies
ADD R1 , R2, R2; ADD R3, R2, R1; SUB R4, R1 , R5; ADD R3, R3, R4; FIND THE NUMBER OF READ AFTER WRITE(RAW) DEPENDENCIES IN THE ABOVE CODE.

asked Sep 27, 2015 in CO & Architecture by Umang Raman Boss (16.1k points) | 426 views

+1 vote

1 answer

21

In Operand Forwarding technique how does the next instruction is able to access the dependent operand which is calculated in the previous instruction in the same Cpu Cycle?

asked Apr 3, 2015 in CO & Architecture by Anurag_s Loyal (8.1k points) | 725 views

+26 votes

2 answers

22

GATE2015-3-47
Consider the following code sequence having five instructions from $I_1 \text{ to } I_5$ ... above statements is/are correct? Only S1 is true Only S2 is true Only S1 and S3 are true Only S2 and S3 are true

asked Feb 16, 2015 in CO & Architecture by jothee Veteran (112k points) | 3.2k views

+1 vote

1 answer

23

how many (RAW,WAR,WAW) dependencies exists in the following set of instruction R1<-R2+R3 R3<-R1-R2 R4<-R1+R3 R1<-R1*R3

asked Jan 26, 2015 in CO & Architecture by gate2015 (149 points) | 686 views

+16 votes

1 answer

24

GATE2007-IT-39
Data forwarding techniques can be used to speed up the operation in presence of data dependencies. Consider the following replacements of LHS with RHS. $R1→ Loc, Loc→ R2 \quad ≡ R1→ R2, R1 → Loc$ $R1→ Loc, Loc→ R2 \quad ≡ R1→ R2$ ... the RHS be the same as executing the LHS irrespective of the instructions that follow ? i and iii i and iv ii and iii ii and iv

asked Oct 30, 2014 in CO & Architecture by Ishrat Jahan Boss (19.1k points) | 1.6k views

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

Recent questions tagged data-dependences

Recent Posts

Recent Blog Comments