Parallel quicksort algorithm on OTIS hyper hexa-cell optoelectronic architecture

Al-Adwan, Aryaf; Zaghloul, Rawan; Mahafzah, Basel A.; Sharieh, Ahmad

doi:10.1016/j.jpdc.2020.03.015

Cited by 13 publications

(8 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Its run time is better than those of BQSort and MWSort on the Intel i7-2600, AMD R7-1700 and R9-2920 processors. Moreover, a parallel quicksort algorithm for OTIS-HHC optoelectronic architecture was proposed by Al-Adwan et al 31 . Its average effeciency on 1,152 processors is up to 0.72.…”

Section: Background and Related Workmentioning

confidence: 99%

Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP

Ketchaya

Rattanatranurak

2023

Sci Rep

View full text Add to dashboard Cite

Quicksort is an important algorithm that uses the divide and conquer concept, and it can be run to solve any problem. The performance of the algorithm can be improved by implementing this algorithm in parallel. In this paper, the parallel sorting algorithm named the Multi-Deque Partition Dual-Deque Merge Sorting algorithm (MPDMSort) is proposed and run on a shared memory system. This algorithm contains the Multi-Deque Partitioning phase, which is a block-based parallel partitioning algorithm, and the Dual-Deque Merging phase, which is a merging algorithm without compare-and-swap operations and sorts the small data with the sorting function of the standard template library. The OpenMP library, which is an application programming interface used to develop the parallel implementation of this algorithm, is implemented in MPDMSort. Two computers (one with an Intel Xeon Gold 6142 CPU and the other with an Intel Core i7-11700 CPU) running Ubuntu Linux are used in this experiment. The results show that MPDMSort is faster than parallel balanced quicksort and multiway merge sort on the large random distribution data. A speedup of 13.81$$\times$$ × and speedup per thread of 0.86 can be obtained. Thus, developers can use these parallel partitioning and merging algorithms to improve the performance of related algorithms.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP

Ketchaya

Rattanatranurak

2023

Sci Rep

View full text Add to dashboard Cite

show abstract

“…Some other related parallel sorting algorithms of possible interest, which are beyond the domain of generic parallel in-place sorting on shared-memory CPU architectures, are as follows: parallel radix sort for graphic processing units (GPUs) by Xiao et al, 20 array sort-an adaptive merge sort-based sorting with multithreaded version by Huang et al, 21 parallel quicksort algorithm on optical transpose interconnection systems hyper hexa-cell (OTIS-HHC) optoelectronic architecture by Al-Adwan et al, 22 and bitonic sort on a chained-cubic tree (CCT) interconnection network by Al-Haj Baddar and Mahafzas. 23…”

Section: None Of These Implementations Provides Portable Parallel Sorting Built Upon C++ Threadingmentioning

confidence: 99%

CPP11sort: A parallel quicksort based on C++ threading

Langr

Schovánková

2021

Concurrency and Computation

View full text Add to dashboard Cite

A new efficient implementation of the multithreaded quicksort algorithm called CPP11sort is presented. This implementation is built exclusively upon the threading primitives of the C++ programming language itself. The performance of CPP11sort is evaluated and compared with its mainstream competitors provided by GNU, Intel, and Microsoft. It is shown that out of the considered implementations, CPP11sort mostly yields the shortest sorting times and is the only one that is portable to any conforming C++ implementation without a need of external libraries or nonstandard compiler extensions. The experimental evaluation with various input data distributions resulted in parallel speedup between 16.1 and 44.2 on a 56-core server and between 6.8 and 14.5 on a 10-core workstation with enabled hyperthreading.

show abstract

“…Because OTISs outperform previously announced interconnection networks theoretically, they have garnered significant research interest in recent times. 14,[17][18][19][20][21] The address of node p in group g is denoted by \g, p.. According to the OTIS rule, \g, p., and \p, g. are connected.…”

Section: Otismentioning

confidence: 99%

Petersen-star networks modeled by optical transpose interconnection system

Seo

Lee

2021

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

One method to create a high-performance computer is to use parallel processing to connect multiple computers. The structure of the parallel processing system is represented as an interconnection network. Traditionally, the communication links that connect the nodes in the interconnection network use electricity. With the advent of optical communication, however, optical transpose interconnection system networks have emerged, which combine the advantages of electronic communication and optical communication. Optical transpose interconnection system networks use electronic communication for relatively short distances and optical communication for long distances. Regardless of whether the interconnection network uses electronic communication or optical communication, network cost is an important factor among the various measures used for the evaluation of networks. In this article, we first propose a novel optical transpose interconnection system–Petersen-star network with a small network cost and analyze its basic topological properties. Optical transpose interconnection system–Petersen-star network is an undirected graph where the factor graph is Petersen-star network. OTIS–PSN n has the number of nodes 102n, degree n+3, and diameter 6 n − 1. Second, we compare the network cost between optical transpose interconnection system–Petersen-star network and other optical transpose interconnection system networks. Finally, we propose a routing algorithm with a time complexity of 6 n − 1 and a one-to-all broadcasting algorithm with a time complexity of 2 n − 1.

show abstract

Parallel quicksort algorithm on OTIS hyper hexa-cell optoelectronic architecture

Cited by 13 publications

References 26 publications

Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP

Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP

CPP11sort: A parallel quicksort based on C++ threading

Petersen-star networks modeled by optical transpose interconnection system

Contact Info

Product

Resources

About