Odd-Even, Compare-Exchange Parallel Sorting
| dc.contributor.author | Nikolopoulos, S. D. | en |
| dc.contributor.author | Danielopoulos, S. D. | en |
| dc.date.accessioned | 2015-11-24T17:00:47Z | |
| dc.date.available | 2015-11-24T17:00:47Z | |
| dc.identifier.issn | 0165-6074 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/10812 | |
| dc.rights | Default Licence | - |
| dc.subject | parallel sorting | en |
| dc.subject | compare-exchange schemes | en |
| dc.subject | erew-pram | en |
| dc.subject | sorting networks | en |
| dc.subject | complexity | en |
| dc.subject | computation | en |
| dc.subject | algorithms | en |
| dc.subject | network | en |
| dc.subject | sorter | en |
| dc.title | Odd-Even, Compare-Exchange Parallel Sorting | en |
| heal.abstract | We present a parallel sorting algorithm and its proof which sorts a sequence of n elements in time O(log2 n) with n/2 processors on an EREW-PRAM computational model. A sorting network directly implements the algorithm using O(n.log n)PEs. The algorithm is based on the elementary Compare-Exchange operation and has the advantage that it does not require a powerful computational model, uses the least amount of space for the sorting problem, has small constants and can be implemented directly on a sorting network. Furthermore, the architecture of the network is simple and makes no unrealistic technological assumptions. | en |
| heal.access | campus | - |
| heal.fullTextAvailability | TRUE | - |
| heal.journalName | Microprocessing and Microprogramming | en |
| heal.journalType | peer reviewed | - |
| heal.language | en | - |
| heal.publicationDate | 1994 | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής | el |
| heal.type | journalArticle | - |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.type.en | Journal article | en |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.74 KB
- Format:
- Item-specific license agreed upon to submission
- Description: