Performance Evaluation of Parallel Algorithms

Evaluating how well a whole system or set of subsystems performs is one of the primary objectives of performance testing. We can tell via performance assessment if the architecture implementation meets the design objectives. Performance evaluations of several parallel algorithms are compared in this study. Both theoretical and experimental methods are used in performance assessment as a subdiscipline in computer science. The parallel method outperforms its sequential counterpart in terms of throughput. The parallel algorithm's performance (speedup) is examined, as shown in the result.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2018

Exploring Parallel-in-Time Approaches for Eddy Current Problems

We consider the usage of parallel-in-time algorithms of the Parareal and...
research
10/28/2018

P-MCGS: Parallel Monte Carlo Acyclic Graph Search

Recently, there have been great interests in Monte Carlo Tree Search (MC...
research
11/18/2020

High-Throughput and Memory-Efficient Parallel Viterbi Decoder for Convolutional Codes on GPU

This paper describes a parallel implementation of Viterbi decoding algor...
research
05/14/2020

Parallel Minimum Spanning Tree Algorithms and Evaluation

Minimum Spanning Tree (MST) is an important graph algorithm that has wid...
research
02/23/2021

Twelve Ways To Fool The Masses When Giving Parallel-In-Time Results

Getting good speedup – let alone high parallel efficiency – for parallel...
research
04/19/2021

Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms

Empirical studies are fundamental in assessing the effectiveness of impl...
research
06/23/2013

Exploiting Data Parallelism in the yConvex Hypergraph Algorithm for Image Representation using GPGPUs

To define and identify a region-of-interest (ROI) in a digital image, th...

Please sign up or login with your details

Forgot password? Click here to reset