Multi-dimensional Resource Allocation for Data-intensive Large-scale Cloud Applications

  title={Multi-dimensional Resource Allocation for Data-intensive Large-scale Cloud Applications},
  author={Foued Jrad and Jie Tao and Ivona Brandi{\'c} and Achim Streit},
  booktitle={International Conference on Cloud Computing and Services Science},
Large scale applications are emerged as one of the important applications in distributed computing. Today, the economic and technical benefits offered by the Cloud computing technology encouraged many users to migrate their applications to Cloud. On the other hand, the variety of the existing Clouds requires them to make decisions about which providers to choose in order to achieve the expected performance and service quality while keeping the payment low. In this paper, we present a multi… 

Figures and Tables from this paper

SLA-aware and Cost-aware Provisioning and Scheduling of Cloud Resources across Multiple Data centres

This study proposes SLA driven resource provisioning and scheduling in multiple data centre environment and proposes a pruned tree based scheduling algorithm used to provision cloud resources and schedule the tasks.

Optimal MapReduce Job Scheduling algorithm across Cloud Federation

An exact scheduling algorithm to process MapReduce data-intensive applications across geo-distributed clusters that takes advantage of data locality while reducing both VM cost and data transfer cost (between clusters) subject to Deadline is proposed.

A service broker for Intercloud computing

The thesis addresses the multi-Cloud service selection problem by proposing a utility-based matching algorithm adopted from the economic theory which selects the Clouds, maximizing the user utility and presents an ontological model to semantically describe the service requirements and Cloud characteristics.

Cost-Efficient Distributed MapReduce Job Scheduling across Cloud Federation

Performance evaluation proves that the proposed algorithm FedSCD can reduce the MapReduce job cost by an average of 40% and ensure optimal resource allocation.

Policy-Aware Service Composition: Predicting Parallel Execution Performance of Composite Services

A model that embeds service policies into formulae to calculate composite service performance and predicts the optimal DOP for the composite service, where it attains the best performance is proposed.

Efficient Policy-Aware Deployment of Business Process in Cloud Federation

An algorithm for optimizing the resource allocation of the business process in Extended Federated BPaaS model in accordance with the requirements of the user’s policy is suggested and shows that the proposed model can effectively execute business processes with regards to infrastructure and data transfer costs.

Management of Service Level Agreements for Cloud Services in IoT: A Systematic Mapping Study

This paper investigates the existing research on the management of SLAs in IoT applications that are based on cloud services and identifies 328 primary studies, categorizes them into seven main technical classifications, and summarizes the research types, research contributions, and demographic information in these studies.



Managing Data-Intensive Workloads in a Cloud

A taxonomy is presented for workload management of data-intensive computing in the cloud and use the taxonomy to classify and evaluate current workload management mechanisms.

QoS-aware Deployment of Network of Virtual Appliances Across Multiple Clouds

Two different deployment approaches are proposed and compared: Forward-checking-based backtracking (FCBB) and genetic-based, which take into account Quality of Service (QoS) criteria such as reliability, data communication cost, and latency between multiple Clouds to choose the most appropriate combination of virtual machines and appliances.

A broker-based framework for multi-cloud workflows

A broker-based framework for running workflows in a multi-Cloud environment that allows an automatic selection of the target Clouds, a uniform access to the Clouds, and workflow data management with respect to user Service Level Agreement (SLA) requirements is presented.

BAR: An Efficient Data Locality Driven Task Scheduling Algorithm for Cloud Computing

A heuristic task scheduling algorithm called Balance-Reduce (BAR), in which an initial task allocation will be produced at first, then the job completion time can be reduced gradually by tuning the initial task allocated, by taking a global view.

CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms

The result of this case study proves that the federated Cloud computing model significantly improves the application QoS requirements under fluctuating resource and service demand patterns.

A Multi-objective Approach for Workflow Scheduling in Heterogeneous Environments

This paper proposes a general framework and heuristic algorithm for multi-objective static scheduling of scientific workflows in heterogeneous computing environments and demonstrates that the solutions generated by the algorithm are superior to user-defined constraints most of the time.

A data placement strategy in scientific cloud workflows

A utility-based approach for customised cloud service selection

This work developed a broker-based framework capable of automatically selecting cloud services based on user-defined requirement parameters and the service level agreement (SLA) attributes of the cloud providers.

Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet

The SmartNet resource scheduling system is described and compared to two different resource allocation strategies: load balancing and user directed assignment, and results indicate that, for the computer environments simulated, SmartNet outperforms both load balancingand user directed assignments, based on the maximum time users must wait for their tasks to finish.

A Truthful Dynamic Workflow Scheduling Mechanism for Commercial Multicloud Environments

A pricing model and a truthful mechanism for scheduling single tasks considering two objectives: monetary cost and completion time are introduced and extended for dynamic scheduling of scientific workflows.