Low-overhead load-balanced scheduling for sparse tensor computations.
Muthu Manikandan BaskaranBenoît MeisterRichard LethinPublished in: HPEC (2014)
Keyphrases
- low overhead
- load balancing
- round robin
- scheduling algorithm
- scheduling policies
- tensor decomposition
- high reliability
- tensor factorization
- scheduling problem
- high order
- distributed systems
- peer to peer
- higher order
- digital libraries
- shared memory
- energy efficient
- low cost
- high dimensional
- real time
- distributed breakout
- communication cost
- mobile agents
- multi dimensional
- dimensionality reduction
- wireless sensor networks
- search algorithm
- data structure
- data sets