News for hackers. Stuff that matters.
Re:Parallelism is not concurrency by shasta on Tuesday March 22, 2011 @05:31PM (#2356610)
But isn't recursion depth the same as depth if each operation in your recursive function is constant time (except for the recursing bits)? Thus you can look at recursive depth as computing depth modulo the bits you compute in your function at a fixed level. I was speculating that partitioning would require O(log n) parallel steps. Can you give details or provide a link to achieving it constant depth?

There are no comments on this comment yet.