K Baital, A Chakrabarti - Concurrency and Computation …, 2024 - Wiley Online Library
Optimizing energy consumption and maximizing throughput in multi‐core real‐time architectures through dynamic task scheduling is a critical design challenge. While …
KB Parmar, HB Prajapati… - … Conference on Green …, 2014 - ieeexplore.ieee.org
The cutting stock problem (CSP) is an important problem in class of combinatorial optimization problems because of its NP-hard nature. Cutting of the required material from …
Due to the high complexity of Grid computing systems, experimentation on a real Grid system is challenging and time consuming. Moreover, deploying a Grid system demands a …
TT Tejaswi, M Azharuddin, PK Jana - arXiv preprint arXiv:1511.08707, 2015 - arxiv.org
In multi-cloud environment, task scheduling has attracted a lot of attention due to NP- Complete nature of the problem. Moreover, it is very challenging due to heterogeneity of the …
Designing a task scheduling algorithm for precedence constrained task graphs is still a challenge due to its complexity (NP-complete). Hence the majority of the research in this …
SA Hamad, FA Omara - International Journal of Computer Science …, 2017 - academia.edu
The Cloud computing becomes an important topic in the area of high performance distributed computing. On the other hand, task scheduling is considered one the most …