Dynamic scheduling for Cloud reliability using transportation Problem

Source: Internet
Author: User
Keywords nbsp;
Tags cloud programming scheduling using

Dynamic scheduling for Cloud reliability using transportation Problem

Senthil Kumar, S.K Balasubramanie

We propose a new algorithm using flushes linear programming problem transportation task based and scheduling Allocation for decentralized dynamic cloud computing.

Keywords:transportation problem, cloud reliability, viewable maximization, dynamic decentralized scheduling, Task Info Container (TFC)


Temp_12090910305219.pdf

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.