Abstract: This paper presents a new parallel structured lookahead multidimensional sorting algorithm. Our algorithm can be based on any sequential sorting algorithm. The amount of parallelism can be ...

Introduction and basic definitions: algorithm, problem, instance. Computational complexity analysis of algorithms. Sorting: Mergesort ... Priority queues: Heap. CCLR Sect. 9.1, 9.2 and CCLR Ch. 6 ...

However, the majority of existing multi-electrode spike-sorting algorithms are unsuited for processing high quantities of simultaneously recorded data. Recording from large neuronal networks using ...

By dividing the array into smaller subarrays and sorting them concurrently, the algorithm leverages multiple processor cores to improve performance, especially on large datasets.