Task-resource scheduling problem

Authors:
Anna Gorbenko;Vladimir Popov
Affiliations:
Department of Intelligent Systems and Robotics, Ural State University, Ekaterinburg, Russian Federation 620083;Department of Intelligent Systems and Robotics, Ural State University, Ekaterinburg, Russian Federation 620083
Venue:
International Journal of Automation and Computing
Year:
2012

Citing 0
Cited 1

An energy and deadline aware resource provisioning, scheduling and optimization framework for cloud systems

Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cloud computing is a new and rapidly emerging computing paradigm where applications, data and IT services are provided over the Internet. The task-resource management is the key role in cloud computing systems. Task-resource scheduling problems are premier which relate to the efficiency of the whole cloud computing facilities. Task-resource scheduling problem is NP-complete. In this paper, we consider an approach to solve this problem optimally. This approach is based on constructing a logical model for the problem. Using this model, we can apply algorithms for the satisfiability problem (SAT) to solve the task-resource scheduling problem. Also, this model allows us to create a testbed for particle swarm optimization algorithms for scheduling workflows.