Parallel Sorting Algorithms on a Hyper-Channel Broadcast Communication Model

This paper presents a new improved architecture, named a hyper-channel broadcast communication model, as a computational model. The hyper-channel broadcast communication model consists of processors shared by some channels, and there are no local links between processors. Based on such an improved architecture, we first design two O(log N) cycles basic operations for finding the maximum/minimum of N real numbers and the ranks of a linked list using N and N×N processors, respectively. Then based on these proposed operations, two O(log N) cycles sorting algorithms are derived by either using N×N processors for the concurrent-write case or using N×N×N processors for the conflict-free case, respectively.