Professor Mikka Singh of Harvard University has proposed a new atomic instruction named “Gurru”. The atomic instruction will work exactly like Semaphores except it will take 2 clock cycles to execute. He proposed that a on a multi-processor environment while the instruction Gurru will be executing on any one of the processor then all the other processors shall be halted. However, the Operating System Lab Engineers at Harvard are still confused about whether the newly proposed instruction will work or not. What are your thoughts?

Professor Mikka Singh of Harvard University has proposed a new atomic instruction named “Gurru”. The atomic instruction will work exactly like Semaphores except it will take 2 clock cycles to execute. He proposed that a on a multi-processor environment while the instruction Gurru will be executing on any one of the processor then all the other processors shall be halted. However, the Operating System Lab Engineers at Harvard are still confused about whether the newly proposed instruction will work or not. What are your thoughts?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 10RQ: How does pipelining improve CPU efficiency? What’s the potential effect on pipelining’s efficiency...

See similar textbooks

Similar questions

Processor R is a 64-bit RISC processor with a 2 GHz clock rate. The average instruction requires one cycle to complete, assuming zero wait state memory accesses. Processor C is a CISC processor with a 1.8 GHz clock rate. The average simple instruction requires one cycle to complete, assuming zero wait state memory accesses. The average complex instruction requires two cycles to complete, assuming zero wait state memory accesses. Processor R can’t directly implement the complex processing instructions of Processor C. Executing an equivalent set of simple instructions requires an average of three cycles to complete, assuming zero wait state memory accesses. Program S contains nothing but simple instructions. Program C executes 70% simple instructions and 30% complex instructions. Which processor will execute program S more quickly? Which processor will execute program C more quickly? At what percentage of complex instructions will the performance of the two processors be equal?
If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the fetch cycle is 40% of the processor cycle time, what memory access speed is required to implement load operations with zero wait states and load operations with two wait states?
Q2: CPU Organization Consider the following Accumulator-based CPU instructions: LOAD D ; Acc  D (Load ACC with D) MUL E ; Acc  Acc * E ADD C ; Acc  Acc + C STORE R1 ; R1  Acc (Store Acc to R1) LOAD A ; Acc  A SUB B ; Acc  Acc-B DIV R1 ; Acc  Acc / R1 What is the equation that the above instructions evaluate? Write the equation. Write Stack-based CPU instructions to evaluate that equation. Write General Register-based CPU instructions (two-address instructions) to evaluate the equation.
hi can u anwser this qustion plesc ? Consider a Computer which has a memory which is capable of storing 4096 K words and each word in memory can be of size 32 bits. The computer supports a total of “K” addressing modes, and it has “M” computer registers. The computer supports instructions, where each instruction consists of following fields: Mode Operation code Register Register Memory AddressGiven that each instruction will be stored in one memory word, discuss with a suitable diagram the format of instruction by specifying number of bits for each field of instruction. Discuss each field of instruction.Note: Choose your own values for K (number of addressing modes) and M (number of Registers) k=8 m=50
10. Q1 : What is an atomic instruction? Show that if the wait operation is not executed atomically, then mutual exclusion may be violated Q2: What is spinlock? Discuss the advantage and disadvantage of using spinlock. Why do you think Solaris, Linux, and Windows 2000 use spinlocks as a synchronization mechanism only on multiprocessor systems and not on single- processor systems?
a) Suppose two threads T1 and T2 are running concurrently in the same process with a single CPU. Suppose T1 does “Load X into register R1” machine instruction. Then the CPU scheduler switches the CPU to T2. Will T2 see the same vaue of R1 as loaded here by T1? (YES or NO)? Explain in less than 50 words. Be specific. (b) Suppose two threads T1 and T2 are running concurrently in the same process with a single CPU. Is it possible to have a moment (time instant) where both threads have made a request to Memory Unit to read some data (ex. as part of a “Load … into register …” instruction) and Memory Unit has not yet completed either of these two requests? Explain in less than 50 words.
Consider the following three CPU organizations:CPU SS: A 2-core superscalar microprocessor that provides out-of-order issue capabilities on 2 function units (FUs). Only a single thread can run on each core at a time.CPU MT: A fi ne-grained multithreaded processor that allows instructions from 2 threads to be run concurrently (i.e., there are two functional units), though only instructions from a single thread can be issued on any cycle. CPU SMT: An SMT processor that allows instructions from 2 threads to be run concurrently (i.e., there are two functional units), and instructions from either or both threads can be issued to run on any cycle. Assume we have two threads X and Y to run on these CPUs that include the following operations: Thread X Thread Y A1 – takes 3 cycles to executeA2 – no dependences A3 – conflicts for a functional unit with A1A4 – depends on the result of A3 B1 – take 2 cycles to executeB2 – confl icts for a functional unit with B1B3 – depends on the result of…
We want to build a word organized main memory of 8 GB for a 32-bit CPU architecture composed of word organized memory modules of 30-bit address and 8-bit data buses each. a) Draw the interface of the main memory by clearly indicating the widths of the buses. b) Howmanymemorymoduleswouldbenecessarytobuildthememorysystem? c) Design the main memory internal organization built out of the above memory modules (use multiplexers and/or decoders as needed) by clearly indicating the widths of the used busses d) CanweusethismemorysystemasRAMfortheCPUinProblem1?Explainyouranswer.
Discuss the concept of dynamic instruction scheduling in superscalar processors. How does it impact instruction execution?
Q 1. Answer the following short questions. Support your answers with diagram, where needed: How the LIFO memory differs to FIFO Memory. Which type of addressing mode is used by the Instruction: ADD [BX+2], AX? What is the equivalent of a Binary number: 00110100011012 in octal and hexa-decimal. How much memory space is addressable (in bytes) by a microprocessor, if it uses 36 address lines? If Base address = A000H, Physical address = A0345H, then the offset add = ___________? Why address bus is unidirectional and data bus is bidirectional in 8086?
1) Which of the following best explains why machine instruction is written in binary code? a. Machine instruction are written in binary code because computers can only understand non sequential set of instructions which can easily be translated using binary number b. Machine instruction are written in binary code to execute sequence faster by telling the computer what instruction to perform if machine state is "1" and what instruction to neglect if machine state is "0" c. Machine instruction are written in binary sequence so that it can easily be understood by operating system whereby if machine state is "1" it means not to perform instruction while if machine state is "0" it means to execute instruction d. Machine instruction are written in binary because humans cannot understand binary number thereby protecting its content from hacking 2) Which of the following best describe the difference of information system and information technology? a. Information…
Discuss the challenges and benefits of implementing a speculative execution pipeline in modern processors. How does it impact the performance and security of a CPU architecture?