Improvement of parallel average partitioning and sorting algorithm with decreasing single point of failure and bottleneck

Ahmed Hammad Helal; Masoud E Shaheen

No Detail Found!

Improvement of parallel average partitioning and sorting algorithm with decreasing single point of failure and bottleneck

Author(s)

Ahmed Hammad Helal Computer Science department, Faculty of computer science and information system, Fayoum University,,

Masoud E Shaheen Computer Science department, Faculty of computer science and information system, Fayoum University,,

Abstract

Sorting algorithms are algorithms which put elements of a list in a certain order. The first sorting algorithms were sequential and there are many contributions to make these algorithms parallel, these contributions have been attracted many researchers may be due to the complexity of solving it efficiently. Parallel sorting algorithms have conquered many problems like decreasing processing time and resource utilization. This paper presents some enhancements on a parallel partitioning and sorting algorithm to overcome single point of failure and bottleneck problems.

Publication Details

Page(s) 2668-2675

DOI DOI not available

Published Journal: Journal of Theoretical and Applied Information Technology, Volume: 100, Issue: 8, Year: 2022

Request the full text from PASTIC

Keywords

Resource Utilization, Single Point of Failure, Distributed Shared Memory System, Bottleneck, Many to Many Communication

Citations

Downloads

Views