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(n1 2) for a parallel network, while it is O(log n) for a series network. These orders, O(n1 2) and O(log n), also remain valid for the networks of restricted deques. © 1979.
Nozaki, A. (1979). Sorting using networks of deques. Journal of Computer and System Sciences, 19(3), 309–315. https://doi.org/10.1016/0022-0000(79)90007-2