Implementing Parallel Quick Sort Algorithm on OTIS Hyper Hexa-Cell (OHHC) Interconnection Network
Esam Nsour, Mohammad Fasha

TL;DR
This paper evaluates the implementation of parallel Quick Sort on the OTIS Hyper Hexa-Cell interconnection network, combining analytical and simulated results to demonstrate its efficiency and potential as a promising architecture.
Contribution
It presents the first analytical and simulated evaluation of parallel Quick Sort on the OTIS Hyper Hexa-Cell interconnection network, highlighting its advantages.
Findings
Encouraging performance results for various OHHC configurations
Effective utilization of electronic and optical connections in OHHC
Potential of OHHC as a promising architecture for parallel algorithms
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Algorithms and Data Compression · Parallel Computing and Optimization Techniques
