Lower Bounds for Shared-Memory Leader Election Under Bounded Write Contention.
Dan AlistarhRati GelashviliGiorgi NadiradzePublished in: DISC (2021)
Keyphrases
- shared memory
- lower bound
- message passing
- upper bound
- parallel algorithm
- distributed memory
- parallel computing
- branch and bound algorithm
- np hard
- branch and bound
- multi processor
- parallel architecture
- parallel programming
- objective function
- parallel machines
- address space
- parallel execution
- optimal solution
- parallel architectures
- parallel computers
- interprocess communication
- concurrency control
- shared memory multiprocessors
- efficient implementation