Elimination trees and the construction of pools and stacks

Nir Shavit, Dan Touitou

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
Pages54-63
Number of pages10
DOIs
StatePublished - 1995
Externally publishedYes
EventProceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95 - Santa Barbara, CA, USA
Duration: 17 Jul 199519 Jul 1995

Conference

ConferenceProceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95
CitySanta Barbara, CA, USA
Period17/07/9519/07/95

Cite this