An efficient long-lived adaptive collect algorithm

Abstract

We present a new long-lived, efficient, adaptive collect algorithm. Namely, our algorithm adapts to κ-contention - it has the property that if during an operation the interval contention k exceeds a predetermined constant κ. The step complexity is O(N). If, it falls below κ, the processors executions will eventually have adaptive step complexity of O(κ 3). Moreover, for κ such that κ 3 ≤ N our algorithm requires only O(N 2) shared memory registers. © Springer-Verlag Berlin Heidelberg 2005.