good question.. With regards,
Praveen Raj DCE-IT 3rd yr 9999735993 praveen0...@gmail.com On Tue, Sep 27, 2011 at 6:40 AM, Kunal Patil <kp101...@gmail.com> wrote: > Nice question & nice answer... :) > > > On Tue, Sep 27, 2011 at 6:25 AM, UTKARSH SRIVASTAV < > usrivastav...@gmail.com> wrote: > >> what's the algo of this question >> >> >> On Mon, Sep 26, 2011 at 2:38 PM, vikas <vikas.rastogi2...@gmail.com>wrote: >> >>> simple graph question, >>> graph is given as list , just check the dependancy >>> >>> On Sep 25, 6:25 pm, siva viknesh <sivavikne...@gmail.com> wrote: >>> > thanks a lot yogesh... >>> > >>> > On Sep 25, 2:23 pm, Yogesh Yadav <medu...@gmail.com> wrote: >>> > >>> > > T1->T2->T3->T6 >>> > > T1->T2->T4->T7 >>> > > T1->T2->T5->T8 >>> > >>> > > 2 Processor: >>> > > (T1->T2) ......2 TS >>> > > (T3&T4).......1 TS >>> > > (T6&T5).......1 TS >>> > > (T7&T8).......1 TS >>> > >>> > > 4 Processor >>> > > (T1->T2) ......2 TS >>> > > (T3&T4&T5).......1 TS >>> > > (T6&T7&T8).......1 TS >>> > >>> > > ..... >>> > > On Sun, Sep 25, 2011 at 2:33 PM, siva viknesh < >>> sivavikne...@gmail.com>wrote: >>> > >>> > > > plz give detailed explanation >>> > >>> > > > On Sep 25, 1:58 pm, siva viknesh <sivavikne...@gmail.com> wrote: >>> > > > > can u plz giv the sequence >>> > >>> > > > > On Sep 25, 11:36 am, Sanjay Rajpal <srn...@gmail.com> wrote: >>> > >>> > > > > > yah rite answer would be 5 and 4 resp. >>> > > > > > Sanju >>> > > > > > :) >>> > >>> > > > > > On Sat, Sep 24, 2011 at 10:04 PM, Dheeraj Sharma < >>> > >>> > > > > > dheerajsharma1...@gmail.com> wrote: >>> > > > > > > 5 & 4? >>> > >>> > > > > > > On Sun, Sep 25, 2011 at 9:33 AM, sivaviknesh s < >>> > > > sivavikne...@gmail.com>wrote: >>> > >>> > > > > > >> A parallel program consists of 8 tasks – T1 through T8. Each >>> task >>> > > > requires >>> > > > > > >> one time step to be executed on a single processor. Let X -> >>> Y >>> > > > denote the >>> > > > > > >> fact that task X must be executed before task Y is executed. >>> Suppose >>> > > > only >>> > > > > > >> the tasks X, Y are to be executed. On any multiprocessor >>> machine it >>> > > > would >>> > > > > > >> require at least 2 time steps since in the first step X >>> could be >>> > > > executed, >>> > > > > > >> and Y could be executed in the next time step (since it >>> requires X >>> > > > to >>> > > > > > >> complete first). Now, suppose the following dependencies >>> exist >>> > > > between the >>> > > > > > >> tasks T1 – T8: >>> > >>> > > > > > >> T1 -> T2 >>> > >>> > > > > > >> T2 -> T3 >>> > >>> > > > > > >> T3 -> T6 >>> > >>> > > > > > >> T2 -> T4 >>> > >>> > > > > > >> T4 -> T7 >>> > >>> > > > > > >> T2 -> T5 >>> > >>> > > > > > >> T5 -> T8 >>> > >>> > > > > > >> What is the minimum number of time steps required to execute >>> these 8 >>> > > > tasks >>> > > > > > >> on a 2 processor machine and a 4 processor machine? >>> > >>> > > > > > >> a)4 & 2 >>> > >>> > > > > > >> b)5 & 2 >>> > >>> > > > > > >> c)5 & 4 >>> > >>> > > > > > >> d)6 & 2 >>> > >>> > > > > > >> -- >>> > > > > > >> Regards, >>> > > > > > >> $iva >>> > >>> > > > > > >> -- >>> > > > > > >> You received this message because you are subscribed to the >>> Google >>> > > > Groups >>> > > > > > >> "Algorithm Geeks" group. >>> > > > > > >> To post to this group, send email to >>> algogeeks@googlegroups.com. >>> > > > > > >> To unsubscribe from this group, send email to >>> > > > > > >> algogeeks+unsubscr...@googlegroups.com. >>> > > > > > >> For more options, visit this group at >>> > > > > > >>http://groups.google.com/group/algogeeks?hl=en. >>> > >>> > > > > > > -- >>> > > > > > > *Dheeraj Sharma* >>> > > > > > > Comp Engg. >>> > > > > > > NIT Kurukshetra >>> > >>> > > > > > > -- >>> > > > > > > You received this message because you are subscribed to the >>> Google >>> > > > Groups >>> > > > > > > "Algorithm Geeks" group. >>> > > > > > > To post to this group, send email to >>> algogeeks@googlegroups.com. >>> > > > > > > To unsubscribe from this group, send email to >>> > > > > > > algogeeks+unsubscr...@googlegroups.com. >>> > > > > > > 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 algogeeks@googlegroups.com. >>> > > > To unsubscribe from this group, send email to >>> > > > algogeeks+unsubscr...@googlegroups.com. >>> > > > 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 algogeeks@googlegroups.com. >>> To unsubscribe from this group, send email to >>> algogeeks+unsubscr...@googlegroups.com. >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >>> >> >> >> -- >> *UTKARSH SRIVASTAV >> CSE-3 >> B-Tech 3rd Year >> @MNNIT ALLAHABAD* >> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> 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 algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > 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 algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
