✦ LIBER ✦

Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge

✍ Scribed by Michael J. Quinn

Publisher: Springer Netherlands
Year: 1989
Tongue: English
Weight: 728 KB
Volume: 29
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01952679

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A C3I Parallel Benchmark Based on Geneti

A C3I Parallel Benchmark Based on Genetic Algorithms—Implementation and Performance Analysis

✍ Subburajan Ponnuswamy; Minesh B. Amin; Rakesh Jha; David A. Castañon 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 305 KB

As part of the ongoing effort in creating a parallel benchmark suite for C 3 I (command, control, communication, and intelligence) applications, we implemented an important C 3 I application, the decision support systems (DSS), using a genetic algorithmic approach. In this paper, we present the stru

The analysis of evolutionary algorithms

The analysis of evolutionary algorithms on sorting and shortest paths problems

✍ Jens Scharnow; Karsten Tinnefeld; Ingo Wegener 📂 Article 📅 2005 🏛 Springer Netherlands 🌐 English ⚖ 161 KB

Performance modelling of three parallel

Performance modelling of three parallel sorting algorithms on a pipelined transputer network

✍ Narasimhan, V. Lakshmi; Armstrong, J. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 961 KB

The implementation of three parallel sorting algorithms, namely binary sort, odd-even transposition sort and bitonic sort, on a network of transputers is analysedin the paper. The variation in the performance of these algorithms as the number of processors and sort size are changed is investigated.

Optimization and performance analysis of

Optimization and performance analysis of thinning algorithms on parallel computers

✍ Stephan Heydorn; Peter Weidner 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Heydorn, S. and P. Weidner, Optimization and performance analysis of thinning algorithms on parallel computers, Parallel Computing 17 (1991) 17-27. This paper presents a concept for an implementation of different parallel thinning algorithms on parallel processors. The emphasis is put on a good para

The performance of a selection of sortin

The performance of a selection of sorting algorithms on a general purpose parallel computer

✍ DOWSING, R. D.; MARTINS, W. S. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 2 views

In the past few years, there has been considerable interest in general purpose computational models of parallel computation to enable independent development of hardware and software. The BSP and related models represent an important step in this direction, providing a simple view of a parallel mach

Performance of a benchmark parallel impl

Performance of a benchmark parallel implementation of the Van Slyke and Wets algorithm for two-stage stochastic programs on the Sequent/Balance

✍ Ariyawansa, K. A. ;Hudson, D. D. 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 1015 KB

We describe a benchmark parallel version of the Van Slyke and Wets (1969) algorithm for two-stage stochastic programs and an implementation of that algorithm on the Sequent/Balance. We also report results of a numerical experiment using random test problems and our implementation. These performance