Computer architecture
Q1- Little endian machine N1= 0xA123 Big Indian machine N2=0x1234 Add N1 and N2 in the big Indian machine, and tell the result to the little-endian machine Q2: what is (are) the stages of pipelining? Q3: what is (are) 1- The hazard types in pipelining 2- The method(s) that is (are) used to solve hazard problem(s) in pipelining Q4: a machine that is running a program of 5 instructions, use a 5-stage pipelining to calculate the time needed to run this program. Assume the machine uses a CPU of 1 GHz.
Computer architecture
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am