返回
A simple model to exploit reliable algorithms in cloud federations
DOI:10.1007/s00500-016-2143-9.png)
摘要
En 中文
Exploiting resources belonging to multiple cloud providers in an efficient way is still an open issue for distributed computing. Scheduling algorithms based on heuristic, probabilistic, queue theory, or complex soft computing methods are suitable to tackle the heterogeneity and dynamism present in cloud federations. Nevertheless, the available brokering tools are focused on the deployment of services on-demand. The systems able to accomplish high-throughput calculations, such as the pilot-job systems, do not support the inclusion of these algorithms due to their lack of adaptability. The recent implementation of cloud drivers for the GWpilot framework allows developers to profit from its flexibility, compatibility and scheduling features. Moreover, the framework allows the personalised characterisation of cloud resources that those algorithms require, overcoming their lack of trustworthiness in the information provided by the cloud services. In this work, a simple model together with a methodology to couple scheduling software with GWpilot is presented. To demonstrate the suitability of the approach, a legacy self-scheduler specialised on reliable executions in dynamic environments has been stacked and tested on the EGI FedCloud infrastructure with the Nagano legacy application.
Keyword:
Distributed computing
Pilot jobs
Modelling
IaaS
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
Produce prescription programs, bodily norms, and federal nutrition policy制定膳食处方计划、身体标准以及联邦营养政策
Fat Studies
IF0
Small Peptides Switch the Transcriptional Activity of Shavenbaby During
Drosophila
Embryogenesis
Science
IF0
Intelligent System for Estimation of the Spatial Position of Apples Based on YOLOv3 and Real Sense Depth Camera D415
Symmetry
IF0

