

We then show how these techniques can be used for sequential sorting and also lead to better multi-core sorting algorithm performance as witnessed by the undertaken experimental study. Alexandros V Gerbessiotis Lives in Short Hills, New Jersey Arrest Records Court Records Marriage & Divorce Records Birth & Death Records Police Records. Qun Ma for their advice and help effort in my graduate study and dissertation defense. We extend the notion of deterministic regular sampling into deterministic regular oversampling for sequential and multi-core sorting and demonstrate its potential.

They spent a lot of precious time reviewing my dissertation and. Qun Ma in the Department of Computer Science for taking time to be committee members. We utilize parallel sorting techniques such as deterministic regular sampling and random oversampling. Dissertation: Topics in Parallel and Distributed Computation. Alexandros Gerbessiotis, Committee Member Date Associate Professor of Computer Science, NJIT Dr. Gerbessiotis, Alexandros, 'CS 610-101: Data Structures and Algorithms' (2019). New Jersey Institute of Technology (NJIT) records show Alexandros Gerbessiotis held multiple jobs from 2017 to 2020. The proposed approach leads to the development of asymptotically efficient deterministic and randomized sorting operations whose practical sequential and multi-core performance, as witnessed by an experimental study, matches or surpasses existing optimized sorting algorithm implementations. By Alexandros Gerbessiotis, Published on 09/01/19.
Alexandros gerbessiotis full#
Our methods can also work for multi-core sorting with minor adjustments that do not necessarily require full parallelization of the original sequential algorithm. Although the norm is to parallelize a sequential algorithm to improve performance, we adapt a contrarian approach: we employ parallel computing techniques to speed up sequential sorting. We propose new sequential sorting operations by adapting techniques and methods used for designing parallel sorting algorithms. Valiant, Direct Bulk-Synchronous Parallel Algorithms, Journal of Parallel and Distributed Computing, vol.22.
