The processor in Q1 above is converted into an 8-stage pipeline, similar to the one discussed on slide 8 of lecture 16. It takes
125 ps to navigate the circuits in each stage. Assume that latches do not introduce a noticeable delay overhead.1. What is the clock speed of this processor? 2. What is the CPI of this processor, assuming that every load/store instruction finds its instruction/data in the instruction or data cache, and there are no stalls from data/control/structural hazards? 3. What is the throughput of this processor (in billion instructions per second)?
All the stages take 125ps and latch time was outlooked.
The clock speed would be the highest stage time in all 5 stages. Here all are same clock speed it would be 125ps only.
throughput = 1/cycle time so ⇒ 1/125 instructions/ps
Since we want it in billion instructions per second so we have to multiply with 10⁻⁹ /10⁻¹² then the result is 1000/125 billion instructions per second.
Like classes in Object oriented programming Object-Oriented DBMS is can store objects.It follows an Object oriented data model with the properties of classes and the properties of Object oriented programming also.Objects can be in the form of complex data types or different data types.
