search for: pr11589

...schedule each > > unrolled iteration of the loop sequentially. The reason why this seems > > to occur is that the hybrid scheduler would prefer to suffer a large > > data-dependency delay over a shorter full-pipeline delay. Do you know > > why it would do this? (you can see PR11589 for an example if you'd > > like). > > The "ilp" scheduler has several heuristics designed to compensate for lack of itinerary. Each of those heuristics has a flag, so you can see what works for your target. I've never used that scheduler with an itinerary, but it sho...

...imum" of sorts, whereby it wants to schedule each unrolled iteration of the loop sequentially. The reason why this seems to occur is that the hybrid scheduler would prefer to suffer a large data-dependency delay over a shorter full-pipeline delay. Do you know why it would do this? (you can see PR11589 for an example if you'd like). Regarding HasReadyFilter: HasReadyFilter just causes isReady() to be used? Is there a reason that this is a compile-time constant? Both Hybrid and ILP have isReady() functions. I can certainly propose a patch to make them command-line options. Thanks again, Hal...

...whereby it wants to schedule each > unrolled iteration of the loop sequentially. The reason why this seems > to occur is that the hybrid scheduler would prefer to suffer a large > data-dependency delay over a shorter full-pipeline delay. Do you know > why it would do this? (you can see PR11589 for an example if you'd > like). The "ilp" scheduler has several heuristics designed to compensate for lack of itinerary. Each of those heuristics has a flag, so you can see what works for your target. I've never used that scheduler with an itinerary, but it should work. It...

On Dec 19, 2011, at 10:53 PM, Hal Finkel wrote: > Here's my "thought experiment" (from PR11589): I have a bunch of > load-fadd-store chains to schedule. A store takes two cycles to clear > its last pipeline stage. The fadd takes longer to compute its result > (say 5 cycles), but can sustain a rate of 1 independent add per cycle. > As the scheduling is bottom-up, it will schedule...

On Mon, 2011-12-19 at 23:20 -0800, Andrew Trick wrote: > > On Dec 19, 2011, at 10:53 PM, Hal Finkel wrote: > > > Here's my "thought experiment" (from PR11589): I have a bunch of > > load-fadd-store chains to schedule. A store takes two cycles to > > clear > > its last pipeline stage. The fadd takes longer to compute its result > > (say 5 cycles), but can sustain a rate of 1 independent add per > > cycle. > > As the sc...

On Dec 19, 2011, at 6:51 AM, Hal Finkel <hfinkel at anl.gov> wrote: > On Tue, 2011-10-25 at 21:00 -0700, Andrew Trick wrote: > Now, to generate the best PPC schedules, there is one thing you may >> want to override. The scheduler's priority function has a >> HasReadyFilter attribute (enum). It can be overriden by specializing >> hybrid_ls_rr_sort. Setting this to

On Tue, 2011-12-20 at 10:35 -0600, Hal Finkel wrote: > On Mon, 2011-12-19 at 23:20 -0800, Andrew Trick wrote: > > > > On Dec 19, 2011, at 10:53 PM, Hal Finkel wrote: > > > > > Here's my "thought experiment" (from PR11589): I have a bunch of > > > load-fadd-store chains to schedule. A store takes two cycles to > > > clear > > > its last pipeline stage. The fadd takes longer to compute its result > > > (say 5 cycles), but can sustain a rate of 1 independent add per > > > c...

On Tue, 2011-10-25 at 21:00 -0700, Andrew Trick wrote: Now, to generate the best PPC schedules, there is one thing you may > want to override. The scheduler's priority function has a > HasReadyFilter attribute (enum). It can be overriden by specializing > hybrid_ls_rr_sort. Setting this to "true" enables proper ILP > scheduling, and maximizes the instructions that can

..., Hal Finkel wrote: > On Tue, 2011-12-20 at 10:35 -0600, Hal Finkel wrote: >> On Mon, 2011-12-19 at 23:20 -0800, Andrew Trick wrote: >>> >>> On Dec 19, 2011, at 10:53 PM, Hal Finkel wrote: >>> >>>> Here's my "thought experiment" (from PR11589): I have a bunch of >>>> load-fadd-store chains to schedule. A store takes two cycles to >>>> clear >>>> its last pipeline stage. The fadd takes longer to compute its result >>>> (say 5 cycles), but can sustain a rate of 1 independent add per >>...