Shared pools and stacks are two coordination structures with a history of applications ranging from simple producer/consumer buffers to job-schedulers and procedure stacks. This paper introduces elimination trees, a novel form of diffracting trees that offer pool and stack implementations with superior response (on average constant) under high loads, while guaranteeing logarithmic time 'deterministic' termination under sparse request patterns.
|Number of pages||10|
|State||Published - 1995|
|Event||Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95 - Santa Barbara, CA, USA|
Duration: 17 Jul 1995 → 19 Jul 1995
|Conference||Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95|
|City||Santa Barbara, CA, USA|
|Period||17/07/95 → 19/07/95|