Scalable and architecture independent parallel geometric algorithms with high probability optimal time.
Frank DehneClaire KenyonAndreas FabriPublished in: SPDP (1994)
Keyphrases
- highly scalable
- orders of magnitude
- parallel hardware
- computational cost
- management system
- learning algorithm
- significant improvement
- computationally efficient
- theoretical analysis
- map reduce
- parallel algorithm
- scale poorly
- multiprocessor systems
- optimality criterion
- depth first search
- parallel processing
- data streams