Data-Aware Scheduling Strategy for Scientific Workflow Applications in IaaS Cloud Computing

Abstract

Scientific workflows benefit from the cloud computing paradigm, which offers access to virtual resources provisioned on pay-as-you-go and on-demand basis. Minimizing resources costs to meet user's budget is very important in a cloud environment. Several optimization approaches have been proposed to improve the performance and the cost of data-intensive scientific Workflow Scheduling (DiSWS) in cloud computing. However, in the literature, the majority of the DiSWS approaches focused on the use of heuristic and metaheuristic as an optimization method. Furthermore, the tasks hierarchy in data-intensive scientific workflows has not been extensively explored in the current literature. Specifically, in this paper, a data-intensive scientific workflow is represented as a hierarchy, which specifies hierarchical relations between workflow tasks, and an approach for data-intensive workflow scheduling applications is proposed. In this approach, first, the datasets and workflow tasks are modeled as a conditional probability matrix (CPM). Second, several data transformation and hierarchical clustering are applied to the CPM structure to determine the minimum number of virtual machines needed for the workflow execution. In this approach, the hierarchical clustering is done with respect to the budget imposed by the user. After data transformation and hierarchical clustering, the amount of data transmitted between clusters can be reduced, which can improve cost and makespan of the workflow by optimizing the use of virtual resources and network bandwidth. The performance and cost are analyzed using an extension of Cloudsim simulation tool and compared with existing multi-objective approaches. The results demonstrate that our approach reduces resources cost with respect to the user budgets.

Clustering Analysis for Automatic Certification of LMS Strategies in a University Virtual Campus

“…Although at least 30 clustering quality indexes have been proposed in the literature, not all of them are applicable to every case [51]. We measured the performance of each method by two typically employed quantities: homogeneity and heterogeneity [52]- [54].…”

Rate Allocation and Content Placement in Cache Networks

“…Nodes can thus fetch user-requested content [13], [14], or perform user-specified computation tasks [15], [16], instead of simply maintaining point to point communication sessions. In turn, such functionalities can address the ever increasing interest in running data-intensive applications in large-scale networks, such as machine learning at the edge [17], IoT-enabled health care [18], and scientific data-intensive computation [19], [20].…”