Article

Free access

Elimination trees and the construction of pools and stacks: preliminary version

Authors:

Nir Shavit,

Dan TouitouAuthors Info & Claims

SPAA '95: Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures

Pages 54 - 63

https://doi.org/10.1145/215399.215419

Published: 20 July 1995 Publication History

PDF eReader

References

[1]

T.E. Anderson. The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(1):6-16, January 1990.

Digital Library

Google Scholar

[2]

A. Agarwal et al. The MIT Alewife Machine: A Large- Scale Distributed-Memory Multiprocessor. In Proceedings of Workshop on Scalable Shared Memory Multiprocessors. Kluwer Academic Publi,her#, 1991. An extended version of this paper has been submitted for publication, and appears as MIT/LCS Memo TM-454, 1991.

Google Scholar

[3]

J. Aspnes, M.P. Herlihy, and N. Shavit. Counting Networks. Journal of the ACM, Vol. 41, No. 5 (September 1994), pp. 1020-1048.

Digital Library

Google Scholar

[4]

#I.R. Goodman, M.K. Vernon, and P.J. Woest. Efficient Synchronization Primitives for Large-Scale Cache- Coherent multiprocessors. In Proceedings of the 3rd A S- PLOS, pages 64-75. ACM, April 1989.

Digital Library

Google Scholar

[5]

M. Herlihy, B.H. Lira and N. Shavit. Low Contention Load Balancing on Large Scale Multiprocessors. Proceedings of the 3rd Annual ASM Symposium on Parallel Algorithms and Architectures, July 1992, San Diego, CA. Full version #vailable as a DEC TR.

Digital Library

Google Scholar

[6]

R.D. Blumofe, and C.E. Leiserson. Sheduling Multithreaded Computations by Work Stealing. In Proceeding of the 35th Symposium on Foundations of Computer Science, pages 365-368, November 1994.

Digital Library

Google Scholar

[7]

E.A. Brewer, C.N. Dellarocas, A. Colbrook and W.E. Weihl. PROTEUS: A High-Performance Parallel- Architecture Simulator. MIT Technical Report /MIT/LCS/TR-561, September 1991.

Digital Library

Google Scholar

[8]

J.M. Mellor-Crummey and M.L. Scott Synchronization without Contention. In Proceedings o} the #th International Conference on Architecture Support for Programruing Languages and Operating Systems, April 1991.

Digital Library

Google Scholar

[9]

G.H. Pfister and A. Norton. 'Hot Spot' contention and combining in multistage interconnection networks. 1NEE Transactions on Computers, C-34(11):933-938, November 1985.

Google Scholar

[10]

D. Gawlick. Processing 'hot spots' in high performance systems. In Proceedings COMPCON'85, 1985.

Google Scholar

[11]

N.A. Lynch and M.R. Tattle. Hierarchical Correctness Proofs for Distributed Algorithms. In Sixth ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, August 1987, pp. 137-151. Full version available as MIT Technical Report MIT/LCS/TR- 387.

Digital Library

Google Scholar

[12]

R. Liiling, and B. Monien. A Dynamic Distributed Load Balancing Algorithm with Provable Good Performance. In Proceedings of the 5rd A CM Symposium on Parallel Algorithms and Architectures, pages 164-173, June 1993.

Digital Library

Google Scholar

[13]

L. Rudolph, M. Slivkin, and E. Upfal. A Simple Load Balancing Scheme for Task Allocation in Parallel Machines. In Proceedings of the 3rd A CM Symposium on Parallel Algorithms and Architectures, pages 237-245, July 1991.

Digital Library

Google Scholar

[14]

Krithi Ramamrithan and Calton Pu. A Formal Characterization of Epsilon SeriMizability. IEEE Transactions on Knowledge and Data Engineering, 1994, to appear.

Digital Library

Google Scholar

[15]

M. Herlihy and J.M. Wing. Linearizubility: A correctness condition for concurrent objects. In ACM Transaction on Programming Languages and Systems, 12(3), pages 463-492, July 199

Digital Library

Google Scholar

[16]

N. Shavit and A. Zemach. Diffracting Trees. In Proceedings of the Annual Symposium on Parallel Algorithms and Architectures (SPAA), June 1994.

Digital Library

Google Scholar

[17]

K. Taura, S. Matsuoka, and A. Yonezawa. An Efficient Implementation Scheme of Concurrent Object-Oriented Languages on Stock Multicomputers. In Proceedings of the 4th Symposium on Principles and Practice of Parallel Programming, pages 218-228, May 1993.

Digital Library

Google Scholar

Cited By

View all

Srivastava ABrown TLee JAgrawal KSpear M(2022)Elimination (a,b)-trees with fast, durable updatesProceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3503221.3508441(416-430)Online publication date: 2-Apr-2022
https://dl.acm.org/doi/10.1145/3503221.3508441
Rukundo AAtalar ATsigas PAgrawal KLee I(2022)Performance Analysis and Modelling of Concurrent Multi-access Data StructuresProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538578(333-344)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538578
Zhao MTroendle DJang B(2022)A Concurrent Relaxed Queue for Unordered Parallel Accesses on GPUs2022 International Conference on Computational Science and Computational Intelligence (CSCI)10.1109/CSCI58124.2022.00243(1352-1358)Online publication date: Dec-2022
https://doi.org/10.1109/CSCI58124.2022.00243
Show More Cited By

Index Terms

Elimination trees and the construction of pools and stacks: preliminary version

Recommendations

Elimination Trees and the Construction of Pools and Stacks

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 ...
Linear Bidirectional On-Line Construction of Affix Trees

Affix trees are a generalization of suffix trees that are based on the inherent duality of suffix trees induced by the suffix links. An algorithm is presented that constructs affix trees on-line by expanding the underlying string in both directions and ...
Linear-Time Construction of Two-Dimensional Suffix Trees

The two-dimensional suffix tree of a matrix A is a compacted tree that represents all square submatrices of A. We present the first complete version of a deterministic linear-time algorithm to construct the two-dimensional suffix tree by applying a ...

Comments

Information & Contributors

Information

Published In

SPAA '95: Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures

July 1995

320 pages

ISBN:0897917170

DOI:10.1145/215399

Chairman:
Charles E. Leiserson
Massachussets Institute of Technology, Cambridge

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 July 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

7SPAA95

Sponsor:

European Theoretical
IEEE
SIGACT
SIGARCH

7SPAA95: 7th Annual ACM Symposium on Parallel Algorithms and Architectures

June 24 - 26, 1995

California, Santa Barbara, USA

Acceptance Rates

SPAA '95 Paper Acceptance Rate 31 of 101 submissions, 31%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

51
Total Citations
View Citations
359
Total Downloads

Downloads (Last 12 months)37
Downloads (Last 6 weeks)6

Reflects downloads up to 21 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Srivastava ABrown TLee JAgrawal KSpear M(2022)Elimination (a,b)-trees with fast, durable updatesProceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3503221.3508441(416-430)Online publication date: 2-Apr-2022
https://dl.acm.org/doi/10.1145/3503221.3508441
Rukundo AAtalar ATsigas PAgrawal KLee I(2022)Performance Analysis and Modelling of Concurrent Multi-access Data StructuresProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538578(333-344)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538578
Zhao MTroendle DJang B(2022)A Concurrent Relaxed Queue for Unordered Parallel Accesses on GPUs2022 International Conference on Computational Science and Computational Intelligence (CSCI)10.1109/CSCI58124.2022.00243(1352-1358)Online publication date: Dec-2022
https://doi.org/10.1109/CSCI58124.2022.00243
Alistarh DBrown TSinghal NScheideler CSpear M(2020)Memory Tagging: Minimalist Synchronization for Scalable Concurrent Data StructuresProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400213(37-49)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400213
Koval NAlistarh DElizarov R(2019)Scalable FIFO Channels for Programming via Communicating Sequential ProcessesEuro-Par 2019: Parallel Processing10.1007/978-3-030-29400-7_23(317-333)Online publication date: 26-Aug-2019
https://dl.acm.org/doi/10.1007/978-3-030-29400-7_23
Rukundo AAtalar ATsigas PNewport CKeidar I(2018)Brief AnnouncementProceedings of the 2018 ACM Symposium on Principles of Distributed Computing10.1145/3212734.3212794(407-409)Online publication date: 23-Jul-2018
https://dl.acm.org/doi/10.1145/3212734.3212794
Anenkov APaznikov AKurnosov M(2018)Algorithms for Access Localization to Objects of Scalable Concurrent Pools Based on Diffracting Trees in Multicore Computer Systems2018 XIV International Scientific-Technical Conference on Actual Problems of Electronics Instrument Engineering (APEIE)10.1109/APEIE.2018.8545197(374-380)Online publication date: Oct-2018
https://doi.org/10.1109/APEIE.2018.8545197
Scott RNavarro Leija ODevietti JNewton R(2017)Monadic composition for deterministic, parallel batch processingProceedings of the ACM on Programming Languages10.1145/31338971:OOPSLA(1-26)Online publication date: 12-Oct-2017
https://dl.acm.org/doi/10.1145/3133897
Haider SHasenplaugh WAlistarh D(2017)Lease/ReleaseACM Transactions on Parallel Computing10.1145/31321684:2(1-25)Online publication date: 10-Oct-2017
https://dl.acm.org/doi/10.1145/3132168
Haider SHasenplaugh WAlistarh D(2016)Lease/releaseACM SIGPLAN Notices10.1145/3016078.285115551:8(1-12)Online publication date: 27-Feb-2016
https://dl.acm.org/doi/10.1145/3016078.2851155
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Elimination Trees and the Construction of Pools and Stacks

Linear Bidirectional On-Line Construction of Affix Trees

Linear-Time Construction of Two-Dimensional Suffix Trees