ROE sorting on ILLIAC array processor
Masumeh Damroudi, Mohammad Reza Salehnamadi, Kamal Jadidy Aval · 2008
In this paper we present an algorithm for sorting on ILLIAC architecture. We need to speed up solving computer problems such as sorting. Because of limitations in processor's speed, using parallel algorithms is inevitable. This algorithm sorts 2N data elements using N processors with a running time of O(√N). The aim of issued algorithm is to reduce total cost of sorting with a trade off between the number of processors and execution time.