Title :
Resource Allocation for Real-Time Tasks Using Cloud Computing
Author :
Kumar, Karthik ; Feng, Jing ; Nimmagadda, Yamini ; Lu, Yung-Hsiang
Author_Institution :
Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA
fDate :
July 31 2011-Aug. 4 2011
Abstract :
This paper presents a method to allocate resources for real-time tasks using the "Infrastructure as a Service" model offered by cloud computing. Real-time tasks have to be completed before deadlines, and cloud computing offers selection of resources with different speeds and costs. In cloud computing, resource allocations can be scaled up based on the requirements; this is called elasticity and is the key difference from existing multiprocessor task allocation. Scalable resources make economical allocation of resources an important problem. We analyze the problem of allocating resources for a set of realtime tasks such that the economic cost is minimized and all the deadlines are met. We formulate the problem as a constrained optimization problem and propose a polynomial-time solution to allocate resources efficiently. We compare the economic costs and performance provided by our solution with the optimal solution and an EDF (earliest deadline first) method. We show how the cost varies based on the distribution of the tasks.
Keywords :
cloud computing; computational complexity; optimisation; processor scheduling; resource allocation; cloud computing; constrained optimization problem; earliest deadline first method; elasticity; infrastructure as a service model; polynomial-time solution; real-time tasks; resource allocation; Cloud computing; Equations; Optimization; Program processors; Real time systems; Resource management; Virtual machining;
Conference_Titel :
Computer Communications and Networks (ICCCN), 2011 Proceedings of 20th International Conference on
Conference_Location :
Maui, HI
Print_ISBN :
978-1-4577-0637-0
DOI :
10.1109/ICCCN.2011.6006077