Generalized Wake-Up: Amortized Shared Memory Lower Bounds for Linearizable Data Structures.
Siddhartha Visveswara JayantiPublished in: CoRR (2022)
Keyphrases
- shared memory
- lower bound
- data structure
- worst case
- quadratic assignment problem
- running times
- parallel algorithm
- message passing
- upper bound
- parallel computing
- multi processor
- parallel programming
- distributed memory
- external memory
- branch and bound algorithm
- search tree
- objective function
- branch and bound
- np hard
- address space
- parallel computers
- parallel architecture
- parallel machines
- parallel architectures
- optimal solution
- main memory
- parallel execution
- commodity hardware
- memory access
- multi core systems