Resource-aware hybrid scheduling algorithm in heterogeneous distributed computing

A coral-reefs and Game Theory-based approach for optimizing elastic cloud resource allocation

“…The migration process addresses each of the previous objectives, but some constraints should be considered: the overhead of the migration process, the impact on applications during migration, the degree of improvement in the specific resource utilization performance goals [19,25,26].…”

Current Perspective in Task Scheduling Techniques in Cloud Computing: A Review

“…The proposed provisioning algorithm (VOLNT-SPOT) compared the performance with the system that contains just volunteer resources (VOLNT) as it improves the system performance by increasing the percentage of workflows that meet the deadline with a factor of 75% in average with respect to the execution of workflows on the volunteer resources. Two Policies are considered in deploying public Cloud resources significantly to increase the percentage of workflow in which first policy considers 23% saving in cost average than the second policy while the second strategy just considers the relaxed deadline by a larger margin.In [51] proposed a hybrid approach for tasks scheduling in Heterogeneous Distributed Computing (HySARC2) and used hierarchical clustering of the available resources into groups. Authors considered different DAG scheduling strategies for independent task.…”

Hybrid Algorithm Based on an Estimation of Distribution Algorithm and Cuckoo Search for the No Idle Permutation Flow Shop Scheduling Problem with the Total Tardiness Criterion Minimization

“…Saadani et al [5] determined that the idle characteristic seriously affected the value of the makespan (Cmax) criterion in a three-stage, no idle flow-shop configuration. Given that the traditional exact optimization algorithm has limitations with the age of data exploration, heuristics has received increasing attention by solving the NIPFSP [6][7][8][9][10]. Dong et al [11] proposed an improved NEH-based heuristic with an initial sequence generated by combining the average job processing time.…”