Giovanni Della-Libera

Learn More
Shared counters are concurrent objects which provide a fetch-andincrement 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 dis tributed system Recently di racting trees have been introduced as an e cient way of implement ing shared counters in heavily loaded systems Di racting trees dynamically distribute processors into small groups that can access a collection of disjoint local counters(More)
by Giovanni M. Della-Libera S.B. Mathematics, S.B. Computer Science, Massachusetts Institute of Technology (1996) Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Master of Engineering in Electrical Engineering and Computer Science at the MASSACHUSETTS INSTITUTE OF(More)
  • 1