Real-Time Workload Scheduling (RTWS) Algorithm for Cloud

Sabout Nagaraju and Latha Parthiban

Journal of Information, 2015, vol. 1, issue 1, 36-52

Abstract: Cloud computing is the revenue gain and most advanced technology that has tremendous advantages over other technologies. It can be used as a utility for executing large size of real-time programs. These programs are decomposed into multiple inter-dependent tasks and executed on the multiple virtual processors where the open research issue is to be minimized make-span of the scheduling tasks. Our research aims to address this issue and degenerate the schedule length approximately equal to the available number of virtual processors. We proposed a real-time workload scheduling algorithm that does very well in reducing the number of initial clusters. The experimental results show that the execution times for various kinds of the DAGs can be reduced as much as possible and improves the performance of the early load scheduling algorithms for distributed cloud environment.

Keywords: Clusters; Directed acyclic graphs; Distributed cloud; Virtual processors; Virtual machine (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
https://archive.conscientiabeam.com/index.php/104/article/view/2508/3863 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pkp:joinfo:v:1:y:2015:i:1:p:36-52:id:2508

Access Statistics for this article

More articles in Journal of Information from Conscientia Beam
Bibliographic data for series maintained by Dim Michael ().