Papers › Implementing Parallel Quick Sort Algorithm on OTIS Hyper Hexa-Cell (OHHC)...
Implementing Parallel Quick Sort Algorithm on OTIS Hyper Hexa-Cell (OHHC) Interconnection Network
Esam Nsour, Mohammad Fasha
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This work explores the characteristics of implementing parallel Quick Sort algorithm over the OTIS Hyper Hexa-Cell interconnection network OHHC. OHHC interconnection architecture offers efficient processor connectivity by utilizing both electronic and optical based connections. The work presented includes analytical evaluation of the algorithm as well as simulated evaluation over a multi-threading environment. Different experiments were performed using different OHHC dimensions, different integer array types and different array sizes. The evaluation and simulation demonstrated encouraging results that proposes the OHHC connectivity networks as a promising architecture.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections