From: WebMaster@airspace-v.com   
      
   On 30 Sep., 22:57, Stephan Ceram  wrote:   
      
   > Unfortunately, it becomes not clear which complexity a local scheduler   
   > has for a multi-issue processor with a maximal latency of two   
   > cycles. This is exactly what I'm interested in. Do you have an idea   
   > what the complexity might be in that case? (Publications on that topic   
   > are highly welcomed).   
      
   If I remember correctly the problem of scheduling for a multi-issue   
   processor with maximum latency of more than one cycle is NP-complete.   
   Usually heuristical algorithms of run time linear in number of   
   instructions are used.   
      
   Thomas   
   --   
   Airspace V - international hangar flying!   
   http://www.airspace-v.com/ggadgets for tools & toys   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)