RE: Solve transitive closure issue in modulo scheduling

2009-02-17 Thread Ayal Zaks
-Original Message- > > From: gcc-ow...@gcc.gnu.org [mailto:gcc-ow...@gcc.gnu.org] On > > Behalf Of Ayal Zaks > > Sent: 01 February 2009 23:18 > > To: Bingfeng Mei > > Cc: Adrian Ashley; gcc@gcc.gnu.org > > Subject: Re: Solve transitive closure issu

Re: Solve transitive closure issue in modulo scheduling

2009-02-07 Thread Daniel Berlin
On Fri, Jan 30, 2009 at 7:44 AM, Bingfeng Mei wrote: > Hello, > I try to make modulo scheduling work more efficiently for our VLIW target. I > found one serious issue that prevents current SMS algorithm from achieving > high IPC is so-called "transitive closure" problem, where scheduling window

Re: Solve transitive closure issue in modulo scheduling

2009-02-01 Thread Ayal Zaks
"Bingfeng Mei" wrote on 30/01/2009 14:44:01: > Hello, > I try to make modulo scheduling work more efficiently for our VLIW target. I > found one serious issue that prevents current SMS algorithm from achieving > high IPC is so-called "transitive closure" problem, where scheduling window is > only

Solve transitive closure issue in modulo scheduling

2009-01-30 Thread Bingfeng Mei
Hello, I try to make modulo scheduling work more efficiently for our VLIW target. I found one serious issue that prevents current SMS algorithm from achieving high IPC is so-called "transitive closure" problem, where scheduling window is only calculated using direct predecessors and successors.