Elimination trees and the construction of pools and stacks

N. Shavit; D. Touitou

doi:10.1007/s002240000072

Elimination trees and the construction of pools and stacks

N. Shavit^*, D. Touitou

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-review

42 Scopus citations

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. * A preliminary version of this paper appeared in the Proceedings of the 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA), pages 54-63, July 1995. This research was supported by Contracts HRPA #F19628-95-C-0118, AFOSR/ONR #F49620-94-1-0199, NSF #9225124-CCR, and #9520298-CCR.

Original language	English
Pages (from-to)	645-670
Number of pages	26
Journal	Theory of Computing Systems
Volume	30
Issue number	6
DOIs	https://doi.org/10.1007/s002240000072
State	Published - 1997

Funding

Funders	Funder number
National Science Foundation	9520298-CCR, 9225124-CCR
Air Force Office of Scientific Research	49620-94-1-0199

Access to Document

10.1007/s002240000072

Cite this

@article{4ba3989df30e4f3598b3dd73908f07f9,

title = "Elimination trees and the construction of pools and stacks",

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. * A preliminary version of this paper appeared in the Proceedings of the 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA), pages 54-63, July 1995. This research was supported by Contracts HRPA #F19628-95-C-0118, AFOSR/ONR #F49620-94-1-0199, NSF #9225124-CCR, and #9520298-CCR.",

author = "N. Shavit and D. Touitou",

note = "Funding Information: ⁄ A preliminary version of this paper appeared in the Proceedings of the 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA), pages 54–63, July 1995. This research was supported by Contracts HRPA #F19628-95-C-0118, AFOSR=ONR #F49620-94-1-0199, NSF #9225124-CCR, and #9520298-CCR.",

year = "1997",

doi = "10.1007/s002240000072",

language = "אנגלית",

volume = "30",

pages = "645--670",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "6",

}

TY - JOUR

T1 - Elimination trees and the construction of pools and stacks

AU - Shavit, N.

AU - Touitou, D.

N1 - Funding Information: ⁄ A preliminary version of this paper appeared in the Proceedings of the 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA), pages 54–63, July 1995. This research was supported by Contracts HRPA #F19628-95-C-0118, AFOSR=ONR #F49620-94-1-0199, NSF #9225124-CCR, and #9520298-CCR.

PY - 1997

Y1 - 1997

N2 - 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. * A preliminary version of this paper appeared in the Proceedings of the 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA), pages 54-63, July 1995. This research was supported by Contracts HRPA #F19628-95-C-0118, AFOSR/ONR #F49620-94-1-0199, NSF #9225124-CCR, and #9520298-CCR.

AB - 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. * A preliminary version of this paper appeared in the Proceedings of the 7th Annual Symposium on Parallel Algorithms and Architectures (SPAA), pages 54-63, July 1995. This research was supported by Contracts HRPA #F19628-95-C-0118, AFOSR/ONR #F49620-94-1-0199, NSF #9225124-CCR, and #9520298-CCR.

UR - http://www.scopus.com/inward/record.url?scp=0031260816&partnerID=8YFLogxK

U2 - 10.1007/s002240000072

DO - 10.1007/s002240000072

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0031260816

SN - 1432-4350

VL - 30

SP - 645

EP - 670

JO - Theory of Computing Systems

JF - Theory of Computing Systems

IS - 6

ER -

Elimination trees and the construction of pools and stacks

Abstract

Funding

Access to Document

Other files and links

Fingerprint

Cite this