Sequential algorithms for the Stable Matching Problem are often too slow in the context of some large scale applications like switch scheduling. Parallel architectures can offer a notable decrease in runtime complexity. We propose a stable matching algorithm using n^2 processors that converges in O(nlog(n)) average runtime. The algorithm is structurally based on the Parallel Iterative Improvement (PII) algorithm, which successfully finds a stable matching in approximately 90% of cases. We suggest alternative selection methods for pairs in the PII algorithm, called Right-Minimum and Dynamic Selection, resulting in full convergence over 3.3 million trials and generally much faster termination.

翻译：稳定匹配问题的序列式算法在交换机调度等大规模应用中通常过于缓慢。并行架构能够显著降低运行时间复杂度。我们提出一种采用n^2个处理器且平均运行时间收敛于O(nlog(n))的稳定匹配算法。该算法在结构上基于并行迭代改进（PII）算法，后者在约90%的案例中能够成功找到稳定匹配。我们针对PII算法中的配对选择方案提出替代方法——即“右最小值选择”与“动态选择”，使得在330万次试验中实现完全收敛，且通常具有更快的终止速度。