文章基本信息

标题：Divisible Resource Allocation to Minimize Cloud Task Length
本地全文：下载
作者：Sneha S. Tile ; Prof. Naresh Thoutam
期刊名称：International Journal of Electronics, Communication and Soft Computing Science and Engineering
印刷版ISSN：2277-9477
出版年度：2015
卷号：4
期号：Special 2
出版社：IJECSCSE
摘要：Now-a-days Cloud computing is used basically to getshare access to the divisible resources .All the applications usedby number of users are handled by cloud application.The usershould get easy and fast access to data in the cloud. Cloudcomputing environment involves high cost infrastructure. Thecomputational resources in cloud environment shouldmaintained high scalability. These resources need to be provided(allocation and scheduling) to the end users in most efficientmanner so that the lots of capabilities of cloud are utilizedeffectively and efficiently. But there are some constraints oncloud computing like payment budget and on demanVirtual machine is widely used to divide resources to accomplishtasks . Although, there are various algorithms and methods wereexisting to solve the problem of resource allocation but none ofthese algorithms can be extended. The present stusurveying the different task scheduling and resource allocationalgorithms for cloud
关键词：ODRA Algorithm; divisible-resource allocation;convex optimization; upper bound analysis; LOAA;web composition