3 - Linear Arrays

Abstract

This chapter discusses the four parallel sorting algorithms for SIMD machines in which processors are interconnected in a linear array. This is the simplest and most fundamental of all interconnection schemes. The Odd–Even Transposition Sort algorithm assumes that there are as many processors available as there are elements in the input sequence to be sorted. The chapter describes the replacement of the comparison–exchange operation by a merge–split operation. It also discusses the way in which a Mergesort algorithm can be adapted to run in parallel when several processors are available to perform independent parts of the merging process.