A parallel three phase sorting procedure for a k-dimensional hypercube and a transputer implementation
| Autor: | T. H. C. Smith, W. Loots |
|---|---|
| Rok vydání: | 1992 |
| Předmět: |
Speedup
Computer Networks and Communications Computer science Transputer Sorting Parallel algorithm Parallel computing Computer Graphics and Computer-Aided Design Theoretical Computer Science Artificial Intelligence Hardware and Architecture Hypercube Merge sort Time complexity Algorithm Software Quicksort |
| Zdroj: | Parallel Computing. 18:335-344 |
| ISSN: | 0167-8191 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|