Non-Interfering Concurrent Exchange (NICE) Networks

TL;DR

This paper introduces NICE networks, a new form of comparison-exchange that enables concurrent, non-interfering operations, reducing sorting stages and improving code-based CE performance.

Contribution

It presents the 2-op comparison-exchange operation and demonstrates how NICE networks lower sorting bounds and enhance code-based CE efficiency.

Findings

NICE networks enable concurrent comparison-exchange operations.

They reduce the number of stages needed for sorting.

Code-based CEs see improved run time costs.

Abstract

In studying the statistical frequency of exchange in comparison-exchange (CE) networks we discover a new elementary form of comparison-exchange which we name the "2-op". The operation supports concurrent and non-interfering operations of two traditional CEs upon one shared element. More than merely improving overall statistical performance, the introduction of NICE (non-interfering CE) networks lowers long-held bounds in the number of stages required for sorting tasks. Code-based CEs also benefit from improved average/worst case run time costs.