Abstract
In this paper we discuss a sorting procedure for the k-dimensional hypercube. The procedure is divided into three phases with the steps within each phase being performed in parallel. We indicate that a near linear speedup can be expected for small values of k and that the procedure is cost optimal. The experimental results of a transputer implementation is presented which confirm the theoretical results.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
