Giovanni Della-Libera

Learn More
Shared counters are concurrent objects which provide a fetch-and-increment operation on a distributed system and can be used to implement a variety of data structures, such as barriers, pools, stacks, and priority queues. Diffracting trees are novel data structures that provide ineffective, high throughput and low contention, shared counter construction.(More)
A shared counter is a concurrent object that provides a fetch-and-increment operation in a distributed system. Recently, diiracting trees have been introduced as an eecient way of implementing shared counters in heavily loaded systems. Diiracting trees dynamically distribute processors into small groups that can access a collection of disjoint local(More)
A shared counter is a concurrent object which provides the fetch-and-increment operation on a distributed system. Recently, diffracting trees have been introduced as shared counters which work well under high load. They efficiently divide high loads into lower loads that can quickly access lock-based counters that share the overall counting. Their(More)
  • 1