Amanote Research

Amanote Research

    RegisterSign In

Measuring Parallel Performance of Sorting Algorithms

Modern Applied Science
doi 10.5539/mas.v12n10p23
Full Text
Open PDF
Abstract

Available in full text

Date

September 12, 2018

Authors
Saher ManaseerAhmad K. Al Hwaitat
Publisher

Canadian Center of Science and Education


Related search

Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1989English

Efficient Out-Of-Core Sorting Algorithms for the Parallel Disks Model

Journal of Parallel and Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureTheoretical Computer ScienceArtificial IntelligenceSoftware
2011English

From AAPC Algorithms to High Performance Permutation Routing and Sorting

1996English

High-Performance Graph Algorithms From Parallel Sparse Matrices

English

Asynchronous Parallel Disk Sorting

2003English

Analysis and Performance of a Parallel Axis Flatness Measuring Instrument

Review of Scientific Instruments
MedicineInstrumentation
2006English

Optimizing Sorting With Genetic Algorithms

English

Distributed Scheduling Algorithms to Improve the Performance of Parallel Data Transfers

ACM SIGARCH Computer Architecture News
1994English

Commentary—The Role of Performance Metrics for Parallel Mathematical Programming Algorithms

ORSA Journal on Computing
1993English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy