About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Abstract
The authors consider PRAMs with arbitrary computational power for individual processors, infinitely large shared memory and priority write-conflict resolution. The main result is that sorting n integers with n processors requires OMEGA ( ROOT log n) steps in this strong model. It is also shown that computing any symmetric polynomial (e. g. , the sum or product) of n integers requires exactly log//2n steps, for any finite number of processors.