Adding networks
Published • Aug 1, 2001
NobleIDNI5P85W04R63S13
Authors:,
Panagiota Fatourou
Maurice Herlihy
Abstract
An adding network is a distributed data structure that supports a concurrent, lock-free, low-contention implementation of a fetch&add counter. We give a lower bound showing that adding networks have inherently high latency. We prove that our lower bound is tight.
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!