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
-
Empirical evaluation of parallel implementations of MergeSort
by: José Eduardo Solsona, et al.
Published: (2025-05-01) -
Parallel construction of binary tree based on sorting
by: Ya. E. Romm, et al.
Published: (2018-12-01) -
Sorting routines for microcomputers /
by: McLuckie, Keith
Published: (1986) -
The new sort of winter barley for Dagestan conditions
by: B. A. Batasheva
Published: (2015-02-01) -
Improving the Efficiency of Screen Type Potato Sorting Machines by a Modification of the Sieve Drive Movement Algorithm
by: A. G. Ivanov, et al.
Published: (2023-06-01)