Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention.
Dan AlistarhRati GelashviliGiorgi NadiradzePublished in: CoRR (2021)
Keyphrases
- shared memory
- lower bound
- message passing
- upper bound
- parallel algorithm
- distributed memory
- multi processor
- parallel computing
- branch and bound
- parallel programming
- branch and bound algorithm
- np hard
- objective function
- parallel machines
- shared memory multiprocessors
- parallel execution
- parallel architecture
- address space
- parallel computers
- multi core systems
- belief propagation
- memory access
- three dimensional
- shared memory multiprocessor
- parallel tree search
- concurrency control
- optimal solution
- bayesian networks
- high quality