Login / Signup
Lower-bound time-complexity greening mechanism for duplication-based scheduling on large-scale computing platforms.
Tarek Hagras
Asmaa Atef
Yousef B. Mahdy
Published in:
J. Supercomput. (2019)
Keyphrases
</>
lower bound
computing platform
worst case
upper bound
computing systems
branch and bound algorithm
scheduling problem
distributed computing
cloud computing
objective function
trusted computing
optimal solution
artificial intelligence
open source
resource allocation
np hard
multi agent
databases