Sorting using networks of deques

摘要

The number of required deques for sorting all sequences of n items in a parallel or series network of deques is considered. It is shown that the optimal number of required deques is O(n12) for a parallel network, while it is O(log n) for a series network. These orders, O(n12) and O(log n), also remain valid for the networks of restricted deques.