ENHANCING QOS USING A NOVEL TASK SCHEDULING APPROACH IN CLOUD COMPUTING
Journal Title: Azerbaijan Journal of High Performance Computing - Year 2018, Vol 1, Issue 2
Abstract
Customers’ satisfaction at the ensured organizations has a strong reliance on the specific execution of appropriated registering from the perspectives of benefit bit and undertaking booking. Disregarding the way that this sort of organizations don’t require customers’ need of information about the particular detail of advantages (e.g., a machine), in light of the way that authority communities (e.g., specialists or server ranches) have arranged, virtualized and interfaced the benefits with the objective that the customers are awed that an earth-shattering machine has just relegated them. Everything considered, fulfilling the assurances determinedly depends upon the specific execution of circulated figuring, especially on the ideal approach to passing on an obliged measure of cloud resources for an enormous variety of or even unlimited errands requested by customers that much of the time ask for speedy organization yet minimal effort. For a reason for depiction in the field of appropriated registering, an errand is as often as possible named a Cloud or isolated into more diminutive Clouds [1] [2] [3], and an advantage is frequently conveyed as a VM. This paper is, thusly, induced to enhance the procedures of benefit assignment and errand booking by altogether considering the collections and capabilities of the characteristics and features of Clouds and machines. Midway as a result of different potential attractions of circulated registering, confident promoters defeat to ensure customers in a huge variety of organizations in a large and often, and the ensures as often as possible stable more than adequate.
Authors and Affiliations
Sudan Jha
Keywords
Related Articles
- EP ID EP540707
- DOI 10.32010/26166127.2018.1.2.185.213
- Views 69
- Downloads 0
SCALABLE COMPLEX EVENT PROCESSING USING RULE DISTRIBUTION
Complex event processing (CEP) systems are currently widely used in large-scale enterprises for the processing of high and dynamically changing rates of input events using large number of complex rules. Given the hardwar...
APPLYING MULTIPLE MULTIDIMENSIONAL KNAPSACK PROBLEM TO DYNAMIC LOAD BALANCING IN DISTRIBUTED EXASCALE COMPUTING ENVIRONMENT
Dynamic and Interactive nature of the processes in the Distributed Exascale computing system requires the system to be able to make Load Balancing in runtime. In this paper proposed applying Multiple Multidimensional Kna...
MULTI-START JAYA ALGORITHM FOR SOFTWARE MODULE CLUSTERING PROBLEM
Jaya algorithm has gained considerable attention lately due to its simplicity and requiring no control parameters (i.e. parameter free). Despite its potential, Jaya algorithm is inherently designed for single objective p...
CLOUD-BASED FLOWBSTER PORTAL TO DESIGN AND DEPLOY SCIENTIFIC WORKFLOWS
A workflow system called Flowbster has been designed to create efficient data pipelines in clouds. The entire Flowbster workflow is dynamically built by using virtual machines on a target cloud. The paper describes a rec...
LOAD BALANCING IN DISTRIBUTED EXASCALE COMPUTING BASED ON PROCESS REQUIREMENTS
In distributed Exascale systems, the occurrence of a dynamic and interactive nature changes the workload of the system’s computing elements. Because of this, the load balancer needs to collect information on the system s...