Scalable, low complexity, and fast greedy scheduling heuristics for highly heterogeneous distributed computing systems.
Cesar O. DiazJohnatan E. PeceroPascal BouvryPublished in: J. Supercomput. (2014)
Keyphrases
- low complexity
- highly heterogeneous
- distributed computing systems
- greedy heuristic
- distributed computing
- scheduling problem
- distributed processing
- greedy algorithm
- motion estimation
- scheduling algorithm
- computational complexity
- distributed computing environment
- np hard
- lower complexity
- resource allocation
- video streaming
- resource constraints
- wireless networks
- video encoder
- optical flow