A Group Tasks Scheduling Algorithm for Cloud Computing Networks based on QoS
نویسندگان
چکیده
منابع مشابه
Optimization Task Scheduling Algorithm in Cloud Computing
Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. This rese...
متن کاملTASA: A New Task Scheduling Algorithm in Cloud Computing
Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. It merges a lot of physical resources and offers them to users as services according to service level agreement. Therefore, resource management alongside with task scheduling has direct influence on cloud networks’ performance and efficiency. Presenting a proper scheduling ...
متن کاملtasa: a new task scheduling algorithm in cloud computing
cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. it merges a lot of physical resources and offers them to users as services according to service level agreement. therefore, resource management alongside with task scheduling has direct influence on cloud networks’ performance and efficiency. presenting a proper scheduling ...
متن کاملoptimization task scheduling algorithm in cloud computing
since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. this rese...
متن کاملQoS Constraint Based Workflow Scheduling for Cloud Computing Services
QoS constraint based workflow scheduling described by Directed Acyclic Graph (DAG) has been proved to be a NP-hard problem in Cloud Computing Services, especially for cost minimization under deadline constraint. Due to Deadline Bottom Level (DBL) hasn’t considered the concurrence during the real executing process that cause much more shatter time to solve such problem, this paper proposes a nov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i4.6.20236