Bit Rate and Task Scheduling in Cloud Computing for Multimedia Big Data

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 81
  • Download : 0
As video traffic increases with plentiful multimedia services and the proliferation of mobile devices such as smartphones, stream mining to extract valuable information out of multimedia big data is garnering attention. By applying cloud computing to stream mining, resource-scarce mobile devices can offload the workloads of heavy applications to a remote cloud. However, resource provisioning for task scheduling is an inherent challenge of stream mining in cloud computing. In this paper we consider problem of resource provisioning and bit rate scaling for multimedia big data processing. We aim to minimize the virtual machine (VAI) leasing cost and the classification error cost while satisfying the deadline constraints of workloads which is formulated as a mixed integer nonlinear programming. Deadline based task scheduling and hit rate scaling are developed to find near optimal solution of the NP-hard problem. The upper and lower bounds of the required number of VMs are obtained for infeasible and feasible schedules respectively. Scaling down the highest bit rate first in the bit rate set of a workload is suggested to guarantee the minimum increase of error cost. Our simulation results show the efficiency of bit rate scaling in task scheduling. 5-10% cost reduction is achieved by bit rate scaling in a cloud computing environment.
Publisher
IEEE
Issue Date
2018-11
Language
English
Citation

28th International Telecommunication Networks and Applications Conference (ITNAC), pp.227 - 231

DOI
10.1109/ATNAC.2018.8615339
URI
http://hdl.handle.net/10203/274964
Appears in Collection
IE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0