** Give a complexity analysis for the
lexicographic sorting on 3-D meshes.
You should discuss seperately
**
- the case
where the number
of nodes equals the number
of items to sort and
- the case where
is larger than
.

**
For
you should estimate the speed-up per processor
and comment on the scalability of this algorithm.
**

*Marc Moreno Maza *

2008-02-07