A new parallel sorting algorithm suitable for MIMD multiprocessor is presented. The
algorithm reduces memory and bus contention, which many parallel sorting algorithms suffer …

Parallel sorting algorithms have already been proposed for a variety of multiple instruction
streams, multiple data streams (MIMD) architectures. These algorithms often exploit the …

We present a fast comparison based parallel sorting algorithm that can handle arbitrary key
types. Data movement is the major portion of sorting time for most algorithms in the literature …

We give practical algorithms, complexity analysis and implementation for one‐to‐all
broadcasting, all‐to‐all personalized communication and matrix transpose (with two …

Designing low-latency network topologies of switches is a key objective for next-generation
large-scale clusters. Low latency is preconditioned on low hop counts, but existing network …

Sorting is one of most studied problems in computer science because of its theoretical
interest and practical importance. With the advent of parallel processing, parallel Sorting has …

The heterogeneity of Schizophrenia disease has been a major pitfall for identifying the
aetiological, genetic or environmental factors. Age at onset or several other quantitative …

We will present optimal or nearly optimal algorithms for four communication problems on
hypercubes:(i) one-to-all broadcasting,(ii) one-to-all personalized communication (iii) all-to …