Bitonic sort in shared SIMD array processor

  • Authors:
  • Anukul Chandra Panda;Pankaj K. Sa;Banshidhar Majhi

  • Affiliations:
  • National Institute of Technology Rourkela, Rourkela, Odisha, India;National Institute of Technology Rourkela, Rourkela, Odisha, India;King Khalid University, Abha, Saudi Arabia

  • Venue:
  • Proceedings of the 2011 International Conference on Communication, Computing & Security
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a bitonic sort scheme in a shared memory mesh-connected SIMD array processor. In addition, it uses the two types of comparators of sorting networks in the mesh-connected parallel computer. This scheme uses variable multiple pivots and non-pivots. Parity strategy has been implemented to minimize the number of accesses in the mesh-connected interconnection network by introducing the concept of global and local memory. The proposed scheme is sufficiently general which is independent of hardware and interconnection network among them. From results it has been observed that by reducing the internetwork communication a performance improvement is achieved.