An optimal upper bound on the minimal completion time in distributed supercomputing.
Lars LundbergHåkan LennerstadPublished in: International Conference on Supercomputing (1994)
Keyphrases
- upper bound
- worst case
- lower bound
- efficiently computable
- dynamic programming
- distributed systems
- minimum distance
- optimal cost
- cooperative
- lightweight
- branch and bound algorithm
- peer to peer
- single item
- high performance computing
- lower and upper bounds
- distributed data
- distributed environment
- database
- information systems
- neural network
- data sets