A highly parallel algorithm to approximate MaxCut on distributed memory architectures.
Steven HomerMarcus PeinadoPublished in: IPPS (1995)
Keyphrases
- parallel algorithm
- shared memory
- distributed memory
- parallel computers
- parallel architectures
- ibm sp
- parallel computation
- interconnection networks
- parallel computing
- parallel implementations
- parallel programming
- multiprocessor systems
- parallel implementation
- parallel architecture
- multicore processors
- parallel machines
- cluster of workstations
- binary search trees
- highly parallel
- parallel version
- matrix multiplication
- message passing
- computer systems
- special case
- multithreading
- computer architecture
- general purpose