search for: exponentionaly

...support distributed computing? OK, np, I will try. Consider this Fibonacci function as the model for our using case: f(int n) { if(n<2) return 1; return f(n-1) + f(n+2); } the complexity of this non-optimal version of Fibonacci function is O(2^n). The number of calls after start grows exponentionaly. It means that we have CPU loaded very quickly and we have a lot of calls to be "outsourced" to other CPUs. Is it OK up to here and I could continue using this model example? > How would code evaluation > distributed to multiple hosts benefit anyone? For me it sounds like: &q...

My $0.02 worth on this topic .. I'm also interested in distributed computing as XPL/XPS will support it. However, I find it unreasonable to expect LLVM to provide any features in this area. In order to do anything meaningful, LLVM would have to have some kind of awareness of networks (typically an operating system concern). That seems at odds with the "low level" principles of

On Wed, 7 Jan 2004, Valery A.Khamenya wrote: > Wednesday, January 7, 2004, 9:37:19 PM, you wrote: > > Well, Chris, let's forget about traditions (finally LLVM is > tradition-breaking thing!). At which level the optimization like i've > meant *should* be implemented?.. Ok, I thought you were concerned about LLVM breaking the _correctness_ of distributed programs, sorry. :)

...atterns. >Consider this Fibonacci function as the model for our >using case: > >f(int n) { > if(n<2) return 1; > return f(n-1) + f(n+2); >} > >the complexity of this non-optimal version of Fibonacci >function is O(2^n). The number of calls after start >grows exponentionaly. It means that we have CPU loaded >very quickly and we have a lot of calls to be >"outsourced" to other CPUs. > > To me this appears more as an algorithmic design issue, this function could be rewritten in "continuation passing style", and each continuation co...

...gt; > Consider this Fibonacci function as the model for our > using case: > > f(int n) { > if(n<2) return 1; > return f(n-1) + f(n+2); > } > the complexity of this non-optimal version of Fibonacci > function is O(2^n). The number of calls after start > grows exponentionaly. It means that we have CPU loaded > very quickly and we have a lot of calls to be > "outsourced" to other CPUs. > > Is it OK up to here and I could continue using this > model example? Yes, but I think the confusion was simply one of terminology. What you're talki...