Unformatted text preview: keys. Discuss the quality of each of your solutions in terms of time/space/processors. Efficiency counts. a) RAM b) CREW PRAM c) CRCW PRAM d) Linear array e) 2D Mesh 3. (40%) Given a set X x x n = { ,..., } 1 of integers, x n i ∈ [ , ] / 1 1 2 , distributed in an arbitrary fashion one element per processor on a 2D mesh of size n , give an optimal algorithm to sort X . Given a 2D mesh of size n 2 3 / , give an optimal algorithm to solve this problem....
View
Full
Document
This document was uploaded on 05/02/2010.
 Spring '09
 Algorithms

Click to edit the document details