Elimination Trees and the Construction of Pools and Stacks

Authors:
N. Shavit;D. Touitou
Affiliations:
Computer Science Department, Tel Aviv University, Ramat Aviv 69 978, Israel shanir@cs.tau.ac.il, danidin@cs.tau.ac.il, IL;Computer Science Department, Tel Aviv University, Ramat Aviv 69 978, Israel shanir@cs.tau.ac.il, danidin@cs.tau.ac.il, IL
Venue:
Theory of Computing Systems
Year:
1997

Citing 20
Cited 0

On maintaining dynamic information in a concurrent environment

SIAM Journal on Computing
Hierarchical correctness proofs for distributed algorithms

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Efficient synchronization primitives for large-scale cache-coherent multiprocessors

ASPLOS III Proceedings of the third international conference on Architectural support for programming languages and operating systems
Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithms for scalable synchronization on shared-memory multiprocessors

ACM Transactions on Computer Systems (TOCS)
A simple load balancing scheme for task allocation in parallel machines

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
An efficient implementation scheme of concurrent object-oriented languages on stock multicomputers

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A dynamic distributed load balancing algorithm with provable good performance

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Counting networks

Journal of the ACM (JACM)
Scalable concurrent counting

ACM Transactions on Computer Systems (TOCS)
Elimination trees and the construction of pools and stacks: preliminary version

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
The MIT Alewife machine: architecture and performance

ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
Diffracting trees

ACM Transactions on Computer Systems (TOCS)
A steady state analysis of diffracting trees (extended abstract)

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The strength of counting networks

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
CACHE COHERENCE PROTOCOLS FOR LARGE-SCALE MULTIPROCESSORS

CACHE COHERENCE PROTOCOLS FOR LARGE-SCALE MULTIPROCESSORS
PROTEUS: A HIGH-PERFORMANCE PARALLEL-ARCHITECTURE SIMULATOR

PROTEUS: A HIGH-PERFORMANCE PARALLEL-ARCHITECTURE SIMULATOR
Counting networks with arbitrary fan-out

Distributed Computing
Scheduling multithreaded computations by work stealing

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.