✦ LIBER ✦

The performance of parallel matrix algorithms on a broadcast-based architecture

✍ Scribed by Constantine Katsinis; Diana Hecht; Ming Zhu; Harsha Narravula

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 304 KB
Volume: 18
Category: Article
ISSN: 1532-0626
DOI: 10.1002/cpe.920

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Performance Analysis of the Parallel Kar

Performance Analysis of the Parallel Karatsuba Multiplication Algorithm for Distributed Memory Architectures

✍ GIOVANNI CESARI; ROMAN MAEDER 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 447 KB

We present three parallel implementations of the Karatsuba algorithm for long integer multiplication on a distributed memory architecture and discuss the experimental results obtained on a Paragon computer. The first two implementations have both time complexity O(n) on n log 2 3 processors, but pre

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 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

A parallel solution to the HIP game base

A parallel solution to the HIP game based on genetic algorithms

✍ Tatiana Tambouratzis 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

In this piece of research, genetic algorithms are put forward for solving the HIP game. The proposed parallel approach manipulates candidate solutions via mutation and selection; no crossover has been employed. The population is limited to one candidate solution per generation, thus keeping the comp

Impact of mixed-parallelism on parallel

Impact of mixed-parallelism on parallel implementations of the Strassen and Winograd matrix multiplication algorithms

✍ F. Desprez; F. Suter 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 277 KB

## Abstract In this paper we study the impact of the simultaneous exploitation of data‐ and task‐parallelism, so called mixed‐parallelism, on the Strassen and Winograd matrix multiplication algorithms. This work takes place in the context of Grid computing and, in particular, in the Client–Agent(s)

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.