585 + (160 + 5)for slowest transactions *999 for the rest of the instructions!
On Tue, Sep 27, 2011 at 12:49 AM, Gene <[email protected]> wrote: > You guys have the right idea except that since it's multiple choice > you can do this with no math. With 1000 data items and only 4 stages, > the bottleneck has to be the slowest pipeline stage with its register > delay. So you can answer b in 10 seconds and move on to the next > question! > > On Sep 26, 8:50 pm, Dumanshu <[email protected]> wrote: > > @bharat: > > for the second part where u multiplied (160+5) with 999, it should be > > 160*999 because it is max of (150,120,160,140,5). Correct me if i am > > wrong. > > > > On Sep 26, 4:02 pm, bharatkumar bagana <[email protected]> > > wrote: > > > > > > > > > for the first instruction : 150+5+120+5+160+5+140=585 ns > > > for the rest of the instructions , though pipeline---- > > > max(150,120,160,140)=160 > > > > > (160+5)*999=164835 ns > > > we assume that there will be no extra stalls existed in our system > > > ---------585 + 164835 =165420 ns =165.4 us... > > > correct me if I'm wrong ......... > > > > > On Sun, Sep 25, 2011 at 9:25 AM, siva viknesh <[email protected] > >wrote: > > > > > > A 4-stage pipeline has the stage delays as 150, 120, 160 and 140 ns > > > > (nano seconds) > > > > respectively. Registers that are used between the stages have a delay > > > > of 5 ns each. Assuming > > > > constant clocking rate, the total time taken to process 1000 data > > > > items on this pipeline will > > > > approximately be > > > > a. 120 us (micro seconds) > > > > b. 165 us > > > > c. 180 us > > > > d. 175 us > > > > > > ...plz give detailed explanation for the ans > > > > > > -- > > > > You received this message because you are subscribed to the Google > Groups > > > > "Algorithm Geeks" group. > > > > To post to this group, send email to [email protected]. > > > > To unsubscribe from this group, send email to > > > > [email protected]. > > > > For more options, visit this group at > > > >http://groups.google.com/group/algogeeks?hl=en. > > > > > -- > > > > > **Regards > > > *BharatKumar Bagana* > > > **http://www.google.com/profiles/bagana.bharatkumar< > http://www.google.com/profiles/bagana.bharatkumar> > > > * > > > Mobile +91 8056127652* > > > <[email protected]>- Hide quoted text - > > > > - Show quoted text - > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
