Parallel Computing for Sorting Algorithms
The expanding use of multi-processor supercomputers has made a significant impact on the speed and size of many problems. The adaptation of standard Message Passing Interface protocol (MPI) has enabled programmers to write portable and efficient codes across a wide variety of parallel architectures....
Saved in:
| Main Author: | Baghdad Science Journal |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Baghdad, College of Science for Women
2014-06-01
|
| Series: | مجلة بغداد للعلوم |
| Subjects: | |
| Online Access: | http://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/2632 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Design of High-Speed Multiway Merge Sorting Networks Using Fast Single-Stage N-Sorters and N-Filters
by: Robert B. Kent, et al.
Published: (2022-01-01) -
Parallel Sort Implementation and Evaluation in a Dataflow-Based Polymorphic Computing Architecture
by: David Hentrich, et al.
Published: (2025-05-01) -
Empirical evaluation of parallel implementations of MergeSort
by: José Eduardo Solsona, et al.
Published: (2025-05-01) -
A scalable parallel sorting algorithm by regular sampling for big data
by: Ying WANG, et al.
Published: (2024-07-01) -
Parallel construction of binary tree based on sorting
by: Ya. E. Romm, et al.
Published: (2018-12-01)