A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Adaptive algorithms, whose step complexity adjusts to the number of actually participating processors, are attractive in distributed systems where the number of processors is highly variable. Long-lived adaptive algorithms moreover enable processors to repeatedly execute operations "from scratch", allowing for stronger forms of adaptiveness. Shared memory collect can be implemented non adaptively with step and memory complexity O(N ). To date, the best known long-lived and adaptive shareddoi:10.1007/11561927_48 fatcat:fgybjg7qjbh23lafy3qdzq6woy