The authors present a parallel algorithm to perform nonlinear mapping that they claim is useful for pattern recognition and clustering analysis. They transform the nonlinear mapping algorithm proposed in [1] into a parallel version and show that the nonlinear mapping algorithm is quite similar to a sorting algorithm. They provide a useful account of the algorithm in pseudocode and give several examples. The examples have to do with sorter chips.