A Scheduling Method of Moldable Parallel Tasks Considering Speedup and System Load on the Cloud

Abstract

The moldable parallel task (MPT) is a kind of parallel task that their sub-tasks hold the resources exclusively, which has been widely used in different areas. Our paper focuses on the scheduling of moldable tasks when every sub-task supports time-slice. The time-slice is a consecutive time that the sub-task holds the resources exclusively. After every time-slice, the sub-task can be canceled, suspended, or continued. We give the model of MPTs and propose a scheduling method for MPTs: MC (a heuristic scheduling method supporting time-slice model on the cloud). The simulation results show that, even under a forecast accuracy of system load under 90% and 95%, MC reduces average waiting time and average execution time; at the same time, MC has a lower value in the percentages of unfinished tasks. INDEX TERMS Moldable parallel task, speedup, parallelism, scheduling method.

Optimizing time delay in cloud using enhanced multi‐hold inherited maximization algorithm to reduce cost and improve bandwidth

“…As a layered approach, RB2B promotes two major balancing scenarios in which the layers work together to maximize the chances of better allocation. Li et al (2019), it is assumed that the system works in response to a system load. Therefore, we hope to develop some scheduling protocols that are adaptive to changing system loads in the future.…”

“…Li et al (2019), it is assumed that the system works in response to a system load. Therefore, we hope to develop some scheduling protocols that are adaptive to changing system loads in the future.…”

A Predictive Priority-Based Dynamic Resource Provisioning Scheme With Load Balancing in Heterogeneous Cloud Computing

“…When the server consolidation process occurs, it must be very effective for energy consumption and operating cost estimation. It may also cause servers' performance degradation if it is not properly defined [5,6]. From another perspective, server consolidation to solidify virtual machines on certain servers, making it more probable for machine overburden to happen.…”

“…As with the LNe indicating the load request sequence, equation ( 2) can be represented by the period that Prediction Priority Queue consumes on loading cloud request, in equation ( 4). The LNe loading emergency sequences are calculated according to equation (5) and vm is the time to load requests in a prediction-based queue.…”