home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   comp.compilers      Compiler construction, theory, etc. (Mod      2,753 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 1,139 of 2,753   
   =?ISO-8859-1?Q?Pertti_Kellom=E4ki?= to George Neuner   
   Re: Banerjee inequality   
   08 Nov 07 12:14:42   
   
   From: pertti.kellomaki@tut.fi   
      
   George Neuner wrote   
   > David Klappholz, Kleanthis Psarris, and Xiangyun Kong, "On the perfect   
   > accuracy of an approximate subscript analysis test", ACM SIGARCH   
   > Computer Architecture News , Proceedings of the 4th international   
   > conference on Supercomputing ICS '90,  Volume 18 Issue 3b, June 1990.   
      
   Thanks, this is a good source. It also provides an interesting   
   reason why the Banerjee test works so well in practice: "if there   
   is a coefficient of +1 or -1, and if all coefficients are smaller,   
   in absolute value, than all loop iteration ranges, then the Banerjee   
   test checks for integer solutions".   
   --   
   Pertti   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca