Incremental Calculation for Fully Adaptive Algorithms

Abstract

The step complexity of fully adaptive (FA) algorithms depends only on the contention during an operation, when counting both local computation and accesses to shared registers. This paper contributes to the design of efficient fully adaptive algorithms by specifying and implementing two generic objects, Gather&f and Collect&f . A Gather&f object returns the… (More)

Topics

2 Figures and Tables